| 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 10858 | . . 3 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω) | |
| 2 | pinn 10858 | . . 3 ⊢ (𝐵 ∈ N → 𝐵 ∈ ω) | |
| 3 | nnaordex 8620 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) | |
| 4 | 1, 2, 3 | syl2an 607 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 5 | ltpiord 10867 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 <N 𝐵 ↔ 𝐴 ∈ 𝐵)) | |
| 6 | addpiord 10864 | . . . . . . 7 ⊢ ((𝐴 ∈ N ∧ 𝑥 ∈ N) → (𝐴 +N 𝑥) = (𝐴 +o 𝑥)) | |
| 7 | 6 | eqeq1d 2765 | . . . . . 6 ⊢ ((𝐴 ∈ N ∧ 𝑥 ∈ N) → ((𝐴 +N 𝑥) = 𝐵 ↔ (𝐴 +o 𝑥) = 𝐵)) |
| 8 | 7 | pm5.32da 589 | . . . . 5 ⊢ (𝐴 ∈ N → ((𝑥 ∈ N ∧ (𝐴 +N 𝑥) = 𝐵) ↔ (𝑥 ∈ N ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 9 | elni2 10857 | . . . . . . 7 ⊢ (𝑥 ∈ N ↔ (𝑥 ∈ ω ∧ ∅ ∈ 𝑥)) | |
| 10 | 9 | anbi1i 635 | . . . . . 6 ⊢ ((𝑥 ∈ N ∧ (𝐴 +o 𝑥) = 𝐵) ↔ ((𝑥 ∈ ω ∧ ∅ ∈ 𝑥) ∧ (𝐴 +o 𝑥) = 𝐵)) |
| 11 | anass 473 | . . . . . 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 3185 | . . 3 ⊢ (𝐴 ∈ N → (∃𝑥 ∈ N (𝐴 +N 𝑥) = 𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 15 | 14 | adantr 485 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (∃𝑥 ∈ N (𝐴 +N 𝑥) = 𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 16 | 4, 5, 15 | 3bitr4d 314 | 1 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 <N 𝐵 ↔ ∃𝑥 ∈ N (𝐴 +N 𝑥) = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∃wrex 3089 ∅c0 4286 class class class wbr 5109 (class class class)co 7410 ωcom 7858 +o coa 8446 Ncnpi 10824 +N cpli 10825 <N clti 10827 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-oadd 8453 df-ni 10852 df-pli 10853 df-lti 10855 |
| This theorem is referenced by: ltexnq 10955 archnq 10960 |
| Copyright terms: Public domain | W3C validator |