| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ltexpi | Structured version Visualization version GIF version | ||
| Description: Ordering on positive integers in terms of existence of sum. (Contributed by NM, 15-Mar-1996.) (Revised by Mario Carneiro, 14-Jun-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| ltexpi | ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 <N 𝐵 ↔ ∃𝑥 ∈ N (𝐴 +N 𝑥) = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pinn 10968 | . . 3 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω) | |
| 2 | pinn 10968 | . . 3 ⊢ (𝐵 ∈ N → 𝐵 ∈ ω) | |
| 3 | nnaordex 8652 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) | |
| 4 | 1, 2, 3 | syl2an 608 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 5 | ltpiord 10977 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 <N 𝐵 ↔ 𝐴 ∈ 𝐵)) | |
| 6 | addpiord 10974 | . . . . . . 7 ⊢ ((𝐴 ∈ N ∧ 𝑥 ∈ N) → (𝐴 +N 𝑥) = (𝐴 +o 𝑥)) | |
| 7 | 6 | eqeq1d 2762 | . . . . . 6 ⊢ ((𝐴 ∈ N ∧ 𝑥 ∈ N) → ((𝐴 +N 𝑥) = 𝐵 ↔ (𝐴 +o 𝑥) = 𝐵)) |
| 8 | 7 | pm5.32da 590 | . . . . 5 ⊢ (𝐴 ∈ N → ((𝑥 ∈ N ∧ (𝐴 +N 𝑥) = 𝐵) ↔ (𝑥 ∈ N ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 9 | elni2 10967 | . . . . . . 7 ⊢ (𝑥 ∈ N ↔ (𝑥 ∈ ω ∧ ∅ ∈ 𝑥)) | |
| 10 | 9 | anbi1i 636 | . . . . . 6 ⊢ ((𝑥 ∈ N ∧ (𝐴 +o 𝑥) = 𝐵) ↔ ((𝑥 ∈ ω ∧ ∅ ∈ 𝑥) ∧ (𝐴 +o 𝑥) = 𝐵)) |
| 11 | anass 474 | . . . . . 6 ⊢ (((𝑥 ∈ ω ∧ ∅ ∈ 𝑥) ∧ (𝐴 +o 𝑥) = 𝐵) ↔ (𝑥 ∈ ω ∧ (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) | |
| 12 | 10, 11 | bitri 278 | . . . . 5 ⊢ ((𝑥 ∈ N ∧ (𝐴 +o 𝑥) = 𝐵) ↔ (𝑥 ∈ ω ∧ (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 13 | 8, 12 | bitrdi 290 | . . . 4 ⊢ (𝐴 ∈ N → ((𝑥 ∈ N ∧ (𝐴 +N 𝑥) = 𝐵) ↔ (𝑥 ∈ ω ∧ (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵)))) |
| 14 | 13 | rexbidv2 3182 | . . 3 ⊢ (𝐴 ∈ N → (∃𝑥 ∈ N (𝐴 +N 𝑥) = 𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 15 | 14 | adantr 486 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (∃𝑥 ∈ N (𝐴 +N 𝑥) = 𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 16 | 4, 5, 15 | 3bitr4d 314 | 1 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 <N 𝐵 ↔ ∃𝑥 ∈ N (𝐴 +N 𝑥) = 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 ∅c0 4277 class class class wbr 5102 (class class class)co 7422 ωcom 7879 +o coa 8478 Ncnpi 10934 +N cpli 10935 <N clti 10937 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7753 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-ov 7425 df-oprab 7426 df-mpo 7427 df-om 7880 df-2nd 8004 df-frecs 8304 df-wrecs 8335 df-recs 8384 df-rdg 8423 df-oadd 8485 df-ni 10962 df-pli 10963 df-lti 10965 |
| This theorem is used by: ltexnq 11065 archnq 11070 |
| Copyright terms: Public domain | W3C validator |