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

Theorem nnsucelsuc 6654
Description: Membership is inherited by successors. The reverse direction holds for all ordinals, as seen at onsucelsucr 4604, but the forward direction, for all ordinals, implies excluded middle as seen as onsucelsucexmid 4626. (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 2293 . . . 4 (𝑥 = ∅ → (𝐴𝑥𝐴 ∈ ∅))
2 suceq 4497 . . . . 5 (𝑥 = ∅ → suc 𝑥 = suc ∅)
32eleq2d 2299 . . . 4 (𝑥 = ∅ → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc ∅))
41, 3imbi12d 234 . . 3 (𝑥 = ∅ → ((𝐴𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ ∅ → suc 𝐴 ∈ suc ∅)))
5 eleq2 2293 . . . 4 (𝑥 = 𝑦 → (𝐴𝑥𝐴𝑦))
6 suceq 4497 . . . . 5 (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
76eleq2d 2299 . . . 4 (𝑥 = 𝑦 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc 𝑦))
85, 7imbi12d 234 . . 3 (𝑥 = 𝑦 → ((𝐴𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴𝑦 → suc 𝐴 ∈ suc 𝑦)))
9 eleq2 2293 . . . 4 (𝑥 = suc 𝑦 → (𝐴𝑥𝐴 ∈ suc 𝑦))
10 suceq 4497 . . . . 5 (𝑥 = suc 𝑦 → suc 𝑥 = suc suc 𝑦)
1110eleq2d 2299 . . . 4 (𝑥 = suc 𝑦 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc suc 𝑦))
129, 11imbi12d 234 . . 3 (𝑥 = suc 𝑦 → ((𝐴𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ suc 𝑦 → suc 𝐴 ∈ suc suc 𝑦)))
13 eleq2 2293 . . . 4 (𝑥 = 𝐵 → (𝐴𝑥𝐴𝐵))
14 suceq 4497 . . . . 5 (𝑥 = 𝐵 → suc 𝑥 = suc 𝐵)
1514eleq2d 2299 . . . 4 (𝑥 = 𝐵 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc 𝐵))
1613, 15imbi12d 234 . . 3 (𝑥 = 𝐵 → ((𝐴𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴𝐵 → suc 𝐴 ∈ suc 𝐵)))
17 noel 3496 . . . 4 ¬ 𝐴 ∈ ∅
1817pm2.21i 649 . . 3 (𝐴 ∈ ∅ → suc 𝐴 ∈ suc ∅)
19 elsuci 4498 . . . . . . . 8 (𝐴 ∈ suc 𝑦 → (𝐴𝑦𝐴 = 𝑦))
2019adantl 277 . . . . . . 7 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴𝑦𝐴 = 𝑦))
21 simpl 109 . . . . . . . 8 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴𝑦 → suc 𝐴 ∈ suc 𝑦))
22 suceq 4497 . . . . . . . . 9 (𝐴 = 𝑦 → suc 𝐴 = suc 𝑦)
2322a1i 9 . . . . . . . 8 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴 = 𝑦 → suc 𝐴 = suc 𝑦))
2421, 23orim12d 791 . . . . . . 7 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → ((𝐴𝑦𝐴 = 𝑦) → (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦)))
2520, 24mpd 13 . . . . . 6 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦))
26 vex 2803 . . . . . . . 8 𝑦 ∈ V
2726sucex 4595 . . . . . . 7 suc 𝑦 ∈ V
2827elsuc2 4502 . . . . . 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 4696 . 2 (𝐵 ∈ ω → (𝐴𝐵 → suc 𝐴 ∈ suc 𝐵))
33 nnon 4706 . . 3 (𝐵 ∈ ω → 𝐵 ∈ On)
34 onsucelsucr 4604 . . 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 713   = wceq 1395  wcel 2200  c0 3492  Oncon0 4458  suc csuc 4460  ωcom 4686
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-iinf 4684
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-uni 3892  df-int 3927  df-tr 4186  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687
This theorem is referenced by:  nnsucsssuc  6655  nntri3or  6656  nnsucuniel  6658  nnaordi  6671  ennnfonelemhom  13026
  Copyright terms: Public domain W3C validator