| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ltexpi | 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.) |
| Ref | Expression |
|---|---|
| ltexpi | ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 <N 𝐵 ↔ ∃𝑥 ∈ N (𝐴 +N 𝑥) = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pinn 7435 | . . 3 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω) | |
| 2 | pinn 7435 | . . 3 ⊢ (𝐵 ∈ N → 𝐵 ∈ ω) | |
| 3 | nnaordex 6624 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) | |
| 4 | 1, 2, 3 | syl2an 289 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 5 | ltpiord 7445 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 <N 𝐵 ↔ 𝐴 ∈ 𝐵)) | |
| 6 | addpiord 7442 | . . . . . . 7 ⊢ ((𝐴 ∈ N ∧ 𝑥 ∈ N) → (𝐴 +N 𝑥) = (𝐴 +o 𝑥)) | |
| 7 | 6 | eqeq1d 2215 | . . . . . 6 ⊢ ((𝐴 ∈ N ∧ 𝑥 ∈ N) → ((𝐴 +N 𝑥) = 𝐵 ↔ (𝐴 +o 𝑥) = 𝐵)) |
| 8 | 7 | pm5.32da 452 | . . . . 5 ⊢ (𝐴 ∈ N → ((𝑥 ∈ N ∧ (𝐴 +N 𝑥) = 𝐵) ↔ (𝑥 ∈ N ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 9 | elni2 7440 | . . . . . . 7 ⊢ (𝑥 ∈ N ↔ (𝑥 ∈ ω ∧ ∅ ∈ 𝑥)) | |
| 10 | 9 | anbi1i 458 | . . . . . 6 ⊢ ((𝑥 ∈ N ∧ (𝐴 +o 𝑥) = 𝐵) ↔ ((𝑥 ∈ ω ∧ ∅ ∈ 𝑥) ∧ (𝐴 +o 𝑥) = 𝐵)) |
| 11 | anass 401 | . . . . . 6 ⊢ (((𝑥 ∈ ω ∧ ∅ ∈ 𝑥) ∧ (𝐴 +o 𝑥) = 𝐵) ↔ (𝑥 ∈ ω ∧ (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) | |
| 12 | 10, 11 | bitri 184 | . . . . 5 ⊢ ((𝑥 ∈ N ∧ (𝐴 +o 𝑥) = 𝐵) ↔ (𝑥 ∈ ω ∧ (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 13 | 8, 12 | bitrdi 196 | . . . 4 ⊢ (𝐴 ∈ N → ((𝑥 ∈ N ∧ (𝐴 +N 𝑥) = 𝐵) ↔ (𝑥 ∈ ω ∧ (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵)))) |
| 14 | 13 | rexbidv2 2510 | . . 3 ⊢ (𝐴 ∈ N → (∃𝑥 ∈ N (𝐴 +N 𝑥) = 𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 15 | 14 | adantr 276 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (∃𝑥 ∈ N (𝐴 +N 𝑥) = 𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵))) |
| 16 | 4, 5, 15 | 3bitr4d 220 | 1 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 <N 𝐵 ↔ ∃𝑥 ∈ N (𝐴 +N 𝑥) = 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1373 ∈ wcel 2177 ∃wrex 2486 ∅c0 3462 class class class wbr 4048 ωcom 4643 (class class class)co 5954 +o coa 6509 Ncnpi 7398 +N cpli 7399 <N clti 7401 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-coll 4164 ax-sep 4167 ax-nul 4175 ax-pow 4223 ax-pr 4258 ax-un 4485 ax-setind 4590 ax-iinf 4641 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3001 df-csb 3096 df-dif 3170 df-un 3172 df-in 3174 df-ss 3181 df-nul 3463 df-pw 3620 df-sn 3641 df-pr 3642 df-op 3644 df-uni 3854 df-int 3889 df-iun 3932 df-br 4049 df-opab 4111 df-mpt 4112 df-tr 4148 df-eprel 4341 df-id 4345 df-iord 4418 df-on 4420 df-suc 4423 df-iom 4644 df-xp 4686 df-rel 4687 df-cnv 4688 df-co 4689 df-dm 4690 df-rn 4691 df-res 4692 df-ima 4693 df-iota 5238 df-fun 5279 df-fn 5280 df-f 5281 df-f1 5282 df-fo 5283 df-f1o 5284 df-fv 5285 df-ov 5957 df-oprab 5958 df-mpo 5959 df-1st 6236 df-2nd 6237 df-recs 6401 df-irdg 6466 df-1o 6512 df-oadd 6516 df-ni 7430 df-pli 7431 df-lti 7433 |
| This theorem is referenced by: ltexnqq 7534 |
| Copyright terms: Public domain | W3C validator |