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

Theorem nnsucsssuc 6655
Description: Membership is inherited by successors. The reverse direction holds for all ordinals, as seen at onsucsssucr 4605, but the forward direction, for all ordinals, implies excluded middle as seen as onsucsssucexmid 4623. (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 3248 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝐵𝐴𝐵))
2 suceq 4497 . . . . . . 7 (𝑥 = 𝐴 → suc 𝑥 = suc 𝐴)
32sseq1d 3254 . . . . . 6 (𝑥 = 𝐴 → (suc 𝑥 ⊆ suc 𝐵 ↔ suc 𝐴 ⊆ suc 𝐵))
41, 3imbi12d 234 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵)))
54imbi2d 230 . . . 4 (𝑥 = 𝐴 → ((𝐵 ∈ ω → (𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵)) ↔ (𝐵 ∈ ω → (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵))))
6 sseq1 3248 . . . . . 6 (𝑥 = ∅ → (𝑥𝐵 ↔ ∅ ⊆ 𝐵))
7 suceq 4497 . . . . . . 7 (𝑥 = ∅ → suc 𝑥 = suc ∅)
87sseq1d 3254 . . . . . 6 (𝑥 = ∅ → (suc 𝑥 ⊆ suc 𝐵 ↔ suc ∅ ⊆ suc 𝐵))
96, 8imbi12d 234 . . . . 5 (𝑥 = ∅ → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (∅ ⊆ 𝐵 → suc ∅ ⊆ suc 𝐵)))
10 sseq1 3248 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝐵𝑦𝐵))
11 suceq 4497 . . . . . . 7 (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
1211sseq1d 3254 . . . . . 6 (𝑥 = 𝑦 → (suc 𝑥 ⊆ suc 𝐵 ↔ suc 𝑦 ⊆ suc 𝐵))
1310, 12imbi12d 234 . . . . 5 (𝑥 = 𝑦 → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵)))
14 sseq1 3248 . . . . . 6 (𝑥 = suc 𝑦 → (𝑥𝐵 ↔ suc 𝑦𝐵))
15 suceq 4497 . . . . . . 7 (𝑥 = suc 𝑦 → suc 𝑥 = suc suc 𝑦)
1615sseq1d 3254 . . . . . 6 (𝑥 = suc 𝑦 → (suc 𝑥 ⊆ suc 𝐵 ↔ suc suc 𝑦 ⊆ suc 𝐵))
1714, 16imbi12d 234 . . . . 5 (𝑥 = suc 𝑦 → ((𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵) ↔ (suc 𝑦𝐵 → suc suc 𝑦 ⊆ suc 𝐵)))
18 peano3 4692 . . . . . . . . 9 (𝐵 ∈ ω → suc 𝐵 ≠ ∅)
1918neneqd 2421 . . . . . . . 8 (𝐵 ∈ ω → ¬ suc 𝐵 = ∅)
20 peano2 4691 . . . . . . . . . 10 (𝐵 ∈ ω → suc 𝐵 ∈ ω)
21 0elnn 4715 . . . . . . . . . 10 (suc 𝐵 ∈ ω → (suc 𝐵 = ∅ ∨ ∅ ∈ suc 𝐵))
2220, 21syl 14 . . . . . . . . 9 (𝐵 ∈ ω → (suc 𝐵 = ∅ ∨ ∅ ∈ suc 𝐵))
2322ord 729 . . . . . . . 8 (𝐵 ∈ ω → (¬ suc 𝐵 = ∅ → ∅ ∈ suc 𝐵))
2419, 23mpd 13 . . . . . . 7 (𝐵 ∈ ω → ∅ ∈ suc 𝐵)
25 nnord 4708 . . . . . . . 8 (𝐵 ∈ ω → Ord 𝐵)
26 ordsucim 4596 . . . . . . . 8 (Ord 𝐵 → Ord suc 𝐵)
27 0ex 4214 . . . . . . . . 9 ∅ ∈ V
28 ordelsuc 4601 . . . . . . . . 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 1023 . . . . . . . . . 10 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc 𝑦𝐵)
34 simp1l 1045 . . . . . . . . . . 11 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → 𝑦 ∈ ω)
35 simp1r 1046 . . . . . . . . . . . 12 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → 𝐵 ∈ ω)
3635, 25syl 14 . . . . . . . . . . 11 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → Ord 𝐵)
37 ordelsuc 4601 . . . . . . . . . . 11 ((𝑦 ∈ ω ∧ Ord 𝐵) → (𝑦𝐵 ↔ suc 𝑦𝐵))
3834, 36, 37syl2anc 411 . . . . . . . . . 10 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → (𝑦𝐵 ↔ suc 𝑦𝐵))
3933, 38mpbird 167 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → 𝑦𝐵)
40 nnsucelsuc 6654 . . . . . . . . . 10 (𝐵 ∈ ω → (𝑦𝐵 ↔ suc 𝑦 ∈ suc 𝐵))
4135, 40syl 14 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → (𝑦𝐵 ↔ suc 𝑦 ∈ suc 𝐵))
4239, 41mpbid 147 . . . . . . . 8 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc 𝑦 ∈ suc 𝐵)
43 peano2 4691 . . . . . . . . . 10 (𝑦 ∈ ω → suc 𝑦 ∈ ω)
4434, 43syl 14 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → suc 𝑦 ∈ ω)
4536, 26syl 14 . . . . . . . . 9 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) ∧ suc 𝑦𝐵) → Ord suc 𝐵)
46 ordelsuc 4601 . . . . . . . . 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 1229 . . . . . 6 (((𝑦 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵)) → (suc 𝑦𝐵 → suc suc 𝑦 ⊆ suc 𝐵))
5049exp31 364 . . . . 5 (𝑦 ∈ ω → (𝐵 ∈ ω → ((𝑦𝐵 → suc 𝑦 ⊆ suc 𝐵) → (suc 𝑦𝐵 → suc suc 𝑦 ⊆ suc 𝐵))))
519, 13, 17, 32, 50finds2 4697 . . . 4 (𝑥 ∈ ω → (𝐵 ∈ ω → (𝑥𝐵 → suc 𝑥 ⊆ suc 𝐵)))
525, 51vtoclga 2868 . . 3 (𝐴 ∈ ω → (𝐵 ∈ ω → (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵)))
5352imp 124 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 → suc 𝐴 ⊆ suc 𝐵))
54 nnon 4706 . . 3 (𝐴 ∈ ω → 𝐴 ∈ On)
55 onsucsssucr 4605 . . 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 713  w3a 1002   = wceq 1395  wcel 2200  Vcvv 2800  wss 3198  c0 3492  Ord word 4457  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-ne 2401  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:  nnaword  6674  ennnfonelemk  13011  ennnfonelemkh  13023
  Copyright terms: Public domain W3C validator