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 32759
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 3406 . . . . 5 (suc 𝐴 ∈ Top → suc 𝐴 ∈ V)
2 sucexb 7235 . . . . 5 (𝐴 ∈ V ↔ suc 𝐴 ∈ V)
31, 2sylibr 225 . . . 4 (suc 𝐴 ∈ Top → 𝐴 ∈ V)
4 sssucid 6014 . . . . 5 𝐴 ⊆ suc 𝐴
5 elpwg 4359 . . . . 5 (𝐴 ∈ V → (𝐴 ∈ 𝒫 suc 𝐴𝐴 ⊆ suc 𝐴))
64, 5mpbiri 249 . . . 4 (𝐴 ∈ V → 𝐴 ∈ 𝒫 suc 𝐴)
7 limsucncmpi.1 . . . . . . 7 Lim 𝐴
8 limuni 5997 . . . . . . 7 (Lim 𝐴𝐴 = 𝐴)
97, 8ax-mp 5 . . . . . 6 𝐴 = 𝐴
10 elin 3995 . . . . . . . . . 10 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) ↔ (𝑧 ∈ 𝒫 𝐴𝑧 ∈ Fin))
11 elpwi 4361 . . . . . . . . . . 11 (𝑧 ∈ 𝒫 𝐴𝑧𝐴)
1211anim1i 604 . . . . . . . . . 10 ((𝑧 ∈ 𝒫 𝐴𝑧 ∈ Fin) → (𝑧𝐴𝑧 ∈ Fin))
1310, 12sylbi 208 . . . . . . . . 9 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → (𝑧𝐴𝑧 ∈ Fin))
14 nlim0 5995 . . . . . . . . . . . . . . . 16 ¬ Lim ∅
157, 142th 255 . . . . . . . . . . . . . . 15 (Lim 𝐴 ↔ ¬ Lim ∅)
16 xor3 373 . . . . . . . . . . . . . . 15 (¬ (Lim 𝐴 ↔ Lim ∅) ↔ (Lim 𝐴 ↔ ¬ Lim ∅))
1715, 16mpbir 222 . . . . . . . . . . . . . 14 ¬ (Lim 𝐴 ↔ Lim ∅)
18 limeq 5948 . . . . . . . . . . . . . . 15 (𝐴 = ∅ → (Lim 𝐴 ↔ Lim ∅))
1918necon3bi 3004 . . . . . . . . . . . . . 14 (¬ (Lim 𝐴 ↔ Lim ∅) → 𝐴 ≠ ∅)
2017, 19ax-mp 5 . . . . . . . . . . . . 13 𝐴 ≠ ∅
21 uni0 4659 . . . . . . . . . . . . 13 ∅ = ∅
2220, 21neeqtrri 3051 . . . . . . . . . . . 12 𝐴
23 unieq 4638 . . . . . . . . . . . . 13 (𝑧 = ∅ → 𝑧 = ∅)
2423neeq2d 3038 . . . . . . . . . . . 12 (𝑧 = ∅ → (𝐴 𝑧𝐴 ∅))
2522, 24mpbiri 249 . . . . . . . . . . 11 (𝑧 = ∅ → 𝐴 𝑧)
2625a1i 11 . . . . . . . . . 10 ((𝑧𝐴𝑧 ∈ Fin) → (𝑧 = ∅ → 𝐴 𝑧))
27 limord 5996 . . . . . . . . . . . . . 14 (Lim 𝐴 → Ord 𝐴)
28 ordsson 7215 . . . . . . . . . . . . . 14 (Ord 𝐴𝐴 ⊆ On)
297, 27, 28mp2b 10 . . . . . . . . . . . . 13 𝐴 ⊆ On
30 sstr2 3805 . . . . . . . . . . . . 13 (𝑧𝐴 → (𝐴 ⊆ On → 𝑧 ⊆ On))
3129, 30mpi 20 . . . . . . . . . . . 12 (𝑧𝐴𝑧 ⊆ On)
32 ordunifi 8445 . . . . . . . . . . . . 13 ((𝑧 ⊆ On ∧ 𝑧 ∈ Fin ∧ 𝑧 ≠ ∅) → 𝑧𝑧)
33323expia 1143 . . . . . . . . . . . 12 ((𝑧 ⊆ On ∧ 𝑧 ∈ Fin) → (𝑧 ≠ ∅ → 𝑧𝑧))
3431, 33sylan 571 . . . . . . . . . . 11 ((𝑧𝐴𝑧 ∈ Fin) → (𝑧 ≠ ∅ → 𝑧𝑧))
35 ssel 3792 . . . . . . . . . . . . 13 (𝑧𝐴 → ( 𝑧𝑧 𝑧𝐴))
367, 27ax-mp 5 . . . . . . . . . . . . . 14 Ord 𝐴
37 nordeq 5955 . . . . . . . . . . . . . 14 ((Ord 𝐴 𝑧𝐴) → 𝐴 𝑧)
3836, 37mpan 673 . . . . . . . . . . . . 13 ( 𝑧𝐴𝐴 𝑧)
3935, 38syl6 35 . . . . . . . . . . . 12 (𝑧𝐴 → ( 𝑧𝑧𝐴 𝑧))
4039adantr 468 . . . . . . . . . . 11 ((𝑧𝐴𝑧 ∈ Fin) → ( 𝑧𝑧𝐴 𝑧))
4134, 40syld 47 . . . . . . . . . 10 ((𝑧𝐴𝑧 ∈ Fin) → (𝑧 ≠ ∅ → 𝐴 𝑧))
4226, 41pm2.61dne 3064 . . . . . . . . 9 ((𝑧𝐴𝑧 ∈ Fin) → 𝐴 𝑧)
4313, 42syl 17 . . . . . . . 8 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → 𝐴 𝑧)
4443neneqd 2983 . . . . . . 7 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → ¬ 𝐴 = 𝑧)
4544nrex 3187 . . . . . 6 ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧
46 unieq 4638 . . . . . . . . 9 (𝑦 = 𝐴 𝑦 = 𝐴)
4746eqeq2d 2816 . . . . . . . 8 (𝑦 = 𝐴 → (𝐴 = 𝑦𝐴 = 𝐴))
48 pweq 4354 . . . . . . . . . . 11 (𝑦 = 𝐴 → 𝒫 𝑦 = 𝒫 𝐴)
4948ineq1d 4012 . . . . . . . . . 10 (𝑦 = 𝐴 → (𝒫 𝑦 ∩ Fin) = (𝒫 𝐴 ∩ Fin))
5049rexeqdv 3334 . . . . . . . . 9 (𝑦 = 𝐴 → (∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧 ↔ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧))
5150notbid 309 . . . . . . . 8 (𝑦 = 𝐴 → (¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧 ↔ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧))
5247, 51anbi12d 618 . . . . . . 7 (𝑦 = 𝐴 → ((𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧) ↔ (𝐴 = 𝐴 ∧ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧)))
5352rspcev 3502 . . . . . 6 ((𝐴 ∈ 𝒫 suc 𝐴 ∧ (𝐴 = 𝐴 ∧ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧)) → ∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
549, 45, 53mpanr12 688 . . . . 5 (𝐴 ∈ 𝒫 suc 𝐴 → ∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
55 rexanali 3185 . . . . 5 (∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧) ↔ ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
5654, 55sylib 209 . . . 4 (𝐴 ∈ 𝒫 suc 𝐴 → ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
573, 6, 563syl 18 . . 3 (suc 𝐴 ∈ Top → ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
58 imnan 388 . . 3 ((suc 𝐴 ∈ Top → ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧)) ↔ ¬ (suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧)))
5957, 58mpbi 221 . 2 ¬ (suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
60 ordunisuc 7258 . . . . 5 (Ord 𝐴 suc 𝐴 = 𝐴)
617, 27, 60mp2b 10 . . . 4 suc 𝐴 = 𝐴
6261eqcomi 2815 . . 3 𝐴 = suc 𝐴
6362iscmp 21402 . 2 (suc 𝐴 ∈ Comp ↔ (suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧)))
6459, 63mtbir 314 1 ¬ suc 𝐴 ∈ Comp
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 197  wa 384   = wceq 1637  wcel 2156  wne 2978  wral 3096  wrex 3097  Vcvv 3391  cin 3768  wss 3769  c0 4116  𝒫 cpw 4351   cuni 4630  Ord word 5935  Oncon0 5936  Lim wlim 5937  suc csuc 5938  Fincfn 8188  Topctop 20908  Compccmp 21400
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2068  ax-7 2104  ax-8 2158  ax-9 2165  ax-10 2185  ax-11 2201  ax-12 2214  ax-13 2420  ax-ext 2784  ax-sep 4975  ax-nul 4983  ax-pow 5035  ax-pr 5096  ax-un 7175
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3or 1101  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2061  df-eu 2634  df-mo 2635  df-clab 2793  df-cleq 2799  df-clel 2802  df-nfc 2937  df-ne 2979  df-ral 3101  df-rex 3102  df-rab 3105  df-v 3393  df-sbc 3634  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-pss 3785  df-nul 4117  df-if 4280  df-pw 4353  df-sn 4371  df-pr 4373  df-tp 4375  df-op 4377  df-uni 4631  df-br 4845  df-opab 4907  df-tr 4947  df-id 5219  df-eprel 5224  df-po 5232  df-so 5233  df-fr 5270  df-we 5272  df-xp 5317  df-rel 5318  df-cnv 5319  df-co 5320  df-dm 5321  df-rn 5322  df-res 5323  df-ima 5324  df-ord 5939  df-on 5940  df-lim 5941  df-suc 5942  df-iota 6060  df-fun 6099  df-fn 6100  df-f 6101  df-f1 6102  df-fo 6103  df-f1o 6104  df-fv 6105  df-om 7292  df-1o 7792  df-er 7975  df-en 8189  df-fin 8192  df-cmp 21401
This theorem is referenced by:  limsucncmp  32760
  Copyright terms: Public domain W3C validator