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 32639
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 3284 . . . . 5 (suc 𝐴 ∈ Top → suc 𝐴 ∈ V)
2 sucexb 7094 . . . . 5 (𝐴 ∈ V ↔ suc 𝐴 ∈ V)
31, 2sylibr 224 . . . 4 (suc 𝐴 ∈ Top → 𝐴 ∈ V)
4 sssucid 5883 . . . . 5 𝐴 ⊆ suc 𝐴
5 elpwg 4242 . . . . 5 (𝐴 ∈ V → (𝐴 ∈ 𝒫 suc 𝐴𝐴 ⊆ suc 𝐴))
64, 5mpbiri 248 . . . 4 (𝐴 ∈ V → 𝐴 ∈ 𝒫 suc 𝐴)
7 limsucncmpi.1 . . . . . . 7 Lim 𝐴
8 limuni 5866 . . . . . . 7 (Lim 𝐴𝐴 = 𝐴)
97, 8ax-mp 5 . . . . . 6 𝐴 = 𝐴
10 elin 3872 . . . . . . . . . 10 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) ↔ (𝑧 ∈ 𝒫 𝐴𝑧 ∈ Fin))
11 elpwi 4244 . . . . . . . . . . 11 (𝑧 ∈ 𝒫 𝐴𝑧𝐴)
1211anim1i 593 . . . . . . . . . 10 ((𝑧 ∈ 𝒫 𝐴𝑧 ∈ Fin) → (𝑧𝐴𝑧 ∈ Fin))
1310, 12sylbi 207 . . . . . . . . 9 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → (𝑧𝐴𝑧 ∈ Fin))
14 nlim0 5864 . . . . . . . . . . . . . . . 16 ¬ Lim ∅
157, 142th 254 . . . . . . . . . . . . . . 15 (Lim 𝐴 ↔ ¬ Lim ∅)
16 xor3 371 . . . . . . . . . . . . . . 15 (¬ (Lim 𝐴 ↔ Lim ∅) ↔ (Lim 𝐴 ↔ ¬ Lim ∅))
1715, 16mpbir 221 . . . . . . . . . . . . . 14 ¬ (Lim 𝐴 ↔ Lim ∅)
18 limeq 5816 . . . . . . . . . . . . . . 15 (𝐴 = ∅ → (Lim 𝐴 ↔ Lim ∅))
1918necon3bi 2890 . . . . . . . . . . . . . 14 (¬ (Lim 𝐴 ↔ Lim ∅) → 𝐴 ≠ ∅)
2017, 19ax-mp 5 . . . . . . . . . . . . 13 𝐴 ≠ ∅
21 uni0 4541 . . . . . . . . . . . . 13 ∅ = ∅
2220, 21neeqtrri 2937 . . . . . . . . . . . 12 𝐴
23 unieq 4520 . . . . . . . . . . . . 13 (𝑧 = ∅ → 𝑧 = ∅)
2423neeq2d 2924 . . . . . . . . . . . 12 (𝑧 = ∅ → (𝐴 𝑧𝐴 ∅))
2522, 24mpbiri 248 . . . . . . . . . . 11 (𝑧 = ∅ → 𝐴 𝑧)
2625a1i 11 . . . . . . . . . 10 ((𝑧𝐴𝑧 ∈ Fin) → (𝑧 = ∅ → 𝐴 𝑧))
27 limord 5865 . . . . . . . . . . . . . 14 (Lim 𝐴 → Ord 𝐴)
28 ordsson 7074 . . . . . . . . . . . . . 14 (Ord 𝐴𝐴 ⊆ On)
297, 27, 28mp2b 10 . . . . . . . . . . . . 13 𝐴 ⊆ On
30 sstr2 3684 . . . . . . . . . . . . 13 (𝑧𝐴 → (𝐴 ⊆ On → 𝑧 ⊆ On))
3129, 30mpi 20 . . . . . . . . . . . 12 (𝑧𝐴𝑧 ⊆ On)
32 ordunifi 8294 . . . . . . . . . . . . 13 ((𝑧 ⊆ On ∧ 𝑧 ∈ Fin ∧ 𝑧 ≠ ∅) → 𝑧𝑧)
33323expia 1114 . . . . . . . . . . . 12 ((𝑧 ⊆ On ∧ 𝑧 ∈ Fin) → (𝑧 ≠ ∅ → 𝑧𝑧))
3431, 33sylan 489 . . . . . . . . . . 11 ((𝑧𝐴𝑧 ∈ Fin) → (𝑧 ≠ ∅ → 𝑧𝑧))
35 ssel 3671 . . . . . . . . . . . . 13 (𝑧𝐴 → ( 𝑧𝑧 𝑧𝐴))
367, 27ax-mp 5 . . . . . . . . . . . . . 14 Ord 𝐴
37 nordeq 5823 . . . . . . . . . . . . . 14 ((Ord 𝐴 𝑧𝐴) → 𝐴 𝑧)
3836, 37mpan 708 . . . . . . . . . . . . 13 ( 𝑧𝐴𝐴 𝑧)
3935, 38syl6 35 . . . . . . . . . . . 12 (𝑧𝐴 → ( 𝑧𝑧𝐴 𝑧))
4039adantr 472 . . . . . . . . . . 11 ((𝑧𝐴𝑧 ∈ Fin) → ( 𝑧𝑧𝐴 𝑧))
4134, 40syld 47 . . . . . . . . . 10 ((𝑧𝐴𝑧 ∈ Fin) → (𝑧 ≠ ∅ → 𝐴 𝑧))
4226, 41pm2.61dne 2950 . . . . . . . . 9 ((𝑧𝐴𝑧 ∈ Fin) → 𝐴 𝑧)
4313, 42syl 17 . . . . . . . 8 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → 𝐴 𝑧)
4443neneqd 2869 . . . . . . 7 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → ¬ 𝐴 = 𝑧)
4544nrex 3070 . . . . . 6 ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧
46 unieq 4520 . . . . . . . . 9 (𝑦 = 𝐴 𝑦 = 𝐴)
4746eqeq2d 2702 . . . . . . . 8 (𝑦 = 𝐴 → (𝐴 = 𝑦𝐴 = 𝐴))
48 pweq 4237 . . . . . . . . . . 11 (𝑦 = 𝐴 → 𝒫 𝑦 = 𝒫 𝐴)
4948ineq1d 3889 . . . . . . . . . 10 (𝑦 = 𝐴 → (𝒫 𝑦 ∩ Fin) = (𝒫 𝐴 ∩ Fin))
5049rexeqdv 3216 . . . . . . . . 9 (𝑦 = 𝐴 → (∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧 ↔ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧))
5150notbid 307 . . . . . . . 8 (𝑦 = 𝐴 → (¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧 ↔ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧))
5247, 51anbi12d 749 . . . . . . 7 (𝑦 = 𝐴 → ((𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧) ↔ (𝐴 = 𝐴 ∧ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧)))
5352rspcev 3381 . . . . . 6 ((𝐴 ∈ 𝒫 suc 𝐴 ∧ (𝐴 = 𝐴 ∧ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧)) → ∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
549, 45, 53mpanr12 723 . . . . 5 (𝐴 ∈ 𝒫 suc 𝐴 → ∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
55 rexanali 3068 . . . . 5 (∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧) ↔ ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
5654, 55sylib 208 . . . 4 (𝐴 ∈ 𝒫 suc 𝐴 → ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
573, 6, 563syl 18 . . 3 (suc 𝐴 ∈ Top → ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
58 imnan 437 . . 3 ((suc 𝐴 ∈ Top → ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧)) ↔ ¬ (suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧)))
5957, 58mpbi 220 . 2 ¬ (suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
60 ordunisuc 7117 . . . . 5 (Ord 𝐴 suc 𝐴 = 𝐴)
617, 27, 60mp2b 10 . . . 4 suc 𝐴 = 𝐴
6261eqcomi 2701 . . 3 𝐴 = suc 𝐴
6362iscmp 21282 . 2 (suc 𝐴 ∈ Comp ↔ (suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧)))
6459, 63mtbir 312 1 ¬ suc 𝐴 ∈ Comp
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 383   = wceq 1564  wcel 2071  wne 2864  wral 2982  wrex 2983  Vcvv 3272  cin 3647  wss 3648  c0 3991  𝒫 cpw 4234   cuni 4512  Ord word 5803  Oncon0 5804  Lim wlim 5805  suc csuc 5806  Fincfn 8040  Topctop 20789  Compccmp 21280
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1818  ax-5 1920  ax-6 1986  ax-7 2022  ax-8 2073  ax-9 2080  ax-10 2100  ax-11 2115  ax-12 2128  ax-13 2323  ax-ext 2672  ax-sep 4857  ax-nul 4865  ax-pow 4916  ax-pr 4979  ax-un 7034
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1567  df-ex 1786  df-nf 1791  df-sb 1979  df-eu 2543  df-mo 2544  df-clab 2679  df-cleq 2685  df-clel 2688  df-nfc 2823  df-ne 2865  df-ral 2987  df-rex 2988  df-rab 2991  df-v 3274  df-sbc 3510  df-dif 3651  df-un 3653  df-in 3655  df-ss 3662  df-pss 3664  df-nul 3992  df-if 4163  df-pw 4236  df-sn 4254  df-pr 4256  df-tp 4258  df-op 4260  df-uni 4513  df-br 4729  df-opab 4789  df-tr 4829  df-id 5096  df-eprel 5101  df-po 5107  df-so 5108  df-fr 5145  df-we 5147  df-xp 5192  df-rel 5193  df-cnv 5194  df-co 5195  df-dm 5196  df-rn 5197  df-res 5198  df-ima 5199  df-ord 5807  df-on 5808  df-lim 5809  df-suc 5810  df-iota 5932  df-fun 5971  df-fn 5972  df-f 5973  df-f1 5974  df-fo 5975  df-f1o 5976  df-fv 5977  df-om 7151  df-1o 7648  df-er 7830  df-en 8041  df-fin 8044  df-cmp 21281
This theorem is referenced by:  limsucncmp  32640
  Copyright terms: Public domain W3C validator