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

Theorem nnsucelsuc 6395
Description: Membership is inherited by successors. The reverse direction holds for all ordinals, as seen at onsucelsucr 4432, but the forward direction, for all ordinals, implies excluded middle as seen as onsucelsucexmid 4453. (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 2204 . . . 4 (𝑥 = ∅ → (𝐴𝑥𝐴 ∈ ∅))
2 suceq 4332 . . . . 5 (𝑥 = ∅ → suc 𝑥 = suc ∅)
32eleq2d 2210 . . . 4 (𝑥 = ∅ → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc ∅))
41, 3imbi12d 233 . . 3 (𝑥 = ∅ → ((𝐴𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ ∅ → suc 𝐴 ∈ suc ∅)))
5 eleq2 2204 . . . 4 (𝑥 = 𝑦 → (𝐴𝑥𝐴𝑦))
6 suceq 4332 . . . . 5 (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
76eleq2d 2210 . . . 4 (𝑥 = 𝑦 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc 𝑦))
85, 7imbi12d 233 . . 3 (𝑥 = 𝑦 → ((𝐴𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴𝑦 → suc 𝐴 ∈ suc 𝑦)))
9 eleq2 2204 . . . 4 (𝑥 = suc 𝑦 → (𝐴𝑥𝐴 ∈ suc 𝑦))
10 suceq 4332 . . . . 5 (𝑥 = suc 𝑦 → suc 𝑥 = suc suc 𝑦)
1110eleq2d 2210 . . . 4 (𝑥 = suc 𝑦 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc suc 𝑦))
129, 11imbi12d 233 . . 3 (𝑥 = suc 𝑦 → ((𝐴𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ suc 𝑦 → suc 𝐴 ∈ suc suc 𝑦)))
13 eleq2 2204 . . . 4 (𝑥 = 𝐵 → (𝐴𝑥𝐴𝐵))
14 suceq 4332 . . . . 5 (𝑥 = 𝐵 → suc 𝑥 = suc 𝐵)
1514eleq2d 2210 . . . 4 (𝑥 = 𝐵 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc 𝐵))
1613, 15imbi12d 233 . . 3 (𝑥 = 𝐵 → ((𝐴𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴𝐵 → suc 𝐴 ∈ suc 𝐵)))
17 noel 3372 . . . 4 ¬ 𝐴 ∈ ∅
1817pm2.21i 636 . . 3 (𝐴 ∈ ∅ → suc 𝐴 ∈ suc ∅)
19 elsuci 4333 . . . . . . . 8 (𝐴 ∈ suc 𝑦 → (𝐴𝑦𝐴 = 𝑦))
2019adantl 275 . . . . . . 7 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴𝑦𝐴 = 𝑦))
21 simpl 108 . . . . . . . 8 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴𝑦 → suc 𝐴 ∈ suc 𝑦))
22 suceq 4332 . . . . . . . . 9 (𝐴 = 𝑦 → suc 𝐴 = suc 𝑦)
2322a1i 9 . . . . . . . 8 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴 = 𝑦 → suc 𝐴 = suc 𝑦))
2421, 23orim12d 776 . . . . . . 7 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → ((𝐴𝑦𝐴 = 𝑦) → (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦)))
2520, 24mpd 13 . . . . . 6 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦))
26 vex 2692 . . . . . . . 8 𝑦 ∈ V
2726sucex 4423 . . . . . . 7 suc 𝑦 ∈ V
2827elsuc2 4337 . . . . . 6 (suc 𝐴 ∈ suc suc 𝑦 ↔ (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦))
2925, 28sylibr 133 . . . . 5 (((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → suc 𝐴 ∈ suc suc 𝑦)
3029ex 114 . . . 4 ((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) → (𝐴 ∈ suc 𝑦 → suc 𝐴 ∈ suc suc 𝑦))
3130a1i 9 . . 3 (𝑦 ∈ ω → ((𝐴𝑦 → suc 𝐴 ∈ suc 𝑦) → (𝐴 ∈ suc 𝑦 → suc 𝐴 ∈ suc suc 𝑦)))
324, 8, 12, 16, 18, 31finds 4522 . 2 (𝐵 ∈ ω → (𝐴𝐵 → suc 𝐴 ∈ suc 𝐵))
33 nnon 4531 . . 3 (𝐵 ∈ ω → 𝐵 ∈ On)
34 onsucelsucr 4432 . . 3 (𝐵 ∈ On → (suc 𝐴 ∈ suc 𝐵𝐴𝐵))
3533, 34syl 14 . 2 (𝐵 ∈ ω → (suc 𝐴 ∈ suc 𝐵𝐴𝐵))
3632, 35impbid 128 1 (𝐵 ∈ ω → (𝐴𝐵 ↔ suc 𝐴 ∈ suc 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  wo 698   = wceq 1332  wcel 1481  c0 3368  Oncon0 4293  suc csuc 4295  ωcom 4512
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-iinf 4510
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-uni 3745  df-int 3780  df-tr 4035  df-iord 4296  df-on 4298  df-suc 4301  df-iom 4513
This theorem is referenced by:  nnsucsssuc  6396  nntri3or  6397  nnsucuniel  6399  nnaordi  6412  ennnfonelemhom  11964
  Copyright terms: Public domain W3C validator