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

Theorem kqsat 21474
Description: Any open set is saturated with respect to the topological indistinguishability map (in the terminology of qtoprest 21460). (Contributed by Mario Carneiro, 25-Aug-2015.)
Hypothesis
Ref Expression
kqval.2 𝐹 = (𝑥𝑋 ↦ {𝑦𝐽𝑥𝑦})
Assertion
Ref Expression
kqsat ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹 “ (𝐹𝑈)) = 𝑈)
Distinct variable groups:   𝑥,𝑦,𝐽   𝑥,𝑋,𝑦
Allowed substitution hints:   𝑈(𝑥,𝑦)   𝐹(𝑥,𝑦)

Proof of Theorem kqsat
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 kqval.2 . . . . . . 7 𝐹 = (𝑥𝑋 ↦ {𝑦𝐽𝑥𝑦})
21kqffn 21468 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝐹 Fn 𝑋)
3 elpreima 6303 . . . . . 6 (𝐹 Fn 𝑋 → (𝑧 ∈ (𝐹 “ (𝐹𝑈)) ↔ (𝑧𝑋 ∧ (𝐹𝑧) ∈ (𝐹𝑈))))
42, 3syl 17 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → (𝑧 ∈ (𝐹 “ (𝐹𝑈)) ↔ (𝑧𝑋 ∧ (𝐹𝑧) ∈ (𝐹𝑈))))
54adantr 481 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝑧 ∈ (𝐹 “ (𝐹𝑈)) ↔ (𝑧𝑋 ∧ (𝐹𝑧) ∈ (𝐹𝑈))))
61kqfvima 21473 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝑧𝑋) → (𝑧𝑈 ↔ (𝐹𝑧) ∈ (𝐹𝑈)))
763expa 1262 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) ∧ 𝑧𝑋) → (𝑧𝑈 ↔ (𝐹𝑧) ∈ (𝐹𝑈)))
87biimprd 238 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) ∧ 𝑧𝑋) → ((𝐹𝑧) ∈ (𝐹𝑈) → 𝑧𝑈))
98expimpd 628 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → ((𝑧𝑋 ∧ (𝐹𝑧) ∈ (𝐹𝑈)) → 𝑧𝑈))
105, 9sylbid 230 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝑧 ∈ (𝐹 “ (𝐹𝑈)) → 𝑧𝑈))
1110ssrdv 3594 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹 “ (𝐹𝑈)) ⊆ 𝑈)
12 toponss 20671 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → 𝑈𝑋)
13 fndm 5958 . . . . . . 7 (𝐹 Fn 𝑋 → dom 𝐹 = 𝑋)
142, 13syl 17 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → dom 𝐹 = 𝑋)
1514adantr 481 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → dom 𝐹 = 𝑋)
1612, 15sseqtr4d 3627 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → 𝑈 ⊆ dom 𝐹)
17 sseqin2 3801 . . . 4 (𝑈 ⊆ dom 𝐹 ↔ (dom 𝐹𝑈) = 𝑈)
1816, 17sylib 208 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (dom 𝐹𝑈) = 𝑈)
19 dminss 5516 . . 3 (dom 𝐹𝑈) ⊆ (𝐹 “ (𝐹𝑈))
2018, 19syl6eqssr 3641 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → 𝑈 ⊆ (𝐹 “ (𝐹𝑈)))
2111, 20eqssd 3605 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽) → (𝐹 “ (𝐹𝑈)) = 𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1480  wcel 1987  {crab 2912  cin 3559  wss 3560  cmpt 4683  ccnv 5083  dom cdm 5084  cima 5087   Fn wfn 5852  cfv 5857  TopOnctopon 20655
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2913  df-rex 2914  df-rab 2917  df-v 3192  df-sbc 3423  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-pw 4138  df-sn 4156  df-pr 4158  df-op 4162  df-uni 4410  df-br 4624  df-opab 4684  df-mpt 4685  df-id 4999  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-res 5096  df-ima 5097  df-iota 5820  df-fun 5859  df-fn 5860  df-f 5861  df-fv 5865  df-topon 20656
This theorem is referenced by:  kqopn  21477  kqreglem2  21485  kqnrmlem2  21487
  Copyright terms: Public domain W3C validator