Theorem ptcmplem5 23252

Description: Lemma for ptcmp 23254. (Contributed by Mario Carneiro, 26-Aug-2015.)

Hypotheses

Ref	Expression
ptcmp.1	⊢ 𝑆 = (𝑘 ∈ 𝐴, 𝑢 ∈ (𝐹‘𝑘) ↦ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑢))
ptcmp.2	⊢ 𝑋 = X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛)
ptcmp.3	⊢ (𝜑 → 𝐴 ∈ 𝑉)
ptcmp.4	⊢ (𝜑 → 𝐹:𝐴⟶Comp)
ptcmp.5	⊢ (𝜑 → 𝑋 ∈ (UFL ∩ dom card))

Assertion

Ref	Expression
ptcmplem5	⊢ (𝜑 → (∏t‘𝐹) ∈ Comp)

Distinct variable groups:   𝑘,𝑛,𝑢,𝑤,𝐴   𝑆,𝑘,𝑛,𝑢   𝜑,𝑘,𝑛,𝑢   𝑘,𝑉,𝑛,𝑢,𝑤   𝑘,𝐹,𝑛,𝑢,𝑤   𝑘,𝑋,𝑛,𝑢,𝑤

Allowed substitution hints:   𝜑(𝑤)   𝑆(𝑤)

Proof of Theorem ptcmplem5

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ptcmp.5	. . 3 ⊢ (𝜑 → 𝑋 ∈ (UFL ∩ dom card))
2	1	elin1d 4138	. 2 ⊢ (𝜑 → 𝑋 ∈ UFL)
3		ptcmp.1	. . . 4 ⊢ 𝑆 = (𝑘 ∈ 𝐴, 𝑢 ∈ (𝐹‘𝑘) ↦ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑢))
4		ptcmp.2	. . . 4 ⊢ 𝑋 = X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛)
5		ptcmp.3	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
6		ptcmp.4	. . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶Comp)
7	3, 4, 5, 6, 1	ptcmplem1 23248	. . 3 ⊢ (𝜑 → (𝑋 = ∪ (ran 𝑆 ∪ {𝑋}) ∧ (∏t‘𝐹) = (topGen‘(fi‘(ran 𝑆 ∪ {𝑋})))))
8	7	simpld 496	. 2 ⊢ (𝜑 → 𝑋 = ∪ (ran 𝑆 ∪ {𝑋}))
9	7	simprd 497	. 2 ⊢ (𝜑 → (∏t‘𝐹) = (topGen‘(fi‘(ran 𝑆 ∪ {𝑋}))))
10		elpwi 4546	. . . . . 6 ⊢ (𝑦 ∈ 𝒫 ran 𝑆 → 𝑦 ⊆ ran 𝑆)
11	5	ad2antrr 724	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) → 𝐴 ∈ 𝑉)
12	6	ad2antrr 724	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) → 𝐹:𝐴⟶Comp)
13	1	ad2antrr 724	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) → 𝑋 ∈ (UFL ∩ dom card))
14		simplrl 775	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) → 𝑦 ⊆ ran 𝑆)
15		simplrr 776	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) → 𝑋 = ∪ 𝑦)
16		simpr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) → ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)
17		imaeq2 5975	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑢 → (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑧) = (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑢))
18	17	eleq1d 2821	. . . . . . . . . 10 ⊢ (𝑧 = 𝑢 → ((◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑧) ∈ 𝑦 ↔ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑢) ∈ 𝑦))
19	18	cbvrabv 3433	. . . . . . . . 9 ⊢ {𝑧 ∈ (𝐹‘𝑘) ∣ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑧) ∈ 𝑦} = {𝑢 ∈ (𝐹‘𝑘) ∣ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑢) ∈ 𝑦}
20	3, 4, 11, 12, 13, 14, 15, 16, 19	ptcmplem4 23251	. . . . . . . 8 ⊢ ¬ ((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)
21		iman 403	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) ↔ ¬ ((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
22	20, 21	mpbir 230	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)
23	22	expr 458	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ⊆ ran 𝑆) → (𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
24	10, 23	sylan2 594	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝒫 ran 𝑆) → (𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
25	24	adantlr 713	. . . 4 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ 𝑦 ∈ 𝒫 ran 𝑆) → (𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
26		velpw 4544	. . . . . . 7 ⊢ (𝑦 ∈ 𝒫 (ran 𝑆 ∪ {𝑋}) ↔ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋}))
27		eldif 3902	. . . . . . . 8 ⊢ (𝑦 ∈ (𝒫 (ran 𝑆 ∪ {𝑋}) ∖ 𝒫 ran 𝑆) ↔ (𝑦 ∈ 𝒫 (ran 𝑆 ∪ {𝑋}) ∧ ¬ 𝑦 ∈ 𝒫 ran 𝑆))
28		elpwunsn 4623	. . . . . . . 8 ⊢ (𝑦 ∈ (𝒫 (ran 𝑆 ∪ {𝑋}) ∖ 𝒫 ran 𝑆) → 𝑋 ∈ 𝑦)
29	27, 28	sylbir 234	. . . . . . 7 ⊢ ((𝑦 ∈ 𝒫 (ran 𝑆 ∪ {𝑋}) ∧ ¬ 𝑦 ∈ 𝒫 ran 𝑆) → 𝑋 ∈ 𝑦)
30	26, 29	sylanbr 583	. . . . . 6 ⊢ ((𝑦 ⊆ (ran 𝑆 ∪ {𝑋}) ∧ ¬ 𝑦 ∈ 𝒫 ran 𝑆) → 𝑋 ∈ 𝑦)
31	30	adantll 712	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ ¬ 𝑦 ∈ 𝒫 ran 𝑆) → 𝑋 ∈ 𝑦)
32		snssi 4747	. . . . . . . . 9 ⊢ (𝑋 ∈ 𝑦 → {𝑋} ⊆ 𝑦)
33	32	adantl 483	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ 𝑋 ∈ 𝑦) → {𝑋} ⊆ 𝑦)
34		snfi 8869	. . . . . . . 8 ⊢ {𝑋} ∈ Fin
35		elfpw 9165	. . . . . . . 8 ⊢ ({𝑋} ∈ (𝒫 𝑦 ∩ Fin) ↔ ({𝑋} ⊆ 𝑦 ∧ {𝑋} ∈ Fin))
36	33, 34, 35	sylanblrc 591	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ 𝑋 ∈ 𝑦) → {𝑋} ∈ (𝒫 𝑦 ∩ Fin))
37		unisng 4865	. . . . . . . . 9 ⊢ (𝑋 ∈ 𝑦 → ∪ {𝑋} = 𝑋)
38	37	eqcomd 2742	. . . . . . . 8 ⊢ (𝑋 ∈ 𝑦 → 𝑋 = ∪ {𝑋})
39	38	adantl 483	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ 𝑋 ∈ 𝑦) → 𝑋 = ∪ {𝑋})
40		unieq 4855	. . . . . . . 8 ⊢ (𝑧 = {𝑋} → ∪ 𝑧 = ∪ {𝑋})
41	40	rspceeqv 3580	. . . . . . 7 ⊢ (({𝑋} ∈ (𝒫 𝑦 ∩ Fin) ∧ 𝑋 = ∪ {𝑋}) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)
42	36, 39, 41	syl2anc 585	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ 𝑋 ∈ 𝑦) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)
43	42	a1d 25	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ 𝑋 ∈ 𝑦) → (𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
44	31, 43	syldan 592	. . . 4 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ ¬ 𝑦 ∈ 𝒫 ran 𝑆) → (𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
45	25, 44	pm2.61dan 811	. . 3 ⊢ ((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) → (𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
46	45	impr 456	. 2 ⊢ ((𝜑 ∧ (𝑦 ⊆ (ran 𝑆 ∪ {𝑋}) ∧ 𝑋 = ∪ 𝑦)) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)
47	2, 8, 9, 46	alexsub 23241	1 ⊢ (𝜑 → (∏t‘𝐹) ∈ Comp)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 397   = wceq 1539   ∈ wcel 2104  ∃wrex 3071  {crab 3284   ∖ cdif 3889   ∪ cun 3890   ∩ cin 3891   ⊆ wss 3892  𝒫 cpw 4539  {csn 4565  ∪ cuni 4844   ↦ cmpt 5164  ^◡ccnv 5599  dom cdm 5600  ran crn 5601   “ cima 5603  ⟶wf 6454  ‘cfv 6458   ∈ cmpo 7309  Xcixp 8716  Fincfn 8764  ficfi 9213  cardccrd 9737  topGenctg 17193  ∏_tcpt 17194  Compccmp 22582  UFLcufl 23096

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2707  ax-rep 5218  ax-sep 5232  ax-nul 5239  ax-pow 5297  ax-pr 5361  ax-un 7620

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3or 1088  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2887  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-rmo 3285  df-reu 3286  df-rab 3287  df-v 3439  df-sbc 3722  df-csb 3838  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-pss 3911  df-nul 4263  df-if 4466  df-pw 4541  df-sn 4566  df-pr 4568  df-op 4572  df-uni 4845  df-int 4887  df-iun 4933  df-iin 4934  df-br 5082  df-opab 5144  df-mpt 5165  df-tr 5199  df-id 5500  df-eprel 5506  df-po 5514  df-so 5515  df-fr 5555  df-se 5556  df-we 5557  df-xp 5606  df-rel 5607  df-cnv 5608  df-co 5609  df-dm 5610  df-rn 5611  df-res 5612  df-ima 5613  df-pred 6217  df-ord 6284  df-on 6285  df-lim 6286  df-suc 6287  df-iota 6410  df-fun 6460  df-fn 6461  df-f 6462  df-f1 6463  df-fo 6464  df-f1o 6465  df-fv 6466  df-isom 6467  df-riota 7264  df-ov 7310  df-oprab 7311  df-mpo 7312  df-om 7745  df-1st 7863  df-2nd 7864  df-frecs 8128  df-wrecs 8159  df-recs 8233  df-rdg 8272  df-1o 8328  df-oadd 8332  df-omul 8333  df-er 8529  df-map 8648  df-ixp 8717  df-en 8765  df-dom 8766  df-fin 8768  df-fi 9214  df-wdom 9368  df-card 9741  df-acn 9744  df-topgen 17199  df-pt 17200  df-fbas 20639  df-fg 20640  df-top 22088  df-topon 22105  df-bases 22141  df-cld 22215  df-ntr 22216  df-cls 22217  df-nei 22294  df-cmp 22583  df-fil 23042  df-ufil 23097  df-ufl 23098  df-flim 23135  df-fcls 23137

This theorem is referenced by:  ptcmpg  23253