| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > peano2nnnn | GIF version | ||
| Description: A successor of a positive integer is a positive integer. This is a counterpart to peano2nn 9197 designed for real number axioms which involve to natural numbers (notably, axcaucvg 8163). (Contributed by Jim Kingdon, 14-Jul-2021.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| peano1nnnn.n | ⊢ 𝑁 = ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} |
| Ref | Expression |
|---|---|
| peano2nnnn | ⊢ (𝐴 ∈ 𝑁 → (𝐴 + 1) ∈ 𝑁) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | peano1nnnn.n | . . . . . 6 ⊢ 𝑁 = ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} | |
| 2 | 1 | eleq2i 2298 | . . . . 5 ⊢ (𝐴 ∈ 𝑁 ↔ 𝐴 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}) |
| 3 | elintg 3941 | . . . . 5 ⊢ (𝐴 ∈ 𝑁 → (𝐴 ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 ∈ 𝑧)) | |
| 4 | 2, 3 | bitrid 192 | . . . 4 ⊢ (𝐴 ∈ 𝑁 → (𝐴 ∈ 𝑁 ↔ ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 ∈ 𝑧)) |
| 5 | 4 | ibi 176 | . . 3 ⊢ (𝐴 ∈ 𝑁 → ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 ∈ 𝑧) |
| 6 | vex 2806 | . . . . . . . 8 ⊢ 𝑧 ∈ V | |
| 7 | eleq2 2295 | . . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (1 ∈ 𝑥 ↔ 1 ∈ 𝑧)) | |
| 8 | eleq2 2295 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → ((𝑦 + 1) ∈ 𝑥 ↔ (𝑦 + 1) ∈ 𝑧)) | |
| 9 | 8 | raleqbi1dv 2743 | . . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥 ↔ ∀𝑦 ∈ 𝑧 (𝑦 + 1) ∈ 𝑧)) |
| 10 | 7, 9 | anbi12d 473 | . . . . . . . 8 ⊢ (𝑥 = 𝑧 → ((1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥) ↔ (1 ∈ 𝑧 ∧ ∀𝑦 ∈ 𝑧 (𝑦 + 1) ∈ 𝑧))) |
| 11 | 6, 10 | elab 2951 | . . . . . . 7 ⊢ (𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ (1 ∈ 𝑧 ∧ ∀𝑦 ∈ 𝑧 (𝑦 + 1) ∈ 𝑧)) |
| 12 | 11 | simprbi 275 | . . . . . 6 ⊢ (𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} → ∀𝑦 ∈ 𝑧 (𝑦 + 1) ∈ 𝑧) |
| 13 | oveq1 6035 | . . . . . . . 8 ⊢ (𝑦 = 𝐴 → (𝑦 + 1) = (𝐴 + 1)) | |
| 14 | 13 | eleq1d 2300 | . . . . . . 7 ⊢ (𝑦 = 𝐴 → ((𝑦 + 1) ∈ 𝑧 ↔ (𝐴 + 1) ∈ 𝑧)) |
| 15 | 14 | rspcva 2909 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑧 ∧ ∀𝑦 ∈ 𝑧 (𝑦 + 1) ∈ 𝑧) → (𝐴 + 1) ∈ 𝑧) |
| 16 | 12, 15 | sylan2 286 | . . . . 5 ⊢ ((𝐴 ∈ 𝑧 ∧ 𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}) → (𝐴 + 1) ∈ 𝑧) |
| 17 | 16 | expcom 116 | . . . 4 ⊢ (𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} → (𝐴 ∈ 𝑧 → (𝐴 + 1) ∈ 𝑧)) |
| 18 | 17 | ralimia 2594 | . . 3 ⊢ (∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}𝐴 ∈ 𝑧 → ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} (𝐴 + 1) ∈ 𝑧) |
| 19 | 5, 18 | syl 14 | . 2 ⊢ (𝐴 ∈ 𝑁 → ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} (𝐴 + 1) ∈ 𝑧) |
| 20 | df-1 8083 | . . . . 5 ⊢ 1 = 〈1R, 0R〉 | |
| 21 | 1sr 8014 | . . . . . 6 ⊢ 1R ∈ R | |
| 22 | 0r 8013 | . . . . . 6 ⊢ 0R ∈ R | |
| 23 | opexg 4326 | . . . . . 6 ⊢ ((1R ∈ R ∧ 0R ∈ R) → 〈1R, 0R〉 ∈ V) | |
| 24 | 21, 22, 23 | mp2an 426 | . . . . 5 ⊢ 〈1R, 0R〉 ∈ V |
| 25 | 20, 24 | eqeltri 2304 | . . . 4 ⊢ 1 ∈ V |
| 26 | addvalex 8107 | . . . 4 ⊢ ((𝐴 ∈ 𝑁 ∧ 1 ∈ V) → (𝐴 + 1) ∈ V) | |
| 27 | 25, 26 | mpan2 425 | . . 3 ⊢ (𝐴 ∈ 𝑁 → (𝐴 + 1) ∈ V) |
| 28 | 1 | eleq2i 2298 | . . . 4 ⊢ ((𝐴 + 1) ∈ 𝑁 ↔ (𝐴 + 1) ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)}) |
| 29 | elintg 3941 | . . . 4 ⊢ ((𝐴 + 1) ∈ V → ((𝐴 + 1) ∈ ∩ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} ↔ ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} (𝐴 + 1) ∈ 𝑧)) | |
| 30 | 28, 29 | bitrid 192 | . . 3 ⊢ ((𝐴 + 1) ∈ V → ((𝐴 + 1) ∈ 𝑁 ↔ ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} (𝐴 + 1) ∈ 𝑧)) |
| 31 | 27, 30 | syl 14 | . 2 ⊢ (𝐴 ∈ 𝑁 → ((𝐴 + 1) ∈ 𝑁 ↔ ∀𝑧 ∈ {𝑥 ∣ (1 ∈ 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑦 + 1) ∈ 𝑥)} (𝐴 + 1) ∈ 𝑧)) |
| 32 | 19, 31 | mpbird 167 | 1 ⊢ (𝐴 ∈ 𝑁 → (𝐴 + 1) ∈ 𝑁) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2202 {cab 2217 ∀wral 2511 Vcvv 2803 〈cop 3676 ∩ cint 3933 (class class class)co 6028 Rcnr 7560 0Rc0r 7561 1Rc1r 7562 1c1 8076 + caddc 8078 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-eprel 4392 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-irdg 6579 df-1o 6625 df-2o 6626 df-oadd 6629 df-omul 6630 df-er 6745 df-ec 6747 df-qs 6751 df-ni 7567 df-pli 7568 df-mi 7569 df-lti 7570 df-plpq 7607 df-mpq 7608 df-enq 7610 df-nqqs 7611 df-plqqs 7612 df-mqqs 7613 df-1nqqs 7614 df-rq 7615 df-ltnqqs 7616 df-enq0 7687 df-nq0 7688 df-0nq0 7689 df-plq0 7690 df-mq0 7691 df-inp 7729 df-i1p 7730 df-iplp 7731 df-enr 7989 df-nr 7990 df-0r 7994 df-1r 7995 df-c 8081 df-1 8083 df-add 8086 |
| This theorem is referenced by: nnindnn 8156 |
| Copyright terms: Public domain | W3C validator |