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

Theorem nnsucsssuc 6738
Description: Membership is inherited by successors. The reverse direction holds for all ordinals, as seen at onsucsssucr 4636, but the forward direction, for all ordinals, implies excluded middle as seen as onsucsssucexmid 4654. (Contributed by Jim Kingdon, 25-Aug-2019.)
Assertion
Ref Expression
nnsucsssuc ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ suc 𝐴 ⊆ suc 𝐵))

Proof of Theorem nnsucsssuc
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sseq1 3265 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝐵𝐴𝐵))
2 suceq 4528 . . . . . . 7 (𝑥 = 𝐴 → suc 𝑥 = suc 𝐴)
32sseq1d 3271 . . . . . 6 (𝑥 = 𝐴 → (suc 𝑥 ⊆ suc 𝐵 ↔ suc 𝐴 ⊆ suc 𝐵))
41, 3imbi12d 234 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵)))
54imbi2d 230 . . . 4 (𝑥 = 𝐴 → ((𝐵 ∈ ω → (𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵)) ↔ (𝐵 ∈ ω → (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵))))
6 sseq1 3265 . . . . . 6 (𝑥 = ∅ → (𝑥𝐵 ↔ ∅ ⊆ 𝐵))
7 suceq 4528 . . . . . . 7 (𝑥 = ∅ → suc 𝑥 = suc ∅)
87sseq1d 3271 . . . . . 6 (𝑥 = ∅ → (suc 𝑥 ⊆ suc 𝐵 ↔ suc ∅ ⊆ suc 𝐵))
96, 8imbi12d 234 . . . . 5 (𝑥 = ∅ → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (∅ ⊆ 𝐵 → suc ∅ ⊆ suc 𝐵)))
10 sseq1 3265 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝐵𝑦𝐵))
11 suceq 4528 . . . . . . 7 (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
1211sseq1d 3271 . . . . . 6 (𝑥 = 𝑦 → (suc 𝑥 ⊆ suc 𝐵 ↔ suc 𝑦 ⊆ suc 𝐵))
1310, 12imbi12d 234 . . . . 5 (𝑥 = 𝑦 → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵)))
14 sseq1 3265 . . . . . 6 (𝑥 = suc 𝑦 → (𝑥𝐵 ↔ suc 𝑦𝐵))
15 suceq 4528 . . . . . . 7 (𝑥 = suc 𝑦 → suc 𝑥 = suc suc 𝑦)
1615sseq1d 3271 . . . . . 6 (𝑥 = suc 𝑦 → (suc 𝑥 ⊆ suc 𝐵 ↔ suc suc 𝑦 ⊆ suc 𝐵))
1714, 16imbi12d 234 . . . . 5 (𝑥 = suc 𝑦 → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (suc 𝑦𝐵 → suc suc 𝑦 ⊆ suc 𝐵)))
18 peano3 4723 . . . . . . . . 9 (𝐵 ∈ ω → suc 𝐵 ≠ ∅)
1918neneqd 2435 . . . . . . . 8 (𝐵 ∈ ω → ¬ suc 𝐵 = ∅)
20 peano2 4722 . . . . . . . . . 10 (𝐵 ∈ ω → suc 𝐵 ∈ ω)
21 0elnn 4746 . . . . . . . . . 10 (suc 𝐵 ∈ ω → (suc 𝐵 = ∅ ∨ ∅ ∈ suc 𝐵))
2220, 21syl 14 . . . . . . . . 9 (𝐵 ∈ ω → (suc 𝐵 = ∅ ∨ ∅ ∈ suc 𝐵))
2322ord 732 . . . . . . . 8 (𝐵 ∈ ω → (¬ suc 𝐵 = ∅ → ∅ ∈ suc 𝐵))
2419, 23mpd 13 . . . . . . 7 (𝐵 ∈ ω → ∅ ∈ suc 𝐵)
25 nnord 4739 . . . . . . . 8 (𝐵 ∈ ω → Ord 𝐵)
26 ordsucim 4627 . . . . . . . 8 (Ord 𝐵 → Ord suc 𝐵)
27 0ex 4242 . . . . . . . . 9 ∅ ∈ V
28 ordelsuc 4632 . . . . . . . . 9 ((∅ ∈ V ∧ Ord suc 𝐵) → (∅ ∈ suc 𝐵 ↔ suc ∅ ⊆ suc 𝐵))
2927, 28mpan 424 . . . . . . . 8 (Ord suc 𝐵 → (∅ ∈ suc 𝐵 ↔ suc ∅ ⊆ suc 𝐵))
3025, 26, 293syl 17 . . . . . . 7 (𝐵 ∈ ω → (∅ ∈ suc 𝐵 ↔ suc ∅ ⊆ suc 𝐵))
3124, 30mpbid 147 . . . . . 6 (𝐵 ∈ ω → suc ∅ ⊆ suc 𝐵)
3231a1d 22 . . . . 5 (𝐵 ∈ ω → (∅ ⊆ 𝐵 → suc ∅ ⊆ suc 𝐵))
33 simp3 1026 . . . . . . . . . 10 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc 𝑦𝐵)
34 simp1l 1048 . . . . . . . . . . 11 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → 𝑦 ∈ ω)
35 simp1r 1049 . . . . . . . . . . . 12 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → 𝐵 ∈ ω)
3635, 25syl 14 . . . . . . . . . . 11 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → Ord 𝐵)
37 ordelsuc 4632 . . . . . . . . . . 11 ((𝑦 ∈ ω ∧ Ord 𝐵) → (𝑦𝐵 ↔ suc 𝑦𝐵))
3834, 36, 37syl2anc 411 . . . . . . . . . 10 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → (𝑦𝐵 ↔ suc 𝑦𝐵))
3933, 38mpbird 167 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → 𝑦𝐵)
40 nnsucelsuc 6737 . . . . . . . . . 10 (𝐵 ∈ ω → (𝑦𝐵 ↔ suc 𝑦 ∈ suc 𝐵))
4135, 40syl 14 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → (𝑦𝐵 ↔ suc 𝑦 ∈ suc 𝐵))
4239, 41mpbid 147 . . . . . . . 8 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc 𝑦 ∈ suc 𝐵)
43 peano2 4722 . . . . . . . . . 10 (𝑦 ∈ ω → suc 𝑦 ∈ ω)
4434, 43syl 14 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc 𝑦 ∈ ω)
4536, 26syl 14 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → Ord suc 𝐵)
46 ordelsuc 4632 . . . . . . . . 9 ((suc 𝑦 ∈ ω ∧ Ord suc 𝐵) → (suc 𝑦 ∈ suc 𝐵 ↔ suc suc 𝑦 ⊆ suc 𝐵))
4744, 45, 46syl2anc 411 . . . . . . . 8 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → (suc 𝑦 ∈ suc 𝐵 ↔ suc suc 𝑦 ⊆ suc 𝐵))
4842, 47mpbid 147 . . . . . . 7 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc suc 𝑦 ⊆ suc 𝐵)
49483expia 1232 . . . . . 6 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵)) → (suc 𝑦𝐵 → suc suc 𝑦 ⊆ suc 𝐵))
5049exp31 364 . . . . 5 (𝑦 ∈ ω → (𝐵 ∈ ω → ((𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) → (suc 𝑦𝐵 → suc suc 𝑦 ⊆ suc 𝐵))))
519, 13, 17, 32, 50finds2 4728 . . . 4 (𝑥 ∈ ω → (𝐵 ∈ ω → (𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵)))
525, 51vtoclga 2883 . . 3 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵)))
5352imp 124 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵))
54 nnon 4737 . . 3 (𝐴 ∈ ω → 𝐴 ∈ On)
55 onsucsssucr 4636 . . 3 ((𝐴 ∈ On ∧ Ord 𝐵) → (suc 𝐴 ⊆ suc 𝐵𝐴𝐵))
5654, 25, 55syl2an 289 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 ⊆ suc 𝐵𝐴𝐵))
5753, 56impbid 129 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ suc 𝐴 ⊆ suc 𝐵))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 716  w3a 1005   = wceq 1398  wcel 2205  Vcvv 2815  wss 3214  c0 3512  Ord word 4488  Oncon0 4489  suc csuc 4491  ωcom 4717
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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-iinf 4715
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-uni 3920  df-int 3955  df-tr 4214  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718
This theorem is referenced by:  nnaword  6757  ennnfonelemk  13235  ennnfonelemkh  13247
  Copyright terms: Public domain W3C validator