Theorem opncldf2 23033

Description: The values 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
opncldf2	⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ 𝐽) → (𝐹‘𝐴) = (𝑋 ∖ 𝐴))

Distinct variable groups:   𝑢,𝐴   𝑢,𝐽   𝑢,𝑋

Allowed substitution hint:   𝐹(𝑢)

Proof of Theorem opncldf2

Step	Hyp	Ref	Expression
1		opncldf.2	. 2 ⊢ 𝐹 = (𝑢 ∈ 𝐽 ↦ (𝑋 ∖ 𝑢))
2		difeq2 4073	. 2 ⊢ (𝑢 = 𝐴 → (𝑋 ∖ 𝑢) = (𝑋 ∖ 𝐴))
3		simpr 484	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ 𝐽) → 𝐴 ∈ 𝐽)
4		opncldf.1	. . 3 ⊢ 𝑋 = ∪ 𝐽
5	4	opncld 22981	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ 𝐽) → (𝑋 ∖ 𝐴) ∈ (Clsd‘𝐽))
6	1, 2, 3, 5	fvmptd3 6966	1 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ 𝐽) → (𝐹‘𝐴) = (𝑋 ∖ 𝐴))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ∖ cdif 3899  ∪ cuni 4864   ↦ cmpt 5180  ‘cfv 6493  Topctop 22841  Clsdccld 22964

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3062  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-iota 6449  df-fun 6495  df-fv 6501  df-top 22842  df-cld 22967

This theorem is referenced by: (None)