MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  infensuc Structured version   Visualization version   GIF version

Theorem infensuc 9102
Description: Any infinite ordinal is equinumerous to its successor. Exercise 7 of [TakeutiZaring] p. 88. Proved without the Axiom of Infinity. (Contributed by NM, 30-Oct-2003.) (Revised by Mario Carneiro, 13-Jan-2013.)
Assertion
Ref Expression
infensuc ((𝐴 ∈ On ∧ ω ⊆ 𝐴) → 𝐴 ≈ suc 𝐴)

Proof of Theorem infensuc
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 onprc 7713 . . . . 5 ¬ On ∈ V
2 eleq1 2822 . . . . 5 (ω = On → (ω ∈ V ↔ On ∈ V))
31, 2mtbiri 327 . . . 4 (ω = On → ¬ ω ∈ V)
4 ssexg 5281 . . . . 5 ((ω ⊆ 𝐴𝐴 ∈ On) → ω ∈ V)
54ancoms 460 . . . 4 ((𝐴 ∈ On ∧ ω ⊆ 𝐴) → ω ∈ V)
63, 5nsyl3 138 . . 3 ((𝐴 ∈ On ∧ ω ⊆ 𝐴) → ¬ ω = On)
7 omon 7815 . . . 4 (ω ∈ On ∨ ω = On)
87ori 860 . . 3 (¬ ω ∈ On → ω = On)
96, 8nsyl2 141 . 2 ((𝐴 ∈ On ∧ ω ⊆ 𝐴) → ω ∈ On)
10 id 22 . . . . . . 7 (𝑥 = ω → 𝑥 = ω)
11 suceq 6384 . . . . . . 7 (𝑥 = ω → suc 𝑥 = suc ω)
1210, 11breq12d 5119 . . . . . 6 (𝑥 = ω → (𝑥 ≈ suc 𝑥 ↔ ω ≈ suc ω))
13 id 22 . . . . . . 7 (𝑥 = 𝑦𝑥 = 𝑦)
14 suceq 6384 . . . . . . 7 (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
1513, 14breq12d 5119 . . . . . 6 (𝑥 = 𝑦 → (𝑥 ≈ suc 𝑥𝑦 ≈ suc 𝑦))
16 id 22 . . . . . . 7 (𝑥 = suc 𝑦𝑥 = suc 𝑦)
17 suceq 6384 . . . . . . 7 (𝑥 = suc 𝑦 → suc 𝑥 = suc suc 𝑦)
1816, 17breq12d 5119 . . . . . 6 (𝑥 = suc 𝑦 → (𝑥 ≈ suc 𝑥 ↔ suc 𝑦 ≈ suc suc 𝑦))
19 id 22 . . . . . . 7 (𝑥 = 𝐴𝑥 = 𝐴)
20 suceq 6384 . . . . . . 7 (𝑥 = 𝐴 → suc 𝑥 = suc 𝐴)
2119, 20breq12d 5119 . . . . . 6 (𝑥 = 𝐴 → (𝑥 ≈ suc 𝑥𝐴 ≈ suc 𝐴))
22 limom 7819 . . . . . . 7 Lim ω
2322limensuci 9100 . . . . . 6 (ω ∈ On → ω ≈ suc ω)
24 vex 3448 . . . . . . . . . 10 𝑦 ∈ V
2524sucex 7742 . . . . . . . . . 10 suc 𝑦 ∈ V
26 en2sn 8988 . . . . . . . . . 10 ((𝑦 ∈ V ∧ suc 𝑦 ∈ V) → {𝑦} ≈ {suc 𝑦})
2724, 25, 26mp2an 691 . . . . . . . . 9 {𝑦} ≈ {suc 𝑦}
28 eloni 6328 . . . . . . . . . . . . 13 (𝑦 ∈ On → Ord 𝑦)
29 ordirr 6336 . . . . . . . . . . . . 13 (Ord 𝑦 → ¬ 𝑦𝑦)
3028, 29syl 17 . . . . . . . . . . . 12 (𝑦 ∈ On → ¬ 𝑦𝑦)
31 disjsn 4673 . . . . . . . . . . . 12 ((𝑦 ∩ {𝑦}) = ∅ ↔ ¬ 𝑦𝑦)
3230, 31sylibr 233 . . . . . . . . . . 11 (𝑦 ∈ On → (𝑦 ∩ {𝑦}) = ∅)
33 eloni 6328 . . . . . . . . . . . . 13 (suc 𝑦 ∈ On → Ord suc 𝑦)
34 ordirr 6336 . . . . . . . . . . . . 13 (Ord suc 𝑦 → ¬ suc 𝑦 ∈ suc 𝑦)
3533, 34syl 17 . . . . . . . . . . . 12 (suc 𝑦 ∈ On → ¬ suc 𝑦 ∈ suc 𝑦)
36 onsucb 7753 . . . . . . . . . . . 12 (𝑦 ∈ On ↔ suc 𝑦 ∈ On)
37 disjsn 4673 . . . . . . . . . . . 12 ((suc 𝑦 ∩ {suc 𝑦}) = ∅ ↔ ¬ suc 𝑦 ∈ suc 𝑦)
3835, 36, 373imtr4i 292 . . . . . . . . . . 11 (𝑦 ∈ On → (suc 𝑦 ∩ {suc 𝑦}) = ∅)
3932, 38jca 513 . . . . . . . . . 10 (𝑦 ∈ On → ((𝑦 ∩ {𝑦}) = ∅ ∧ (suc 𝑦 ∩ {suc 𝑦}) = ∅))
40 unen 8993 . . . . . . . . . . . 12 (((𝑦 ≈ suc 𝑦 ∧ {𝑦} ≈ {suc 𝑦}) ∧ ((𝑦 ∩ {𝑦}) = ∅ ∧ (suc 𝑦 ∩ {suc 𝑦}) = ∅)) → (𝑦 ∪ {𝑦}) ≈ (suc 𝑦 ∪ {suc 𝑦}))
41 df-suc 6324 . . . . . . . . . . . 12 suc 𝑦 = (𝑦 ∪ {𝑦})
42 df-suc 6324 . . . . . . . . . . . 12 suc suc 𝑦 = (suc 𝑦 ∪ {suc 𝑦})
4340, 41, 423brtr4g 5140 . . . . . . . . . . 11 (((𝑦 ≈ suc 𝑦 ∧ {𝑦} ≈ {suc 𝑦}) ∧ ((𝑦 ∩ {𝑦}) = ∅ ∧ (suc 𝑦 ∩ {suc 𝑦}) = ∅)) → suc 𝑦 ≈ suc suc 𝑦)
4443ex 414 . . . . . . . . . 10 ((𝑦 ≈ suc 𝑦 ∧ {𝑦} ≈ {suc 𝑦}) → (((𝑦 ∩ {𝑦}) = ∅ ∧ (suc 𝑦 ∩ {suc 𝑦}) = ∅) → suc 𝑦 ≈ suc suc 𝑦))
4539, 44syl5 34 . . . . . . . . 9 ((𝑦 ≈ suc 𝑦 ∧ {𝑦} ≈ {suc 𝑦}) → (𝑦 ∈ On → suc 𝑦 ≈ suc suc 𝑦))
4627, 45mpan2 690 . . . . . . . 8 (𝑦 ≈ suc 𝑦 → (𝑦 ∈ On → suc 𝑦 ≈ suc suc 𝑦))
4746com12 32 . . . . . . 7 (𝑦 ∈ On → (𝑦 ≈ suc 𝑦 → suc 𝑦 ≈ suc suc 𝑦))
4847ad2antrr 725 . . . . . 6 (((𝑦 ∈ On ∧ ω ∈ On) ∧ ω ⊆ 𝑦) → (𝑦 ≈ suc 𝑦 → suc 𝑦 ≈ suc suc 𝑦))
49 vex 3448 . . . . . . . . 9 𝑥 ∈ V
50 limensuc 9101 . . . . . . . . 9 ((𝑥 ∈ V ∧ Lim 𝑥) → 𝑥 ≈ suc 𝑥)
5149, 50mpan 689 . . . . . . . 8 (Lim 𝑥𝑥 ≈ suc 𝑥)
5251ad2antrr 725 . . . . . . 7 (((Lim 𝑥 ∧ ω ∈ On) ∧ ω ⊆ 𝑥) → 𝑥 ≈ suc 𝑥)
5352a1d 25 . . . . . 6 (((Lim 𝑥 ∧ ω ∈ On) ∧ ω ⊆ 𝑥) → (∀𝑦𝑥 (ω ⊆ 𝑦𝑦 ≈ suc 𝑦) → 𝑥 ≈ suc 𝑥))
5412, 15, 18, 21, 23, 48, 53tfindsg 7798 . . . . 5 (((𝐴 ∈ On ∧ ω ∈ On) ∧ ω ⊆ 𝐴) → 𝐴 ≈ suc 𝐴)
5554exp31 421 . . . 4 (𝐴 ∈ On → (ω ∈ On → (ω ⊆ 𝐴𝐴 ≈ suc 𝐴)))
5655com23 86 . . 3 (𝐴 ∈ On → (ω ⊆ 𝐴 → (ω ∈ On → 𝐴 ≈ suc 𝐴)))
5756imp 408 . 2 ((𝐴 ∈ On ∧ ω ⊆ 𝐴) → (ω ∈ On → 𝐴 ≈ suc 𝐴))
589, 57mpd 15 1 ((𝐴 ∈ On ∧ ω ⊆ 𝐴) → 𝐴 ≈ suc 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 397   = wceq 1542  wcel 2107  wral 3061  Vcvv 3444  cun 3909  cin 3910  wss 3911  c0 4283  {csn 4587   class class class wbr 5106  Ord word 6317  Oncon0 6318  Lim wlim 6319  suc csuc 6320  ωcom 7803  cen 8883
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5257  ax-nul 5264  ax-pow 5321  ax-pr 5385  ax-un 7673
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3407  df-v 3446  df-sbc 3741  df-csb 3857  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3930  df-nul 4284  df-if 4488  df-pw 4563  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4867  df-br 5107  df-opab 5169  df-mpt 5190  df-tr 5224  df-id 5532  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5589  df-we 5591  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6499  df-fn 6500  df-f 6501  df-f1 6502  df-fo 6503  df-f1o 6504  df-fv 6505  df-om 7804  df-er 8651  df-en 8887  df-dom 8888
This theorem is referenced by:  cardlim  9913  cardsucinf  9925
  Copyright terms: Public domain W3C validator