Theorem qtopval 23611

Description: Value of the quotient topology function. (Contributed by Mario Carneiro, 23-Mar-2015.)

Hypothesis

Ref	Expression
qtopval.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
qtopval	⊢ ((𝐽 ∈ 𝑉 ∧ 𝐹 ∈ 𝑊) → (𝐽 qTop 𝐹) = {𝑠 ∈ 𝒫 (𝐹 “ 𝑋) ∣ ((◡𝐹 “ 𝑠) ∩ 𝑋) ∈ 𝐽})

Distinct variable groups:   𝐹,𝑠   𝐽,𝑠   𝑉,𝑠   𝑋,𝑠

Allowed substitution hint:   𝑊(𝑠)

Proof of Theorem qtopval

Dummy variables 𝑓 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3458	. 2 ⊢ (𝐽 ∈ 𝑉 → 𝐽 ∈ V)
2		elex 3458	. 2 ⊢ (𝐹 ∈ 𝑊 → 𝐹 ∈ V)
3		imaexg 7849	. . . . 5 ⊢ (𝐹 ∈ V → (𝐹 “ 𝑋) ∈ V)
4		pwexg 5318	. . . . 5 ⊢ ((𝐹 “ 𝑋) ∈ V → 𝒫 (𝐹 “ 𝑋) ∈ V)
5		rabexg 5277	. . . . 5 ⊢ (𝒫 (𝐹 “ 𝑋) ∈ V → {𝑠 ∈ 𝒫 (𝐹 “ 𝑋) ∣ ((◡𝐹 “ 𝑠) ∩ 𝑋) ∈ 𝐽} ∈ V)
6	3, 4, 5	3syl 18	. . . 4 ⊢ (𝐹 ∈ V → {𝑠 ∈ 𝒫 (𝐹 “ 𝑋) ∣ ((◡𝐹 “ 𝑠) ∩ 𝑋) ∈ 𝐽} ∈ V)
7	6	adantl 481	. . 3 ⊢ ((𝐽 ∈ V ∧ 𝐹 ∈ V) → {𝑠 ∈ 𝒫 (𝐹 “ 𝑋) ∣ ((◡𝐹 “ 𝑠) ∩ 𝑋) ∈ 𝐽} ∈ V)
8		simpr 484	. . . . . . 7 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
9		simpl 482	. . . . . . . . 9 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → 𝑗 = 𝐽)
10	9	unieqd 4871	. . . . . . . 8 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → ∪ 𝑗 = ∪ 𝐽)
11		qtopval.1	. . . . . . . 8 ⊢ 𝑋 = ∪ 𝐽
12	10, 11	eqtr4di 2786	. . . . . . 7 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → ∪ 𝑗 = 𝑋)
13	8, 12	imaeq12d 6014	. . . . . 6 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → (𝑓 “ ∪ 𝑗) = (𝐹 “ 𝑋))
14	13	pweqd 4566	. . . . 5 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → 𝒫 (𝑓 “ ∪ 𝑗) = 𝒫 (𝐹 “ 𝑋))
15	8	cnveqd 5819	. . . . . . . 8 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → ◡𝑓 = ◡𝐹)
16	15	imaeq1d 6012	. . . . . . 7 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → (◡𝑓 “ 𝑠) = (◡𝐹 “ 𝑠))
17	16, 12	ineq12d 4170	. . . . . 6 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → ((◡𝑓 “ 𝑠) ∩ ∪ 𝑗) = ((◡𝐹 “ 𝑠) ∩ 𝑋))
18	17, 9	eleq12d 2827	. . . . 5 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → (((◡𝑓 “ 𝑠) ∩ ∪ 𝑗) ∈ 𝑗 ↔ ((◡𝐹 “ 𝑠) ∩ 𝑋) ∈ 𝐽))
19	14, 18	rabeqbidv 3414	. . . 4 ⊢ ((𝑗 = 𝐽 ∧ 𝑓 = 𝐹) → {𝑠 ∈ 𝒫 (𝑓 “ ∪ 𝑗) ∣ ((◡𝑓 “ 𝑠) ∩ ∪ 𝑗) ∈ 𝑗} = {𝑠 ∈ 𝒫 (𝐹 “ 𝑋) ∣ ((◡𝐹 “ 𝑠) ∩ 𝑋) ∈ 𝐽})
20		df-qtop 17413	. . . 4 ⊢ qTop = (𝑗 ∈ V, 𝑓 ∈ V ↦ {𝑠 ∈ 𝒫 (𝑓 “ ∪ 𝑗) ∣ ((◡𝑓 “ 𝑠) ∩ ∪ 𝑗) ∈ 𝑗})
21	19, 20	ovmpoga 7506	. . 3 ⊢ ((𝐽 ∈ V ∧ 𝐹 ∈ V ∧ {𝑠 ∈ 𝒫 (𝐹 “ 𝑋) ∣ ((◡𝐹 “ 𝑠) ∩ 𝑋) ∈ 𝐽} ∈ V) → (𝐽 qTop 𝐹) = {𝑠 ∈ 𝒫 (𝐹 “ 𝑋) ∣ ((◡𝐹 “ 𝑠) ∩ 𝑋) ∈ 𝐽})
22	7, 21	mpd3an3 1464	. 2 ⊢ ((𝐽 ∈ V ∧ 𝐹 ∈ V) → (𝐽 qTop 𝐹) = {𝑠 ∈ 𝒫 (𝐹 “ 𝑋) ∣ ((◡𝐹 “ 𝑠) ∩ 𝑋) ∈ 𝐽})
23	1, 2, 22	syl2an 596	1 ⊢ ((𝐽 ∈ 𝑉 ∧ 𝐹 ∈ 𝑊) → (𝐽 qTop 𝐹) = {𝑠 ∈ 𝒫 (𝐹 “ 𝑋) ∣ ((◡𝐹 “ 𝑠) ∩ 𝑋) ∈ 𝐽})

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2113  {crab 3396  Vcvv 3437   ∩ cin 3897  𝒫 cpw 4549  ∪ cuni 4858  ^◡ccnv 5618   “ cima 5622  (class class class)co 7352   qTop cqtop 17409

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-sbc 3738  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-br 5094  df-opab 5156  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6442  df-fun 6488  df-fv 6494  df-ov 7355  df-oprab 7356  df-mpo 7357  df-qtop 17413

This theorem is referenced by:  qtopval2  23612  qtopres  23614  imastopn  23636