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

Theorem kqcldsat 21476
Description: Any closed 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
kqcldsat ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹 “ (𝐹𝑈)) = 𝑈)
Distinct variable groups:   𝑥,𝑦,𝐽   𝑥,𝑋,𝑦
Allowed substitution hints:   𝑈(𝑥,𝑦)   𝐹(𝑥,𝑦)

Proof of Theorem kqcldsat
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‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝑧 ∈ (𝐹 “ (𝐹𝑈)) ↔ (𝑧𝑋 ∧ (𝐹𝑧) ∈ (𝐹𝑈))))
6 noel 3901 . . . . . . . 8 ¬ (𝐹𝑧) ∈ ∅
7 elin 3780 . . . . . . . . 9 ((𝐹𝑧) ∈ ((𝐹𝑈) ∩ (𝐹 “ (𝑋𝑈))) ↔ ((𝐹𝑧) ∈ (𝐹𝑈) ∧ (𝐹𝑧) ∈ (𝐹 “ (𝑋𝑈))))
8 incom 3789 . . . . . . . . . . 11 ((𝐹𝑈) ∩ (𝐹 “ (𝑋𝑈))) = ((𝐹 “ (𝑋𝑈)) ∩ (𝐹𝑈))
9 eqid 2621 . . . . . . . . . . . . . . . . . . . 20 𝐽 = 𝐽
109cldss 20773 . . . . . . . . . . . . . . . . . . 19 (𝑈 ∈ (Clsd‘𝐽) → 𝑈 𝐽)
1110adantl 482 . . . . . . . . . . . . . . . . . 18 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → 𝑈 𝐽)
12 fndm 5958 . . . . . . . . . . . . . . . . . . . . 21 (𝐹 Fn 𝑋 → dom 𝐹 = 𝑋)
132, 12syl 17 . . . . . . . . . . . . . . . . . . . 20 (𝐽 ∈ (TopOn‘𝑋) → dom 𝐹 = 𝑋)
14 toponuni 20659 . . . . . . . . . . . . . . . . . . . 20 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
1513, 14eqtrd 2655 . . . . . . . . . . . . . . . . . . 19 (𝐽 ∈ (TopOn‘𝑋) → dom 𝐹 = 𝐽)
1615adantr 481 . . . . . . . . . . . . . . . . . 18 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → dom 𝐹 = 𝐽)
1711, 16sseqtr4d 3627 . . . . . . . . . . . . . . . . 17 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → 𝑈 ⊆ dom 𝐹)
1813adantr 481 . . . . . . . . . . . . . . . . 17 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → dom 𝐹 = 𝑋)
1917, 18sseqtrd 3626 . . . . . . . . . . . . . . . 16 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → 𝑈𝑋)
2019adantr 481 . . . . . . . . . . . . . . 15 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → 𝑈𝑋)
21 dfss4 3842 . . . . . . . . . . . . . . 15 (𝑈𝑋 ↔ (𝑋 ∖ (𝑋𝑈)) = 𝑈)
2220, 21sylib 208 . . . . . . . . . . . . . 14 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → (𝑋 ∖ (𝑋𝑈)) = 𝑈)
2322imaeq2d 5435 . . . . . . . . . . . . 13 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → (𝐹 “ (𝑋 ∖ (𝑋𝑈))) = (𝐹𝑈))
2423ineq2d 3798 . . . . . . . . . . . 12 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → ((𝐹 “ (𝑋𝑈)) ∩ (𝐹 “ (𝑋 ∖ (𝑋𝑈)))) = ((𝐹 “ (𝑋𝑈)) ∩ (𝐹𝑈)))
25 simpll 789 . . . . . . . . . . . . 13 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → 𝐽 ∈ (TopOn‘𝑋))
2614adantr 481 . . . . . . . . . . . . . . . 16 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → 𝑋 = 𝐽)
2726difeq1d 3711 . . . . . . . . . . . . . . 15 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝑋𝑈) = ( 𝐽𝑈))
289cldopn 20775 . . . . . . . . . . . . . . . 16 (𝑈 ∈ (Clsd‘𝐽) → ( 𝐽𝑈) ∈ 𝐽)
2928adantl 482 . . . . . . . . . . . . . . 15 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → ( 𝐽𝑈) ∈ 𝐽)
3027, 29eqeltrd 2698 . . . . . . . . . . . . . 14 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝑋𝑈) ∈ 𝐽)
3130adantr 481 . . . . . . . . . . . . 13 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → (𝑋𝑈) ∈ 𝐽)
321kqdisj 21475 . . . . . . . . . . . . 13 ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑋𝑈) ∈ 𝐽) → ((𝐹 “ (𝑋𝑈)) ∩ (𝐹 “ (𝑋 ∖ (𝑋𝑈)))) = ∅)
3325, 31, 32syl2anc 692 . . . . . . . . . . . 12 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → ((𝐹 “ (𝑋𝑈)) ∩ (𝐹 “ (𝑋 ∖ (𝑋𝑈)))) = ∅)
3424, 33eqtr3d 2657 . . . . . . . . . . 11 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → ((𝐹 “ (𝑋𝑈)) ∩ (𝐹𝑈)) = ∅)
358, 34syl5eq 2667 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → ((𝐹𝑈) ∩ (𝐹 “ (𝑋𝑈))) = ∅)
3635eleq2d 2684 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → ((𝐹𝑧) ∈ ((𝐹𝑈) ∩ (𝐹 “ (𝑋𝑈))) ↔ (𝐹𝑧) ∈ ∅))
377, 36syl5bbr 274 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → (((𝐹𝑧) ∈ (𝐹𝑈) ∧ (𝐹𝑧) ∈ (𝐹 “ (𝑋𝑈))) ↔ (𝐹𝑧) ∈ ∅))
386, 37mtbiri 317 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → ¬ ((𝐹𝑧) ∈ (𝐹𝑈) ∧ (𝐹𝑧) ∈ (𝐹 “ (𝑋𝑈))))
39 imnan 438 . . . . . . 7 (((𝐹𝑧) ∈ (𝐹𝑈) → ¬ (𝐹𝑧) ∈ (𝐹 “ (𝑋𝑈))) ↔ ¬ ((𝐹𝑧) ∈ (𝐹𝑈) ∧ (𝐹𝑧) ∈ (𝐹 “ (𝑋𝑈))))
4038, 39sylibr 224 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → ((𝐹𝑧) ∈ (𝐹𝑈) → ¬ (𝐹𝑧) ∈ (𝐹 “ (𝑋𝑈))))
41 eldif 3570 . . . . . . . . . 10 (𝑧 ∈ (𝑋𝑈) ↔ (𝑧𝑋 ∧ ¬ 𝑧𝑈))
4241baibr 944 . . . . . . . . 9 (𝑧𝑋 → (¬ 𝑧𝑈𝑧 ∈ (𝑋𝑈)))
4342adantl 482 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → (¬ 𝑧𝑈𝑧 ∈ (𝑋𝑈)))
44 simpr 477 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → 𝑧𝑋)
451kqfvima 21473 . . . . . . . . 9 ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑋𝑈) ∈ 𝐽𝑧𝑋) → (𝑧 ∈ (𝑋𝑈) ↔ (𝐹𝑧) ∈ (𝐹 “ (𝑋𝑈))))
4625, 31, 44, 45syl3anc 1323 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → (𝑧 ∈ (𝑋𝑈) ↔ (𝐹𝑧) ∈ (𝐹 “ (𝑋𝑈))))
4743, 46bitrd 268 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → (¬ 𝑧𝑈 ↔ (𝐹𝑧) ∈ (𝐹 “ (𝑋𝑈))))
4847con1bid 345 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → (¬ (𝐹𝑧) ∈ (𝐹 “ (𝑋𝑈)) ↔ 𝑧𝑈))
4940, 48sylibd 229 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) ∧ 𝑧𝑋) → ((𝐹𝑧) ∈ (𝐹𝑈) → 𝑧𝑈))
5049expimpd 628 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → ((𝑧𝑋 ∧ (𝐹𝑧) ∈ (𝐹𝑈)) → 𝑧𝑈))
515, 50sylbid 230 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝑧 ∈ (𝐹 “ (𝐹𝑈)) → 𝑧𝑈))
5251ssrdv 3594 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹 “ (𝐹𝑈)) ⊆ 𝑈)
53 sseqin2 3801 . . . 4 (𝑈 ⊆ dom 𝐹 ↔ (dom 𝐹𝑈) = 𝑈)
5417, 53sylib 208 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (dom 𝐹𝑈) = 𝑈)
55 dminss 5516 . . 3 (dom 𝐹𝑈) ⊆ (𝐹 “ (𝐹𝑈))
5654, 55syl6eqssr 3641 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → 𝑈 ⊆ (𝐹 “ (𝐹𝑈)))
5752, 56eqssd 3605 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ (Clsd‘𝐽)) → (𝐹 “ (𝐹𝑈)) = 𝑈)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 384   = wceq 1480  wcel 1987  {crab 2912  cdif 3557  cin 3559  wss 3560  c0 3897   cuni 4409  cmpt 4683  ccnv 5083  dom cdm 5084  cima 5087   Fn wfn 5852  cfv 5857  TopOnctopon 20655  Clsdccld 20760
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-top 20639  df-topon 20656  df-cld 20763
This theorem is referenced by:  kqcld  21478
  Copyright terms: Public domain W3C validator