Theorem opncldf3 23028

Description: The values of the converse/inverse of the open-closed bijection. (Contributed by Jeff Hankins, 27-Aug-2009.) (Proof shortened by Mario Carneiro, 1-Sep-2015.)

Hypotheses

Ref	Expression
opncldf.1	⊢ 𝑋 = ∪ 𝐽
opncldf.2	⊢ 𝐹 = (𝑢 ∈ 𝐽 ↦ (𝑋 ∖ 𝑢))

Assertion

Ref	Expression
opncldf3	⊢ (𝐵 ∈ (Clsd‘𝐽) → (◡𝐹‘𝐵) = (𝑋 ∖ 𝐵))

Distinct variable groups:   𝑢,𝐽   𝑢,𝑋

Allowed substitution hints:   𝐵(𝑢)   𝐹(𝑢)

Proof of Theorem opncldf3

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cldrcl 22968	. . . 4 ⊢ (𝐵 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top)
2		opncldf.1	. . . . . 6 ⊢ 𝑋 = ∪ 𝐽
3		opncldf.2	. . . . . 6 ⊢ 𝐹 = (𝑢 ∈ 𝐽 ↦ (𝑋 ∖ 𝑢))
4	2, 3	opncldf1 23026	. . . . 5 ⊢ (𝐽 ∈ Top → (𝐹:𝐽–1-1-onto→(Clsd‘𝐽) ∧ ◡𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))))
5	4	simprd 495	. . . 4 ⊢ (𝐽 ∈ Top → ◡𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥)))
6	1, 5	syl 17	. . 3 ⊢ (𝐵 ∈ (Clsd‘𝐽) → ◡𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥)))
7	6	fveq1d 6834	. 2 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (◡𝐹‘𝐵) = ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))‘𝐵))
8	2	cldopn 22973	. . 3 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (𝑋 ∖ 𝐵) ∈ 𝐽)
9		difeq2 4070	. . . 4 ⊢ (𝑥 = 𝐵 → (𝑋 ∖ 𝑥) = (𝑋 ∖ 𝐵))
10		eqid 2734	. . . 4 ⊢ (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥)) = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))
11	9, 10	fvmptg 6937	. . 3 ⊢ ((𝐵 ∈ (Clsd‘𝐽) ∧ (𝑋 ∖ 𝐵) ∈ 𝐽) → ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))‘𝐵) = (𝑋 ∖ 𝐵))
12	8, 11	mpdan 687	. 2 ⊢ (𝐵 ∈ (Clsd‘𝐽) → ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋 ∖ 𝑥))‘𝐵) = (𝑋 ∖ 𝐵))
13	7, 12	eqtrd 2769	1 ⊢ (𝐵 ∈ (Clsd‘𝐽) → (◡𝐹‘𝐵) = (𝑋 ∖ 𝐵))

Syntax hints:   → wi 4   = wceq 1541   ∈ wcel 2113   ∖ cdif 3896  ∪ cuni 4861   ↦ cmpt 5177  ^◡ccnv 5621  –1-1-onto→wf1o 6489  ‘cfv 6490  Topctop 22835  Clsdccld 22958

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 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678

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 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-top 22836  df-cld 22961

This theorem is referenced by: (None)