Theorem ptcmplem5 22661

Description: Lemma for ptcmp 22663. (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 4125	. 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 22657	. . 3 ⊢ (𝜑 → (𝑋 = ∪ (ran 𝑆 ∪ {𝑋}) ∧ (∏t‘𝐹) = (topGen‘(fi‘(ran 𝑆 ∪ {𝑋})))))
8	7	simpld 498	. 2 ⊢ (𝜑 → 𝑋 = ∪ (ran 𝑆 ∪ {𝑋}))
9	7	simprd 499	. 2 ⊢ (𝜑 → (∏t‘𝐹) = (topGen‘(fi‘(ran 𝑆 ∪ {𝑋}))))
10		elpwi 4506	. . . . . 6 ⊢ (𝑦 ∈ 𝒫 ran 𝑆 → 𝑦 ⊆ ran 𝑆)
11	5	ad2antrr 725	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) → 𝐴 ∈ 𝑉)
12	6	ad2antrr 725	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) → 𝐹:𝐴⟶Comp)
13	1	ad2antrr 725	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) → 𝑋 ∈ (UFL ∩ dom card))
14		simplrl 776	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) → 𝑦 ⊆ ran 𝑆)
15		simplrr 777	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) → 𝑋 = ∪ 𝑦)
16		simpr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) → ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)
17		imaeq2 5892	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑢 → (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑧) = (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑢))
18	17	eleq1d 2874	. . . . . . . . . 10 ⊢ (𝑧 = 𝑢 → ((◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑧) ∈ 𝑦 ↔ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑢) ∈ 𝑦))
19	18	cbvrabv 3439	. . . . . . . . 9 ⊢ {𝑧 ∈ (𝐹‘𝑘) ∣ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑧) ∈ 𝑦} = {𝑢 ∈ (𝐹‘𝑘) ∣ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑢) ∈ 𝑦}
20	3, 4, 11, 12, 13, 14, 15, 16, 19	ptcmplem4 22660	. . . . . . . 8 ⊢ ¬ ((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)
21		iman 405	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧) ↔ ¬ ((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) ∧ ¬ ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
22	20, 21	mpbir 234	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ ran 𝑆 ∧ 𝑋 = ∪ 𝑦)) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)
23	22	expr 460	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ⊆ ran 𝑆) → (𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
24	10, 23	sylan2 595	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝒫 ran 𝑆) → (𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
25	24	adantlr 714	. . . 4 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ 𝑦 ∈ 𝒫 ran 𝑆) → (𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
26		velpw 4502	. . . . . . 7 ⊢ (𝑦 ∈ 𝒫 (ran 𝑆 ∪ {𝑋}) ↔ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋}))
27		eldif 3891	. . . . . . . 8 ⊢ (𝑦 ∈ (𝒫 (ran 𝑆 ∪ {𝑋}) ∖ 𝒫 ran 𝑆) ↔ (𝑦 ∈ 𝒫 (ran 𝑆 ∪ {𝑋}) ∧ ¬ 𝑦 ∈ 𝒫 ran 𝑆))
28		elpwunsn 4581	. . . . . . . 8 ⊢ (𝑦 ∈ (𝒫 (ran 𝑆 ∪ {𝑋}) ∖ 𝒫 ran 𝑆) → 𝑋 ∈ 𝑦)
29	27, 28	sylbir 238	. . . . . . 7 ⊢ ((𝑦 ∈ 𝒫 (ran 𝑆 ∪ {𝑋}) ∧ ¬ 𝑦 ∈ 𝒫 ran 𝑆) → 𝑋 ∈ 𝑦)
30	26, 29	sylanbr 585	. . . . . 6 ⊢ ((𝑦 ⊆ (ran 𝑆 ∪ {𝑋}) ∧ ¬ 𝑦 ∈ 𝒫 ran 𝑆) → 𝑋 ∈ 𝑦)
31	30	adantll 713	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ ¬ 𝑦 ∈ 𝒫 ran 𝑆) → 𝑋 ∈ 𝑦)
32		snssi 4701	. . . . . . . . 9 ⊢ (𝑋 ∈ 𝑦 → {𝑋} ⊆ 𝑦)
33	32	adantl 485	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ 𝑋 ∈ 𝑦) → {𝑋} ⊆ 𝑦)
34		snfi 8577	. . . . . . . 8 ⊢ {𝑋} ∈ Fin
35		elfpw 8810	. . . . . . . 8 ⊢ ({𝑋} ∈ (𝒫 𝑦 ∩ Fin) ↔ ({𝑋} ⊆ 𝑦 ∧ {𝑋} ∈ Fin))
36	33, 34, 35	sylanblrc 593	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ 𝑋 ∈ 𝑦) → {𝑋} ∈ (𝒫 𝑦 ∩ Fin))
37		unisng 4819	. . . . . . . . 9 ⊢ (𝑋 ∈ 𝑦 → ∪ {𝑋} = 𝑋)
38	37	eqcomd 2804	. . . . . . . 8 ⊢ (𝑋 ∈ 𝑦 → 𝑋 = ∪ {𝑋})
39	38	adantl 485	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ 𝑋 ∈ 𝑦) → 𝑋 = ∪ {𝑋})
40		unieq 4811	. . . . . . . 8 ⊢ (𝑧 = {𝑋} → ∪ 𝑧 = ∪ {𝑋})
41	40	rspceeqv 3586	. . . . . . 7 ⊢ (({𝑋} ∈ (𝒫 𝑦 ∩ Fin) ∧ 𝑋 = ∪ {𝑋}) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)
42	36, 39, 41	syl2anc 587	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ 𝑋 ∈ 𝑦) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)
43	42	a1d 25	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ 𝑋 ∈ 𝑦) → (𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
44	31, 43	syldan 594	. . . 4 ⊢ (((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) ∧ ¬ 𝑦 ∈ 𝒫 ran 𝑆) → (𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
45	25, 44	pm2.61dan 812	. . 3 ⊢ ((𝜑 ∧ 𝑦 ⊆ (ran 𝑆 ∪ {𝑋})) → (𝑋 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧))
46	45	impr 458	. 2 ⊢ ((𝜑 ∧ (𝑦 ⊆ (ran 𝑆 ∪ {𝑋}) ∧ 𝑋 = ∪ 𝑦)) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)𝑋 = ∪ 𝑧)
47	2, 8, 9, 46	alexsub 22650	1 ⊢ (𝜑 → (∏t‘𝐹) ∈ Comp)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∃wrex 3107  {crab 3110   ∖ cdif 3878   ∪ cun 3879   ∩ cin 3880   ⊆ wss 3881  𝒫 cpw 4497  {csn 4525  ∪ cuni 4800   ↦ cmpt 5110  ^◡ccnv 5518  dom cdm 5519  ran crn 5520   “ cima 5522  ⟶wf 6320  ‘cfv 6324   ∈ cmpo 7137  Xcixp 8444  Fincfn 8492  ficfi 8858  cardccrd 9348  topGenctg 16703  ∏_tcpt 16704  Compccmp 21991  UFLcufl 22505

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-se 5479  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-isom 6333  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-2o 8086  df-oadd 8089  df-omul 8090  df-er 8272  df-map 8391  df-ixp 8445  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-fi 8859  df-wdom 9013  df-card 9352  df-acn 9355  df-topgen 16709  df-pt 16710  df-fbas 20088  df-fg 20089  df-top 21499  df-topon 21516  df-bases 21551  df-cld 21624  df-ntr 21625  df-cls 21626  df-nei 21703  df-cmp 21992  df-fil 22451  df-ufil 22506  df-ufl 22507  df-flim 22544  df-fcls 22546

This theorem is referenced by:  ptcmpg  22662