Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ltpiord | Structured version Visualization version GIF version |
Description: Positive integer 'less than' in terms of ordinal membership. (Contributed by NM, 6-Feb-1996.) (Revised by Mario Carneiro, 28-Apr-2015.) (New usage is discouraged.) |
Ref | Expression |
---|---|
ltpiord | ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 <N 𝐵 ↔ 𝐴 ∈ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-lti 10285 | . . 3 ⊢ <N = ( E ∩ (N × N)) | |
2 | 1 | breqi 5063 | . 2 ⊢ (𝐴 <N 𝐵 ↔ 𝐴( E ∩ (N × N))𝐵) |
3 | brinxp 5623 | . . 3 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 E 𝐵 ↔ 𝐴( E ∩ (N × N))𝐵)) | |
4 | epelg 5459 | . . . 4 ⊢ (𝐵 ∈ N → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)) | |
5 | 4 | adantl 482 | . . 3 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)) |
6 | 3, 5 | bitr3d 282 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴( E ∩ (N × N))𝐵 ↔ 𝐴 ∈ 𝐵)) |
7 | 2, 6 | syl5bb 284 | 1 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 <N 𝐵 ↔ 𝐴 ∈ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∈ wcel 2105 ∩ cin 3932 class class class wbr 5057 E cep 5457 × cxp 5546 Ncnpi 10254 <N clti 10257 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pr 5320 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-br 5058 df-opab 5120 df-eprel 5458 df-xp 5554 df-lti 10285 |
This theorem is referenced by: ltexpi 10312 ltapi 10313 ltmpi 10314 1lt2pi 10315 nlt1pi 10316 indpi 10317 nqereu 10339 |
Copyright terms: Public domain | W3C validator |