Theorem limsucncmpi 34561

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.

Step	Hyp	Ref	Expression
1		elex 3440	. . . . 5 ⊢ (suc 𝐴 ∈ Top → suc 𝐴 ∈ V)
2		sucexb 7631	. . . . 5 ⊢ (𝐴 ∈ V ↔ suc 𝐴 ∈ V)
3	1, 2	sylibr 233	. . . 4 ⊢ (suc 𝐴 ∈ Top → 𝐴 ∈ V)
4		sssucid 6328	. . . . 5 ⊢ 𝐴 ⊆ suc 𝐴
5		elpwg 4533	. . . . 5 ⊢ (𝐴 ∈ V → (𝐴 ∈ 𝒫 suc 𝐴 ↔ 𝐴 ⊆ suc 𝐴))
6	4, 5	mpbiri 257	. . . 4 ⊢ (𝐴 ∈ V → 𝐴 ∈ 𝒫 suc 𝐴)
7		limsucncmpi.1	. . . . . . 7 ⊢ Lim 𝐴
8		limuni 6311	. . . . . . 7 ⊢ (Lim 𝐴 → 𝐴 = ∪ 𝐴)
9	7, 8	ax-mp 5	. . . . . 6 ⊢ 𝐴 = ∪ 𝐴
10		elin 3899	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝒫 𝐴 ∩ Fin) ↔ (𝑧 ∈ 𝒫 𝐴 ∧ 𝑧 ∈ Fin))
11		elpwi 4539	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝒫 𝐴 → 𝑧 ⊆ 𝐴)
12	11	anim1i 614	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝒫 𝐴 ∧ 𝑧 ∈ Fin) → (𝑧 ⊆ 𝐴 ∧ 𝑧 ∈ Fin))
13	10, 12	sylbi 216	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → (𝑧 ⊆ 𝐴 ∧ 𝑧 ∈ Fin))
14		nlim0 6309	. . . . . . . . . . . . . . . 16 ⊢ ¬ Lim ∅
15	7, 14	2th 263	. . . . . . . . . . . . . . 15 ⊢ (Lim 𝐴 ↔ ¬ Lim ∅)
16		xor3 383	. . . . . . . . . . . . . . 15 ⊢ (¬ (Lim 𝐴 ↔ Lim ∅) ↔ (Lim 𝐴 ↔ ¬ Lim ∅))
17	15, 16	mpbir 230	. . . . . . . . . . . . . 14 ⊢ ¬ (Lim 𝐴 ↔ Lim ∅)
18		limeq 6263	. . . . . . . . . . . . . . 15 ⊢ (𝐴 = ∅ → (Lim 𝐴 ↔ Lim ∅))
19	18	necon3bi 2969	. . . . . . . . . . . . . 14 ⊢ (¬ (Lim 𝐴 ↔ Lim ∅) → 𝐴 ≠ ∅)
20	17, 19	ax-mp 5	. . . . . . . . . . . . 13 ⊢ 𝐴 ≠ ∅
21		uni0 4866	. . . . . . . . . . . . 13 ⊢ ∪ ∅ = ∅
22	20, 21	neeqtrri 3016	. . . . . . . . . . . 12 ⊢ 𝐴 ≠ ∪ ∅
23		unieq 4847	. . . . . . . . . . . . 13 ⊢ (𝑧 = ∅ → ∪ 𝑧 = ∪ ∅)
24	23	neeq2d 3003	. . . . . . . . . . . 12 ⊢ (𝑧 = ∅ → (𝐴 ≠ ∪ 𝑧 ↔ 𝐴 ≠ ∪ ∅))
25	22, 24	mpbiri 257	. . . . . . . . . . 11 ⊢ (𝑧 = ∅ → 𝐴 ≠ ∪ 𝑧)
26	25	a1i 11	. . . . . . . . . 10 ⊢ ((𝑧 ⊆ 𝐴 ∧ 𝑧 ∈ Fin) → (𝑧 = ∅ → 𝐴 ≠ ∪ 𝑧))
27		limord 6310	. . . . . . . . . . . . . 14 ⊢ (Lim 𝐴 → Ord 𝐴)
28		ordsson 7610	. . . . . . . . . . . . . 14 ⊢ (Ord 𝐴 → 𝐴 ⊆ On)
29	7, 27, 28	mp2b 10	. . . . . . . . . . . . 13 ⊢ 𝐴 ⊆ On
30		sstr2 3924	. . . . . . . . . . . . 13 ⊢ (𝑧 ⊆ 𝐴 → (𝐴 ⊆ On → 𝑧 ⊆ On))
31	29, 30	mpi 20	. . . . . . . . . . . 12 ⊢ (𝑧 ⊆ 𝐴 → 𝑧 ⊆ On)
32		ordunifi 8994	. . . . . . . . . . . . 13 ⊢ ((𝑧 ⊆ On ∧ 𝑧 ∈ Fin ∧ 𝑧 ≠ ∅) → ∪ 𝑧 ∈ 𝑧)
33	32	3expia 1119	. . . . . . . . . . . 12 ⊢ ((𝑧 ⊆ On ∧ 𝑧 ∈ Fin) → (𝑧 ≠ ∅ → ∪ 𝑧 ∈ 𝑧))
34	31, 33	sylan 579	. . . . . . . . . . 11 ⊢ ((𝑧 ⊆ 𝐴 ∧ 𝑧 ∈ Fin) → (𝑧 ≠ ∅ → ∪ 𝑧 ∈ 𝑧))
35		ssel 3910	. . . . . . . . . . . . 13 ⊢ (𝑧 ⊆ 𝐴 → (∪ 𝑧 ∈ 𝑧 → ∪ 𝑧 ∈ 𝐴))
36	7, 27	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ Ord 𝐴
37		nordeq 6270	. . . . . . . . . . . . . 14 ⊢ ((Ord 𝐴 ∧ ∪ 𝑧 ∈ 𝐴) → 𝐴 ≠ ∪ 𝑧)
38	36, 37	mpan 686	. . . . . . . . . . . . 13 ⊢ (∪ 𝑧 ∈ 𝐴 → 𝐴 ≠ ∪ 𝑧)
39	35, 38	syl6 35	. . . . . . . . . . . 12 ⊢ (𝑧 ⊆ 𝐴 → (∪ 𝑧 ∈ 𝑧 → 𝐴 ≠ ∪ 𝑧))
40	39	adantr 480	. . . . . . . . . . 11 ⊢ ((𝑧 ⊆ 𝐴 ∧ 𝑧 ∈ Fin) → (∪ 𝑧 ∈ 𝑧 → 𝐴 ≠ ∪ 𝑧))
41	34, 40	syld 47	. . . . . . . . . 10 ⊢ ((𝑧 ⊆ 𝐴 ∧ 𝑧 ∈ Fin) → (𝑧 ≠ ∅ → 𝐴 ≠ ∪ 𝑧))
42	26, 41	pm2.61dne 3030	. . . . . . . . 9 ⊢ ((𝑧 ⊆ 𝐴 ∧ 𝑧 ∈ Fin) → 𝐴 ≠ ∪ 𝑧)
43	13, 42	syl 17	. . . . . . . 8 ⊢ (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → 𝐴 ≠ ∪ 𝑧)
44	43	neneqd 2947	. . . . . . 7 ⊢ (𝑧 ∈ (𝒫 𝐴 ∩ Fin) → ¬ 𝐴 = ∪ 𝑧)
45	44	nrex 3196	. . . . . 6 ⊢ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = ∪ 𝑧
46		unieq 4847	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → ∪ 𝑦 = ∪ 𝐴)
47	46	eqeq2d 2749	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → (𝐴 = ∪ 𝑦 ↔ 𝐴 = ∪ 𝐴))
48		pweq 4546	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐴 → 𝒫 𝑦 = 𝒫 𝐴)
49	48	ineq1d 4142	. . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → (𝒫 𝑦 ∩ Fin) = (𝒫 𝐴 ∩ Fin))
50	49	rexeqdv 3340	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → (∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = ∪ 𝑧 ↔ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = ∪ 𝑧))
51	50	notbid 317	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → (¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = ∪ 𝑧 ↔ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = ∪ 𝑧))
52	47, 51	anbi12d 630	. . . . . . 7 ⊢ (𝑦 = 𝐴 → ((𝐴 = ∪ 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = ∪ 𝑧) ↔ (𝐴 = ∪ 𝐴 ∧ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = ∪ 𝑧)))
53	52	rspcev 3552	. . . . . 6 ⊢ ((𝐴 ∈ 𝒫 suc 𝐴 ∧ (𝐴 = ∪ 𝐴 ∧ ¬ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)𝐴 = ∪ 𝑧)) → ∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = ∪ 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = ∪ 𝑧))
54	9, 45, 53	mpanr12 701	. . . . 5 ⊢ (𝐴 ∈ 𝒫 suc 𝐴 → ∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = ∪ 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = ∪ 𝑧))
55		rexanali 3191	. . . . 5 ⊢ (∃𝑦 ∈ 𝒫 suc 𝐴(𝐴 = ∪ 𝑦 ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = ∪ 𝑧) ↔ ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = ∪ 𝑧))
56	54, 55	sylib 217	. . . 4 ⊢ (𝐴 ∈ 𝒫 suc 𝐴 → ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = ∪ 𝑧))
57	3, 6, 56	3syl 18	. . 3 ⊢ (suc 𝐴 ∈ Top → ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = ∪ 𝑧))
58		imnan 399	. . 3 ⊢ ((suc 𝐴 ∈ Top → ¬ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = ∪ 𝑧)) ↔ ¬ (suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = ∪ 𝑧)))
59	57, 58	mpbi 229	. 2 ⊢ ¬ (suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = ∪ 𝑧))
60		ordunisuc 7654	. . . . 5 ⊢ (Ord 𝐴 → ∪ suc 𝐴 = 𝐴)
61	7, 27, 60	mp2b 10	. . . 4 ⊢ ∪ suc 𝐴 = 𝐴
62	61	eqcomi 2747	. . 3 ⊢ 𝐴 = ∪ suc 𝐴
63	62	iscmp 22447	. 2 ⊢ (suc 𝐴 ∈ Comp ↔ (suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc 𝐴(𝐴 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝐴 = ∪ 𝑧)))
64	59, 63	mtbir 322	1 ⊢ ¬ suc 𝐴 ∈ Comp

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108   ≠ wne 2942  ∀wral 3063  ∃wrex 3064  Vcvv 3422   ∩ cin 3882   ⊆ wss 3883  ∅c0 4253  𝒫 cpw 4530  ∪ cuni 4836  Ord word 6250  Oncon0 6251  Lim wlim 6252  suc csuc 6253  Fincfn 8691  Topctop 21950  Compccmp 22445

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-om 7688  df-en 8692  df-fin 8695  df-cmp 22446

This theorem is referenced by:  limsucncmp  34562