ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nnsucelsuc GIF version

Theorem nnsucelsuc 6658
Description: Membership is inherited by successors. The reverse direction holds for all ordinals, as seen at onsucelsucr 4606, but the forward direction, for all ordinals, implies excluded middle as seen as onsucelsucexmid 4628. (Contributed by Jim Kingdon, 25-Aug-2019.)
Assertion
Ref Expression
nnsucelsuc (𝐵 ∈ ω → (𝐴𝐵 ↔ suc 𝐴 ∈ suc 𝐵))

Proof of Theorem nnsucelsuc
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq2 2295 . . . 4 (𝑥 = ∅ → (𝐴𝑥𝐴 ∈ ∅))
2 suceq 4499 . . . . 5 (𝑥 = ∅ → suc 𝑥 = suc ∅)
32eleq2d 2301 . . . 4 (𝑥 = ∅ → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc ∅))
41, 3imbi12d 234 . . 3 (𝑥 = ∅ → ((𝐴𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ ∅ → suc 𝐴 ∈ suc ∅)))
5 eleq2 2295 . . . 4 (𝑥 = 𝑦 → (𝐴𝑥𝐴𝑦))
6 suceq 4499 . . . . 5 (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
76eleq2d 2301 . . . 4 (𝑥 = 𝑦 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc 𝑦))
85, 7imbi12d 234 . . 3 (𝑥 = 𝑦 → ((𝐴𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴𝑦 → suc 𝐴 ∈ suc 𝑦)))
9 eleq2 2295 . . . 4 (𝑥 = suc 𝑦 → (𝐴𝑥𝐴 ∈ suc 𝑦))
10 suceq 4499 . . . . 5 (𝑥 = suc 𝑦 → suc 𝑥 = suc suc 𝑦)
1110eleq2d 2301 . . . 4 (𝑥 = suc 𝑦 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc suc 𝑦))
129, 11imbi12d 234 . . 3 (𝑥 = suc 𝑦 → ((𝐴𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ suc 𝑦 → suc 𝐴 ∈ suc suc 𝑦)))
13 eleq2 2295 . . . 4 (𝑥 = 𝐵 → (𝐴𝑥𝐴𝐵))
14 suceq 4499 . . . . 5 (𝑥 = 𝐵 → suc 𝑥 = suc 𝐵)
1514eleq2d 2301 . . . 4 (𝑥 = 𝐵 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc 𝐵))
1613, 15imbi12d 234 . . 3 (𝑥 = 𝐵 → ((𝐴𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴𝐵 → suc 𝐴 ∈ suc 𝐵)))
17 noel 3498 . . . 4 ¬ 𝐴 ∈ ∅
1817pm2.21i 651 . . 3 (𝐴 ∈ ∅ → suc 𝐴 ∈ suc ∅)
19 elsuci 4500 . . . . . . . 8 (𝐴 ∈ suc 𝑦 → (𝐴𝑦𝐴 = 𝑦))
2019adantl 277 . . . . . . 7 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴𝑦𝐴 = 𝑦))
21 simpl 109 . . . . . . . 8 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴𝑦 → suc 𝐴 ∈ suc 𝑦))
22 suceq 4499 . . . . . . . . 9 (𝐴 = 𝑦 → suc 𝐴 = suc 𝑦)
2322a1i 9 . . . . . . . 8 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴 = 𝑦 → suc 𝐴 = suc 𝑦))
2421, 23orim12d 793 . . . . . . 7 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → ((𝐴𝑦𝐴 = 𝑦) → (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦)))
2520, 24mpd 13 . . . . . 6 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦))
26 vex 2805 . . . . . . . 8 𝑦 ∈ V
2726sucex 4597 . . . . . . 7 suc 𝑦 ∈ V
2827elsuc2 4504 . . . . . 6 (suc 𝐴 ∈ suc suc 𝑦 ↔ (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦))
2925, 28sylibr 134 . . . . 5 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → suc 𝐴 ∈ suc suc 𝑦)
3029ex 115 . . . 4 ((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) → (𝐴 ∈ suc 𝑦 → suc 𝐴 ∈ suc suc 𝑦))
3130a1i 9 . . 3 (𝑦 ∈ ω → ((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) → (𝐴 ∈ suc 𝑦 → suc 𝐴 ∈ suc suc 𝑦)))
324, 8, 12, 16, 18, 31finds 4698 . 2 (𝐵 ∈ ω → (𝐴𝐵 → suc 𝐴 ∈ suc 𝐵))
33 nnon 4708 . . 3 (𝐵 ∈ ω → 𝐵 ∈ On)
34 onsucelsucr 4606 . . 3 (𝐵 ∈ On → (suc 𝐴 ∈ suc 𝐵𝐴𝐵))
3533, 34syl 14 . 2 (𝐵 ∈ ω → (suc 𝐴 ∈ suc 𝐵𝐴𝐵))
3632, 35impbid 129 1 (𝐵 ∈ ω → (𝐴𝐵 ↔ suc 𝐴 ∈ suc 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wo 715   = wceq 1397  wcel 2202  c0 3494  Oncon0 4460  suc csuc 4462  ωcom 4688
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-uni 3894  df-int 3929  df-tr 4188  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689
This theorem is referenced by:  nnsucsssuc  6659  nntri3or  6660  nnsucuniel  6662  nnaordi  6675  ennnfonelemhom  13035
  Copyright terms: Public domain W3C validator