Users' Mathboxes Mathbox for Chen-Pang He < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  limsucncmpi Structured version   Visualization version   GIF version

Theorem limsucncmpi 33793
Description: The successor of a limit ordinal is not compact. (Contributed by Chen-Pang He, 20-Oct-2015.)
Hypothesis
Ref Expression
limsucncmpi.1 Lim 𝐴
Assertion
Ref Expression
limsucncmpi ¬ suc 𝐴 ∈ Comp

Proof of Theorem limsucncmpi
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 3512 . . . . 5 (suc 𝐴 ∈ Top → suc 𝐴 ∈ V)
2 sucexb 7524 . . . . 5 (𝐴 ∈ V ↔ suc 𝐴 ∈ V)
31, 2sylibr 236 . . . 4 (suc 𝐴 ∈ Top → 𝐴 ∈ V)
4 sssucid 6268 . . . . 5 𝐴 ⊆ suc 𝐴
5 elpwg 4542 . . . . 5 (𝐴 ∈ V → (𝐴 ∈ 𝒫 suc 𝐴𝐴 ⊆ suc 𝐴))
64, 5mpbiri 260 . . . 4 (𝐴 ∈ V → 𝐴 ∈ 𝒫 suc 𝐴)
7 limsucncmpi.1 . . . . . . 7 Lim 𝐴
8 limuni 6251 . . . . . . 7 (Lim 𝐴𝐴 = 𝐴)
97, 8ax-mp 5 . . . . . 6 𝐴 = 𝐴
10 elin 4169 . . . . . . . . . 10 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) ↔ (𝑧 ∈ 𝒫 𝐴𝑧 ∈ Fin))
11 elpwi 4548 . . . . . . . . . . 11 (𝑧 ∈ 𝒫 𝐴𝑧𝐴)
1211anim1i 616 . . . . . . . . . 10 ((𝑧 ∈ 𝒫 𝐴𝑧 ∈ Fin) → (𝑧𝐴𝑧 ∈ Fin))
1310, 12sylbi 219 . . . . . . . . 9 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → (𝑧𝐴𝑧 ∈ Fin))
14 nlim0 6249 . . . . . . . . . . . . . . . 16 ¬ Lim ∅
157, 142th 266 . . . . . . . . . . . . . . 15 (Lim 𝐴 ↔ ¬ Lim ∅)
16 xor3 386 . . . . . . . . . . . . . . 15 (¬ (Lim 𝐴 ↔ Lim ∅) ↔ (Lim 𝐴 ↔ ¬ Lim ∅))
1715, 16mpbir 233 . . . . . . . . . . . . . 14 ¬ (Lim 𝐴 ↔ Lim ∅)
18 limeq 6203 . . . . . . . . . . . . . . 15 (𝐴 = ∅ → (Lim 𝐴 ↔ Lim ∅))
1918necon3bi 3042 . . . . . . . . . . . . . 14 (¬ (Lim 𝐴 ↔ Lim ∅) → 𝐴 ≠ ∅)
2017, 19ax-mp 5 . . . . . . . . . . . . 13 𝐴 ≠ ∅
21 uni0 4866 . . . . . . . . . . . . 13 ∅ = ∅
2220, 21neeqtrri 3089 . . . . . . . . . . . 12 𝐴
23 unieq 4849 . . . . . . . . . . . . 13 (𝑧 = ∅ → 𝑧 = ∅)
2423neeq2d 3076 . . . . . . . . . . . 12 (𝑧 = ∅ → (𝐴 𝑧𝐴 ∅))
2522, 24mpbiri 260 . . . . . . . . . . 11 (𝑧 = ∅ → 𝐴 𝑧)
2625a1i 11 . . . . . . . . . 10 ((𝑧𝐴𝑧 ∈ Fin) → (𝑧 = ∅ → 𝐴 𝑧))
27 limord 6250 . . . . . . . . . . . . . 14 (Lim 𝐴 → Ord 𝐴)
28 ordsson 7504 . . . . . . . . . . . . . 14 (Ord 𝐴𝐴 ⊆ On)
297, 27, 28mp2b 10 . . . . . . . . . . . . 13 𝐴 ⊆ On
30 sstr2 3974 . . . . . . . . . . . . 13 (𝑧𝐴 → (𝐴 ⊆ On → 𝑧 ⊆ On))
3129, 30mpi 20 . . . . . . . . . . . 12 (𝑧𝐴𝑧 ⊆ On)
32 ordunifi 8768 . . . . . . . . . . . . 13 ((𝑧 ⊆ On ∧ 𝑧 ∈ Fin ∧ 𝑧 ≠ ∅) → 𝑧𝑧)
33323expia 1117 . . . . . . . . . . . 12 ((𝑧 ⊆ On ∧ 𝑧 ∈ Fin) → (𝑧 ≠ ∅ → 𝑧𝑧))
3431, 33sylan 582 . . . . . . . . . . 11 ((𝑧𝐴𝑧 ∈ Fin) → (𝑧 ≠ ∅ → 𝑧𝑧))
35 ssel 3961 . . . . . . . . . . . . 13 (𝑧𝐴 → ( 𝑧𝑧 𝑧𝐴))
367, 27ax-mp 5 . . . . . . . . . . . . . 14 Ord 𝐴
37 nordeq 6210 . . . . . . . . . . . . . 14 ((Ord 𝐴 𝑧𝐴) → 𝐴 𝑧)
3836, 37mpan 688 . . . . . . . . . . . . 13 ( 𝑧𝐴𝐴 𝑧)
3935, 38syl6 35 . . . . . . . . . . . 12 (𝑧𝐴 → ( 𝑧𝑧𝐴 𝑧))
4039adantr 483 . . . . . . . . . . 11 ((𝑧𝐴𝑧 ∈ Fin) → ( 𝑧𝑧𝐴 𝑧))
4134, 40syld 47 . . . . . . . . . 10 ((𝑧𝐴𝑧 ∈ Fin) → (𝑧 ≠ ∅ → 𝐴 𝑧))
4226, 41pm2.61dne 3103 . . . . . . . . 9 ((𝑧𝐴𝑧 ∈ Fin) → 𝐴 𝑧)
4313, 42syl 17 . . . . . . . 8 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → 𝐴 𝑧)
4443neneqd 3021 . . . . . . 7 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → ¬ 𝐴 = 𝑧)
4544nrex 3269 . . . . . 6 ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧
46 unieq 4849 . . . . . . . . 9 (𝑦 = 𝐴 𝑦 = 𝐴)
4746eqeq2d 2832 . . . . . . . 8 (𝑦 = 𝐴 → (𝐴 = 𝑦𝐴 = 𝐴))
48 pweq 4555 . . . . . . . . . . 11 (𝑦 = 𝐴 → 𝒫 𝑦 = 𝒫 𝐴)
4948ineq1d 4188 . . . . . . . . . 10 (𝑦 = 𝐴 → (𝒫 𝑦 ∩ Fin) = (𝒫 𝐴 ∩ Fin))
5049rexeqdv 3416 . . . . . . . . 9 (𝑦 = 𝐴 → (∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧 ↔ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧))
5150notbid 320 . . . . . . . 8 (𝑦 = 𝐴 → (¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧 ↔ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧))
5247, 51anbi12d 632 . . . . . . 7 (𝑦 = 𝐴 → ((𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧) ↔ (𝐴 = 𝐴 ∧ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧)))
5352rspcev 3623 . . . . . 6 ((𝐴 ∈ 𝒫 suc 𝐴 ∧ (𝐴 = 𝐴 ∧ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧)) → ∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
549, 45, 53mpanr12 703 . . . . 5 (𝐴 ∈ 𝒫 suc 𝐴 → ∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
55 rexanali 3265 . . . . 5 (∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧) ↔ ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
5654, 55sylib 220 . . . 4 (𝐴 ∈ 𝒫 suc 𝐴 → ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
573, 6, 563syl 18 . . 3 (suc 𝐴 ∈ Top → ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
58 imnan 402 . . 3 ((suc 𝐴 ∈ Top → ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧)) ↔ ¬ (suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧)))
5957, 58mpbi 232 . 2 ¬ (suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
60 ordunisuc 7547 . . . . 5 (Ord 𝐴 suc 𝐴 = 𝐴)
617, 27, 60mp2b 10 . . . 4 suc 𝐴 = 𝐴
6261eqcomi 2830 . . 3 𝐴 = suc 𝐴
6362iscmp 21996 . 2 (suc 𝐴 ∈ Comp ↔ (suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧)))
6459, 63mtbir 325 1 ¬ suc 𝐴 ∈ Comp
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398   = wceq 1537  wcel 2114  wne 3016  wral 3138  wrex 3139  Vcvv 3494  cin 3935  wss 3936  c0 4291  𝒫 cpw 4539   cuni 4838  Ord word 6190  Oncon0 6191  Lim wlim 6192  suc csuc 6193  Fincfn 8509  Topctop 21501  Compccmp 21994
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-om 7581  df-1o 8102  df-er 8289  df-en 8510  df-fin 8513  df-cmp 21995
This theorem is referenced by:  limsucncmp  33794
  Copyright terms: Public domain W3C validator