| 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 10998 | . . 3 ⊢ <N = ( E ∩ (N × N)) | |
| 2 | 1 | breqi 5113 | . 2 ⊢ (𝐴 <N 𝐵 ↔ 𝐴( E ∩ (N × N))𝐵) |
| 3 | brinxp 5737 | . . 3 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 E 𝐵 ↔ 𝐴( E ∩ (N × N))𝐵)) | |
| 4 | epelg 5558 | . . . 4 ⊢ (𝐵 ∈ N → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)) | |
| 5 | 4 | adantl 487 | . . 3 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)) |
| 6 | 3, 5 | bitr3d 284 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴( E ∩ (N × N))𝐵 ↔ 𝐴 ∈ 𝐵)) |
| 7 | 2, 6 | bitrid 286 | 1 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 <N 𝐵 ↔ 𝐴 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2150 ∩ cin 4091 class class class wbr 5107 E cep 5556 × cxp 5655 Ncnpi 10967 <N clti 10970 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 ax-sep 5254 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-ne 2963 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-br 5108 df-opab 5173 df-eprel 5557 df-xp 5663 df-lti 10998 |
| This theorem is used by: ltexpi 11025 ltapi 11026 ltmpi 11027 1lt2pi 11028 nlt1pi 11029 indpi 11030 nqereu 11052 |
| Copyright terms: Public domain | W3C validator |