Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  hauseqcn Structured version   Visualization version   GIF version

Theorem hauseqcn 34641
Description: In a Hausdorff topology, two continuous functions which agree on a dense set agree everywhere. (Contributed by Thierry Arnoux, 28-Dec-2017.)
Hypotheses
Ref Expression
hauseqcn.x 𝑋 = ∪ 𝐽
hauseqcn.k (𝜑 → 𝐾 ∈ Haus)
hauseqcn.f (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
hauseqcn.g (𝜑 → 𝐺 ∈ (𝐽 Cn 𝐾))
hauseqcn.e (𝜑 → (𝐹 ↾ 𝐴) = (𝐺 ↾ 𝐴))
hauseqcn.a (𝜑 → 𝐴 ⊆ 𝑋)
hauseqcn.c (𝜑 → ((cls‘𝐽)‘𝐴) = 𝑋)
Assertion
Ref Expression
hauseqcn (𝜑 → 𝐹 = 𝐺)

Proof of Theorem hauseqcn
StepHypRef Expression
1 hauseqcn.x . . 3 𝑋 = ∪ 𝐽
2 hauseqcn.f . . . . . 6 (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
3 cntop1 23613 . . . . . 6 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
42, 3syl 18 . . . . 5 (𝜑 → 𝐽 ∈ Top)
5 dmin 5905 . . . . . 6 dom (𝐹 ∩ 𝐺) ⊆ (dom 𝐹 ∩ dom 𝐺)
6 eqid 2763 . . . . . . . . . 10 ∪ 𝐽 = ∪ 𝐽
7 eqid 2763 . . . . . . . . . 10 ∪ 𝐾 = ∪ 𝐾
86, 7cnf 23619 . . . . . . . . 9 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐹:∪ 𝐽⟶∪ 𝐾)
9 fdm 6749 . . . . . . . . 9 (𝐹:∪ 𝐽⟶∪ 𝐾 → dom 𝐹 = ∪ 𝐽)
102, 8, 93syl 19 . . . . . . . 8 (𝜑 → dom 𝐹 = ∪ 𝐽)
11 hauseqcn.g . . . . . . . . 9 (𝜑 → 𝐺 ∈ (𝐽 Cn 𝐾))
126, 7cnf 23619 . . . . . . . . 9 (𝐺 ∈ (𝐽 Cn 𝐾) → 𝐺:∪ 𝐽⟶∪ 𝐾)
13 fdm 6749 . . . . . . . . 9 (𝐺:∪ 𝐽⟶∪ 𝐾 → dom 𝐺 = ∪ 𝐽)
1411, 12, 133syl 19 . . . . . . . 8 (𝜑 → dom 𝐺 = ∪ 𝐽)
1510, 14ineq12d 4121 . . . . . . 7 (𝜑 → (dom 𝐹 ∩ dom 𝐺) = (∪ 𝐽 ∩ ∪ 𝐽))
16 inidm 4126 . . . . . . 7 (∪ 𝐽 ∩ ∪ 𝐽) = ∪ 𝐽
1715, 16eqtrdi 2814 . . . . . 6 (𝜑 → (dom 𝐹 ∩ dom 𝐺) = ∪ 𝐽)
185, 17sseqtrid 3955 . . . . 5 (𝜑 → dom (𝐹 ∩ 𝐺) ⊆ ∪ 𝐽)
19 hauseqcn.e . . . . . 6 (𝜑 → (𝐹 ↾ 𝐴) = (𝐺 ↾ 𝐴))
20 ffn 6739 . . . . . . . 8 (𝐹:∪ 𝐽⟶∪ 𝐾 → 𝐹 Fn ∪ 𝐽)
212, 8, 203syl 19 . . . . . . 7 (𝜑 → 𝐹 Fn ∪ 𝐽)
22 ffn 6739 . . . . . . . 8 (𝐺:∪ 𝐽⟶∪ 𝐾 → 𝐺 Fn ∪ 𝐽)
2311, 12, 223syl 19 . . . . . . 7 (𝜑 → 𝐺 Fn ∪ 𝐽)
24 hauseqcn.a . . . . . . . 8 (𝜑 → 𝐴 ⊆ 𝑋)
2524, 1sseqtrdi 3953 . . . . . . 7 (𝜑 → 𝐴 ⊆ ∪ 𝐽)
26 fnreseql 7078 . . . . . . 7 ((𝐹 Fn ∪ 𝐽 ∧ 𝐺 Fn ∪ 𝐽 ∧ 𝐴 ⊆ ∪ 𝐽) → ((𝐹 ↾ 𝐴) = (𝐺 ↾ 𝐴) ↔ 𝐴 ⊆ dom (𝐹 ∩ 𝐺)))
2721, 23, 25, 26syl3anc 1399 . . . . . 6 (𝜑 → ((𝐹 ↾ 𝐴) = (𝐺 ↾ 𝐴) ↔ 𝐴 ⊆ dom (𝐹 ∩ 𝐺)))
2819, 27mpbid 235 . . . . 5 (𝜑 → 𝐴 ⊆ dom (𝐹 ∩ 𝐺))
296clsss 23427 . . . . 5 ((𝐽 ∈ Top ∧ dom (𝐹 ∩ 𝐺) ⊆ ∪ 𝐽 ∧ 𝐴 ⊆ dom (𝐹 ∩ 𝐺)) → ((cls‘𝐽)‘𝐴) ⊆ ((cls‘𝐽)‘dom (𝐹 ∩ 𝐺)))
304, 18, 28, 29syl3anc 1399 . . . 4 (𝜑 → ((cls‘𝐽)‘𝐴) ⊆ ((cls‘𝐽)‘dom (𝐹 ∩ 𝐺)))
31 hauseqcn.c . . . 4 (𝜑 → ((cls‘𝐽)‘𝐴) = 𝑋)
32 hauseqcn.k . . . . . 6 (𝜑 → 𝐾 ∈ Haus)
3332, 2, 11hauseqlcld 24020 . . . . 5 (𝜑 → dom (𝐹 ∩ 𝐺) ∈ (Clsd‘𝐽))
34 cldcls 23415 . . . . 5 (dom (𝐹 ∩ 𝐺) ∈ (Clsd‘𝐽) → ((cls‘𝐽)‘dom (𝐹 ∩ 𝐺)) = dom (𝐹 ∩ 𝐺))
3533, 34syl 18 . . . 4 (𝜑 → ((cls‘𝐽)‘dom (𝐹 ∩ 𝐺)) = dom (𝐹 ∩ 𝐺))
3630, 31, 353sstr3d 3967 . . 3 (𝜑 → 𝑋 ⊆ dom (𝐹 ∩ 𝐺))
371, 36eqsstrrid 3952 . 2 (𝜑 → ∪ 𝐽 ⊆ dom (𝐹 ∩ 𝐺))
38 fneqeql2 7077 . . 3 ((𝐹 Fn ∪ 𝐽 ∧ 𝐺 Fn ∪ 𝐽) → (𝐹 = 𝐺 ↔ ∪ 𝐽 ⊆ dom (𝐹 ∩ 𝐺)))
3921, 23, 38syl2anc 596 . 2 (𝜑 → (𝐹 = 𝐺 ↔ ∪ 𝐽 ⊆ dom (𝐹 ∩ 𝐺)))
4037, 39mpbird 260 1 (𝜑 → 𝐹 = 𝐺)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ∩ cin 4092  ∪ cuni 4872  dom cdm 5658   ↾ cres 5660   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  Topctop 23266  Clsdccld 23389  clsccl 23391   Cn ccn 23597  Hauscha 23681
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-map 8887  df-topgen 17664  df-top 23267  df-topon 23284  df-bases 23319  df-cld 23392  df-cls 23394  df-cn 23600  df-haus 23688  df-tx 23936
This theorem is used by:  rrhre  34764
  Copyright terms: Public domain W3C validator