MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  opncldf3 Structured version   Visualization version   GIF version

Theorem opncldf3 23212
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.
StepHypRef Expression
1 cldrcl 23152 . . . 4 (𝐵 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top)
2 opncldf.1 . . . . . 6 𝑋 = 𝐽
3 opncldf.2 . . . . . 6 𝐹 = (𝑢𝐽 ↦ (𝑋𝑢))
42, 3opncldf1 23210 . . . . 5 (𝐽 ∈ Top → (𝐹:𝐽1-1-onto→(Clsd‘𝐽) ∧ 𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋𝑥))))
54simprd 500 . . . 4 (𝐽 ∈ Top → 𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋𝑥)))
61, 5syl 18 . . 3 (𝐵 ∈ (Clsd‘𝐽) → 𝐹 = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋𝑥)))
76fveq1d 6884 . 2 (𝐵 ∈ (Clsd‘𝐽) → (𝐹𝐵) = ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋𝑥))‘𝐵))
82cldopn 23157 . . 3 (𝐵 ∈ (Clsd‘𝐽) → (𝑋𝐵) ∈ 𝐽)
9 difeq2 4083 . . . 4 (𝑥 = 𝐵 → (𝑋𝑥) = (𝑋𝐵))
10 eqid 2769 . . . 4 (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋𝑥)) = (𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋𝑥))
119, 10fvmptg 6988 . . 3 ((𝐵 ∈ (Clsd‘𝐽) ∧ (𝑋𝐵) ∈ 𝐽) → ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋𝑥))‘𝐵) = (𝑋𝐵))
128, 11mpdan 699 . 2 (𝐵 ∈ (Clsd‘𝐽) → ((𝑥 ∈ (Clsd‘𝐽) ↦ (𝑋𝑥))‘𝐵) = (𝑋𝐵))
137, 12eqtrd 2804 1 (𝐵 ∈ (Clsd‘𝐽) → (𝐹𝐵) = (𝑋𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149  cdif 3910   cuni 4876  cmpt 5196  ccnv 5661  1-1-ontowf1o 6536  cfv 6537  Topctop 23019  Clsdccld 23142
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-top 23020  df-cld 23145
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator