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 31614
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 3185 . . . . 5 (suc 𝐴 ∈ Top → suc 𝐴 ∈ V)
2 sucexb 6901 . . . . 5 (𝐴 ∈ V ↔ suc 𝐴 ∈ V)
31, 2sylibr 223 . . . 4 (suc 𝐴 ∈ Top → 𝐴 ∈ V)
4 sssucid 5719 . . . . 5 𝐴 ⊆ suc 𝐴
5 elpwg 4116 . . . . 5 (𝐴 ∈ V → (𝐴 ∈ 𝒫 suc 𝐴𝐴 ⊆ suc 𝐴))
64, 5mpbiri 247 . . . 4 (𝐴 ∈ V → 𝐴 ∈ 𝒫 suc 𝐴)
7 limsucncmpi.1 . . . . . . 7 Lim 𝐴
8 limuni 5702 . . . . . . 7 (Lim 𝐴𝐴 = 𝐴)
97, 8ax-mp 5 . . . . . 6 𝐴 = 𝐴
10 elin 3758 . . . . . . . . . 10 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) ↔ (𝑧 ∈ 𝒫 𝐴𝑧 ∈ Fin))
11 elpwi 4117 . . . . . . . . . . 11 (𝑧 ∈ 𝒫 𝐴𝑧𝐴)
1211anim1i 590 . . . . . . . . . 10 ((𝑧 ∈ 𝒫 𝐴𝑧 ∈ Fin) → (𝑧𝐴𝑧 ∈ Fin))
1310, 12sylbi 206 . . . . . . . . 9 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → (𝑧𝐴𝑧 ∈ Fin))
14 nlim0 5700 . . . . . . . . . . . . . . . 16 ¬ Lim ∅
157, 142th 253 . . . . . . . . . . . . . . 15 (Lim 𝐴 ↔ ¬ Lim ∅)
16 xor3 371 . . . . . . . . . . . . . . 15 (¬ (Lim 𝐴 ↔ Lim ∅) ↔ (Lim 𝐴 ↔ ¬ Lim ∅))
1715, 16mpbir 220 . . . . . . . . . . . . . 14 ¬ (Lim 𝐴 ↔ Lim ∅)
18 limeq 5652 . . . . . . . . . . . . . . 15 (𝐴 = ∅ → (Lim 𝐴 ↔ Lim ∅))
1918necon3bi 2808 . . . . . . . . . . . . . 14 (¬ (Lim 𝐴 ↔ Lim ∅) → 𝐴 ≠ ∅)
2017, 19ax-mp 5 . . . . . . . . . . . . 13 𝐴 ≠ ∅
21 uni0 4401 . . . . . . . . . . . . 13 ∅ = ∅
2220, 21neeqtrri 2855 . . . . . . . . . . . 12 𝐴
23 unieq 4380 . . . . . . . . . . . . 13 (𝑧 = ∅ → 𝑧 = ∅)
2423neeq2d 2842 . . . . . . . . . . . 12 (𝑧 = ∅ → (𝐴 𝑧𝐴 ∅))
2522, 24mpbiri 247 . . . . . . . . . . 11 (𝑧 = ∅ → 𝐴 𝑧)
2625a1i 11 . . . . . . . . . 10 ((𝑧𝐴𝑧 ∈ Fin) → (𝑧 = ∅ → 𝐴 𝑧))
27 limord 5701 . . . . . . . . . . . . . 14 (Lim 𝐴 → Ord 𝐴)
28 ordsson 6881 . . . . . . . . . . . . . 14 (Ord 𝐴𝐴 ⊆ On)
297, 27, 28mp2b 10 . . . . . . . . . . . . 13 𝐴 ⊆ On
30 sstr2 3575 . . . . . . . . . . . . 13 (𝑧𝐴 → (𝐴 ⊆ On → 𝑧 ⊆ On))
3129, 30mpi 20 . . . . . . . . . . . 12 (𝑧𝐴𝑧 ⊆ On)
32 ordunifi 8095 . . . . . . . . . . . . 13 ((𝑧 ⊆ On ∧ 𝑧 ∈ Fin ∧ 𝑧 ≠ ∅) → 𝑧𝑧)
33323expia 1259 . . . . . . . . . . . 12 ((𝑧 ⊆ On ∧ 𝑧 ∈ Fin) → (𝑧 ≠ ∅ → 𝑧𝑧))
3431, 33sylan 487 . . . . . . . . . . 11 ((𝑧𝐴𝑧 ∈ Fin) → (𝑧 ≠ ∅ → 𝑧𝑧))
35 ssel 3562 . . . . . . . . . . . . 13 (𝑧𝐴 → ( 𝑧𝑧 𝑧𝐴))
367, 27ax-mp 5 . . . . . . . . . . . . . 14 Ord 𝐴
37 nordeq 5659 . . . . . . . . . . . . . 14 ((Ord 𝐴 𝑧𝐴) → 𝐴 𝑧)
3836, 37mpan 702 . . . . . . . . . . . . 13 ( 𝑧𝐴𝐴 𝑧)
3935, 38syl6 34 . . . . . . . . . . . 12 (𝑧𝐴 → ( 𝑧𝑧𝐴 𝑧))
4039adantr 480 . . . . . . . . . . 11 ((𝑧𝐴𝑧 ∈ Fin) → ( 𝑧𝑧𝐴 𝑧))
4134, 40syld 46 . . . . . . . . . 10 ((𝑧𝐴𝑧 ∈ Fin) → (𝑧 ≠ ∅ → 𝐴 𝑧))
4226, 41pm2.61dne 2868 . . . . . . . . 9 ((𝑧𝐴𝑧 ∈ Fin) → 𝐴 𝑧)
4313, 42syl 17 . . . . . . . 8 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → 𝐴 𝑧)
4443neneqd 2787 . . . . . . 7 (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → ¬ 𝐴 = 𝑧)
4544nrex 2983 . . . . . 6 ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧
46 unieq 4380 . . . . . . . . 9 (𝑦 = 𝐴 𝑦 = 𝐴)
4746eqeq2d 2620 . . . . . . . 8 (𝑦 = 𝐴 → (𝐴 = 𝑦𝐴 = 𝐴))
48 pweq 4111 . . . . . . . . . . 11 (𝑦 = 𝐴 → 𝒫 𝑦 = 𝒫 𝐴)
4948ineq1d 3775 . . . . . . . . . 10 (𝑦 = 𝐴 → (𝒫 𝑦 ∩ Fin) = (𝒫 𝐴 ∩ Fin))
5049rexeqdv 3122 . . . . . . . . 9 (𝑦 = 𝐴 → (∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧 ↔ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧))
5150notbid 307 . . . . . . . 8 (𝑦 = 𝐴 → (¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧 ↔ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧))
5247, 51anbi12d 743 . . . . . . 7 (𝑦 = 𝐴 → ((𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧) ↔ (𝐴 = 𝐴 ∧ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧)))
5352rspcev 3282 . . . . . 6 ((𝐴 ∈ 𝒫 suc 𝐴 ∧ (𝐴 = 𝐴 ∧ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = 𝑧)) → ∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
549, 45, 53mpanr12 717 . . . . 5 (𝐴 ∈ 𝒫 suc 𝐴 → ∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
55 rexanali 2981 . . . . 5 (∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧) ↔ ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
5654, 55sylib 207 . . . 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 219 . 2 ¬ (suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = 𝑧))
60 ordunisuc 6924 . . . . 5 (Ord 𝐴 suc 𝐴 = 𝐴)
617, 27, 60mp2b 10 . . . 4 suc 𝐴 = 𝐴
6261eqcomi 2619 . . 3 𝐴 = suc 𝐴
6362iscmp 21001 . 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 195  wa 383   = wceq 1475  wcel 1977  wne 2780  wral 2896  wrex 2897  Vcvv 3173  cin 3539  wss 3540  c0 3874  𝒫 cpw 4108   cuni 4372  Ord word 5639  Oncon0 5640  Lim wlim 5641  suc csuc 5642  Fincfn 7841  Topctop 20517  Compccmp 20999
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-om 6958  df-1o 7447  df-er 7629  df-en 7842  df-fin 7845  df-cmp 21000
This theorem is referenced by:  limsucncmp  31615
  Copyright terms: Public domain W3C validator