Theorem ptpjpre1 23890

Description: The preimage of a projection function can be expressed as an indexed cartesian product. (Contributed by Mario Carneiro, 6-Feb-2015.)

Hypothesis

Ref	Expression
ptpjpre1.1	⊢ 𝑋 = X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)

Assertion

Ref	Expression
ptpjpre1	⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼)) “ 𝑈) = X𝑘 ∈ 𝐴 if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)))

Distinct variable groups:   𝑤,𝑘,𝐴   𝑘,𝐹,𝑤   𝑘,𝐼,𝑤   𝑈,𝑘,𝑤   𝑘,𝑉,𝑤   𝑤,𝑋

Allowed substitution hint:   𝑋(𝑘)

Proof of Theorem ptpjpre1

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6885	. . . . . . . 8 ⊢ (𝑘 = 𝐼 → (𝑤‘𝑘) = (𝑤‘𝐼))
2		fveq2 6885	. . . . . . . . 9 ⊢ (𝑘 = 𝐼 → (𝐹‘𝑘) = (𝐹‘𝐼))
3	2	unieqd 4879	. . . . . . . 8 ⊢ (𝑘 = 𝐼 → ∪ (𝐹‘𝑘) = ∪ (𝐹‘𝐼))
4	1, 3	eleq12d 2854	. . . . . . 7 ⊢ (𝑘 = 𝐼 → ((𝑤‘𝑘) ∈ ∪ (𝐹‘𝑘) ↔ (𝑤‘𝐼) ∈ ∪ (𝐹‘𝐼)))
5		vex 3454	. . . . . . . . . . 11 ⊢ 𝑤 ∈ V
6	5	elixp 8932	. . . . . . . . . 10 ⊢ (𝑤 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↔ (𝑤 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑤‘𝑘) ∈ ∪ (𝐹‘𝑘)))
7	6	simprbi 503	. . . . . . . . 9 ⊢ (𝑤 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) → ∀𝑘 ∈ 𝐴 (𝑤‘𝑘) ∈ ∪ (𝐹‘𝑘))
8		ptpjpre1.1	. . . . . . . . 9 ⊢ 𝑋 = X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)
9	7, 8	eleq2s 2878	. . . . . . . 8 ⊢ (𝑤 ∈ 𝑋 → ∀𝑘 ∈ 𝐴 (𝑤‘𝑘) ∈ ∪ (𝐹‘𝑘))
10	9	adantl 487	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) ∧ 𝑤 ∈ 𝑋) → ∀𝑘 ∈ 𝐴 (𝑤‘𝑘) ∈ ∪ (𝐹‘𝑘))
11		simplrl 789	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) ∧ 𝑤 ∈ 𝑋) → 𝐼 ∈ 𝐴)
12	4, 10, 11	rspcdva 3577	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) ∧ 𝑤 ∈ 𝑋) → (𝑤‘𝐼) ∈ ∪ (𝐹‘𝐼))
13	12	fmpttd 7115	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → (𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼)):𝑋⟶∪ (𝐹‘𝐼))
14		ffn 6709	. . . . 5 ⊢ ((𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼)):𝑋⟶∪ (𝐹‘𝐼) → (𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼)) Fn 𝑋)
15		elpreima 7057	. . . . 5 ⊢ ((𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼)) Fn 𝑋 → (𝑧 ∈ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼)) “ 𝑈) ↔ (𝑧 ∈ 𝑋 ∧ ((𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼))‘𝑧) ∈ 𝑈)))
16	13, 14, 15	3syl 19	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → (𝑧 ∈ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼)) “ 𝑈) ↔ (𝑧 ∈ 𝑋 ∧ ((𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼))‘𝑧) ∈ 𝑈)))
17		fveq1 6884	. . . . . . . . 9 ⊢ (𝑤 = 𝑧 → (𝑤‘𝐼) = (𝑧‘𝐼))
18		eqid 2760	. . . . . . . . 9 ⊢ (𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼)) = (𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼))
19		fvex 6898	. . . . . . . . 9 ⊢ (𝑧‘𝐼) ∈ V
20	17, 18, 19	fvmpt 6993	. . . . . . . 8 ⊢ (𝑧 ∈ 𝑋 → ((𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼))‘𝑧) = (𝑧‘𝐼))
21	20	eleq1d 2845	. . . . . . 7 ⊢ (𝑧 ∈ 𝑋 → (((𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼))‘𝑧) ∈ 𝑈 ↔ (𝑧‘𝐼) ∈ 𝑈))
22	21	pm5.32i 585	. . . . . 6 ⊢ ((𝑧 ∈ 𝑋 ∧ ((𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼))‘𝑧) ∈ 𝑈) ↔ (𝑧 ∈ 𝑋 ∧ (𝑧‘𝐼) ∈ 𝑈))
23	8	eleq2i 2852	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑋 ↔ 𝑧 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
24		vex 3454	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
25	24	elixp 8932	. . . . . . . . 9 ⊢ (𝑧 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↔ (𝑧 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘)))
26	23, 25	bitri 278	. . . . . . . 8 ⊢ (𝑧 ∈ 𝑋 ↔ (𝑧 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘)))
27	26	anbi1i 636	. . . . . . 7 ⊢ ((𝑧 ∈ 𝑋 ∧ (𝑧‘𝐼) ∈ 𝑈) ↔ ((𝑧 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘)) ∧ (𝑧‘𝐼) ∈ 𝑈))
28		anass 474	. . . . . . 7 ⊢ (((𝑧 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘)) ∧ (𝑧‘𝐼) ∈ 𝑈) ↔ (𝑧 Fn 𝐴 ∧ (∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘) ∧ (𝑧‘𝐼) ∈ 𝑈)))
29	27, 28	bitri 278	. . . . . 6 ⊢ ((𝑧 ∈ 𝑋 ∧ (𝑧‘𝐼) ∈ 𝑈) ↔ (𝑧 Fn 𝐴 ∧ (∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘) ∧ (𝑧‘𝐼) ∈ 𝑈)))
30	22, 29	bitri 278	. . . . 5 ⊢ ((𝑧 ∈ 𝑋 ∧ ((𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼))‘𝑧) ∈ 𝑈) ↔ (𝑧 Fn 𝐴 ∧ (∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘) ∧ (𝑧‘𝐼) ∈ 𝑈)))
31		simprl 783	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) ∧ ((𝑧‘𝐼) ∈ 𝑈 ∧ (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘))) → (𝑧‘𝐼) ∈ 𝑈)
32		fveq2 6885	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝐼 → (𝑧‘𝑘) = (𝑧‘𝐼))
33		iftrue 4487	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝐼 → if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) = 𝑈)
34	32, 33	eleq12d 2854	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝐼 → ((𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) ↔ (𝑧‘𝐼) ∈ 𝑈))
35	31, 34	syl5ibrcom 250	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) ∧ ((𝑧‘𝐼) ∈ 𝑈 ∧ (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘))) → (𝑘 = 𝐼 → (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘))))
36		simprr 785	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) ∧ ((𝑧‘𝐼) ∈ 𝑈 ∧ (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘))) → (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘))
37		iffalse 4490	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑘 = 𝐼 → if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) = ∪ (𝐹‘𝑘))
38	37	eleq2d 2846	. . . . . . . . . . . . 13 ⊢ (¬ 𝑘 = 𝐼 → ((𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) ↔ (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘)))
39	36, 38	syl5ibrcom 250	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) ∧ ((𝑧‘𝐼) ∈ 𝑈 ∧ (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘))) → (¬ 𝑘 = 𝐼 → (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘))))
40	35, 39	pm2.61d 181	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) ∧ ((𝑧‘𝐼) ∈ 𝑈 ∧ (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘))) → (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)))
41	40	expr 462	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) ∧ (𝑧‘𝐼) ∈ 𝑈) → ((𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘) → (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘))))
42	41	ralimdv 3176	. . . . . . . . 9 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) ∧ (𝑧‘𝐼) ∈ 𝑈) → (∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘) → ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘))))
43	42	expimpd 459	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → (((𝑧‘𝐼) ∈ 𝑈 ∧ ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘)) → ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘))))
44	43	ancomsd 471	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → ((∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘) ∧ (𝑧‘𝐼) ∈ 𝑈) → ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘))))
45		elssuni 4898	. . . . . . . . . . . . 13 ⊢ (𝑈 ∈ (𝐹‘𝐼) → 𝑈 ⊆ ∪ (𝐹‘𝐼))
46	45	ad2antll 742	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → 𝑈 ⊆ ∪ (𝐹‘𝐼))
47	33, 3	sseq12d 3941	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝐼 → (if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) ⊆ ∪ (𝐹‘𝑘) ↔ 𝑈 ⊆ ∪ (𝐹‘𝐼)))
48	46, 47	syl5ibrcom 250	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → (𝑘 = 𝐼 → if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) ⊆ ∪ (𝐹‘𝑘)))
49		ssid 3930	. . . . . . . . . . . 12 ⊢ ∪ (𝐹‘𝑘) ⊆ ∪ (𝐹‘𝑘)
50	37, 49	eqsstrdi 3952	. . . . . . . . . . 11 ⊢ (¬ 𝑘 = 𝐼 → if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) ⊆ ∪ (𝐹‘𝑘))
51	48, 50	pm2.61d1 182	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) ⊆ ∪ (𝐹‘𝑘))
52	51	sseld 3907	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → ((𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) → (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘)))
53	52	ralimdv 3176	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → (∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) → ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘)))
54	34	rspcv 3572	. . . . . . . . 9 ⊢ (𝐼 ∈ 𝐴 → (∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) → (𝑧‘𝐼) ∈ 𝑈))
55	54	ad2antrl 741	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → (∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) → (𝑧‘𝐼) ∈ 𝑈))
56	53, 55	jcad 522	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → (∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) → (∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘) ∧ (𝑧‘𝐼) ∈ 𝑈)))
57	44, 56	impbid 215	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → ((∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘) ∧ (𝑧‘𝐼) ∈ 𝑈) ↔ ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘))))
58	57	anbi2d 642	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → ((𝑧 Fn 𝐴 ∧ (∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ ∪ (𝐹‘𝑘) ∧ (𝑧‘𝐼) ∈ 𝑈)) ↔ (𝑧 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)))))
59	30, 58	bitrid 286	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → ((𝑧 ∈ 𝑋 ∧ ((𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼))‘𝑧) ∈ 𝑈) ↔ (𝑧 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)))))
60	16, 59	bitrd 282	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → (𝑧 ∈ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼)) “ 𝑈) ↔ (𝑧 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)))))
61	24	elixp 8932	. . 3 ⊢ (𝑧 ∈ X𝑘 ∈ 𝐴 if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)) ↔ (𝑧 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑧‘𝑘) ∈ if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘))))
62	60, 61	bitr4di 292	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → (𝑧 ∈ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼)) “ 𝑈) ↔ 𝑧 ∈ X𝑘 ∈ 𝐴 if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘))))
63	62	eqrdv 2758	1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑈 ∈ (𝐹‘𝐼))) → (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝐼)) “ 𝑈) = X𝑘 ∈ 𝐴 if(𝑘 = 𝐼, 𝑈, ∪ (𝐹‘𝑘)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076   ⊆ wss 3895  ifcif 4481  ∪ cuni 4866   ↦ cmpt 5185  ^◡ccnv 5649   “ cima 5653   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  Xcixp 8925  Topctop 23211

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ixp 8926

This theorem is used by:  ptpjpre2  23899  ptbasfi  23900