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

Theorem tmdcn2 22065
Description: Write out the definition of continuity of +g explicitly. (Contributed by Mario Carneiro, 20-Sep-2015.)
Hypotheses
Ref Expression
tmdcn2.1 𝐵 = (Base‘𝐺)
tmdcn2.2 𝐽 = (TopOpen‘𝐺)
tmdcn2.3 + = (+g𝐺)
Assertion
Ref Expression
tmdcn2 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → ∃𝑢𝐽𝑣𝐽 (𝑋𝑢𝑌𝑣 ∧ ∀𝑥𝑢𝑦𝑣 (𝑥 + 𝑦) ∈ 𝑈))
Distinct variable groups:   𝑣,𝑢,𝑥,𝑦,𝐺   𝑢,𝐽,𝑣   𝑢,𝑈,𝑣,𝑥,𝑦   𝑢,𝑋,𝑣   𝑢,𝑌,𝑣
Allowed substitution hints:   𝐵(𝑥,𝑦,𝑣,𝑢)   + (𝑥,𝑦,𝑣,𝑢)   𝐽(𝑥,𝑦)   𝑋(𝑥,𝑦)   𝑌(𝑥,𝑦)

Proof of Theorem tmdcn2
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 tmdcn2.2 . . . . 5 𝐽 = (TopOpen‘𝐺)
2 tmdcn2.1 . . . . 5 𝐵 = (Base‘𝐺)
31, 2tmdtopon 22057 . . . 4 (𝐺 ∈ TopMnd → 𝐽 ∈ (TopOn‘𝐵))
43ad2antrr 764 . . 3 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → 𝐽 ∈ (TopOn‘𝐵))
5 eqid 2748 . . . . . 6 (+𝑓𝐺) = (+𝑓𝐺)
61, 5tmdcn 22059 . . . . 5 (𝐺 ∈ TopMnd → (+𝑓𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
76ad2antrr 764 . . . 4 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (+𝑓𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
8 simpr1 1210 . . . . . 6 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → 𝑋𝐵)
9 simpr2 1212 . . . . . 6 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → 𝑌𝐵)
10 opelxpi 5293 . . . . . 6 ((𝑋𝐵𝑌𝐵) → ⟨𝑋, 𝑌⟩ ∈ (𝐵 × 𝐵))
118, 9, 10syl2anc 696 . . . . 5 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → ⟨𝑋, 𝑌⟩ ∈ (𝐵 × 𝐵))
12 txtopon 21567 . . . . . . 7 ((𝐽 ∈ (TopOn‘𝐵) ∧ 𝐽 ∈ (TopOn‘𝐵)) → (𝐽 ×t 𝐽) ∈ (TopOn‘(𝐵 × 𝐵)))
134, 4, 12syl2anc 696 . . . . . 6 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (𝐽 ×t 𝐽) ∈ (TopOn‘(𝐵 × 𝐵)))
14 toponuni 20892 . . . . . 6 ((𝐽 ×t 𝐽) ∈ (TopOn‘(𝐵 × 𝐵)) → (𝐵 × 𝐵) = (𝐽 ×t 𝐽))
1513, 14syl 17 . . . . 5 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (𝐵 × 𝐵) = (𝐽 ×t 𝐽))
1611, 15eleqtrd 2829 . . . 4 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → ⟨𝑋, 𝑌⟩ ∈ (𝐽 ×t 𝐽))
17 eqid 2748 . . . . 5 (𝐽 ×t 𝐽) = (𝐽 ×t 𝐽)
1817cncnpi 21255 . . . 4 (((+𝑓𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽) ∧ ⟨𝑋, 𝑌⟩ ∈ (𝐽 ×t 𝐽)) → (+𝑓𝐺) ∈ (((𝐽 ×t 𝐽) CnP 𝐽)‘⟨𝑋, 𝑌⟩))
197, 16, 18syl2anc 696 . . 3 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (+𝑓𝐺) ∈ (((𝐽 ×t 𝐽) CnP 𝐽)‘⟨𝑋, 𝑌⟩))
20 simplr 809 . . 3 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → 𝑈𝐽)
21 tmdcn2.3 . . . . . 6 + = (+g𝐺)
222, 21, 5plusfval 17420 . . . . 5 ((𝑋𝐵𝑌𝐵) → (𝑋(+𝑓𝐺)𝑌) = (𝑋 + 𝑌))
238, 9, 22syl2anc 696 . . . 4 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (𝑋(+𝑓𝐺)𝑌) = (𝑋 + 𝑌))
24 simpr3 1214 . . . 4 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (𝑋 + 𝑌) ∈ 𝑈)
2523, 24eqeltrd 2827 . . 3 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → (𝑋(+𝑓𝐺)𝑌) ∈ 𝑈)
264, 4, 19, 20, 8, 9, 25txcnpi 21584 . 2 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → ∃𝑢𝐽𝑣𝐽 (𝑋𝑢𝑌𝑣 ∧ (𝑢 × 𝑣) ⊆ ((+𝑓𝐺) “ 𝑈)))
27 dfss3 3721 . . . . . . 7 ((𝑢 × 𝑣) ⊆ ((+𝑓𝐺) “ 𝑈) ↔ ∀𝑧 ∈ (𝑢 × 𝑣)𝑧 ∈ ((+𝑓𝐺) “ 𝑈))
28 eleq1 2815 . . . . . . . . 9 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ ((+𝑓𝐺) “ 𝑈) ↔ ⟨𝑥, 𝑦⟩ ∈ ((+𝑓𝐺) “ 𝑈)))
292, 5plusffn 17422 . . . . . . . . . 10 (+𝑓𝐺) Fn (𝐵 × 𝐵)
30 elpreima 6488 . . . . . . . . . 10 ((+𝑓𝐺) Fn (𝐵 × 𝐵) → (⟨𝑥, 𝑦⟩ ∈ ((+𝑓𝐺) “ 𝑈) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈)))
3129, 30ax-mp 5 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ ((+𝑓𝐺) “ 𝑈) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈))
3228, 31syl6bb 276 . . . . . . . 8 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ ((+𝑓𝐺) “ 𝑈) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈)))
3332ralxp 5407 . . . . . . 7 (∀𝑧 ∈ (𝑢 × 𝑣)𝑧 ∈ ((+𝑓𝐺) “ 𝑈) ↔ ∀𝑥𝑢𝑦𝑣 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈))
3427, 33bitri 264 . . . . . 6 ((𝑢 × 𝑣) ⊆ ((+𝑓𝐺) “ 𝑈) ↔ ∀𝑥𝑢𝑦𝑣 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈))
35 opelxp 5291 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ↔ (𝑥𝐵𝑦𝐵))
36 df-ov 6804 . . . . . . . . . . 11 (𝑥(+𝑓𝐺)𝑦) = ((+𝑓𝐺)‘⟨𝑥, 𝑦⟩)
372, 21, 5plusfval 17420 . . . . . . . . . . 11 ((𝑥𝐵𝑦𝐵) → (𝑥(+𝑓𝐺)𝑦) = (𝑥 + 𝑦))
3836, 37syl5eqr 2796 . . . . . . . . . 10 ((𝑥𝐵𝑦𝐵) → ((+𝑓𝐺)‘⟨𝑥, 𝑦⟩) = (𝑥 + 𝑦))
3935, 38sylbi 207 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) → ((+𝑓𝐺)‘⟨𝑥, 𝑦⟩) = (𝑥 + 𝑦))
4039eleq1d 2812 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) → (((+𝑓𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈 ↔ (𝑥 + 𝑦) ∈ 𝑈))
4140biimpa 502 . . . . . . 7 ((⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈) → (𝑥 + 𝑦) ∈ 𝑈)
42412ralimi 3079 . . . . . 6 (∀𝑥𝑢𝑦𝑣 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ∧ ((+𝑓𝐺)‘⟨𝑥, 𝑦⟩) ∈ 𝑈) → ∀𝑥𝑢𝑦𝑣 (𝑥 + 𝑦) ∈ 𝑈)
4334, 42sylbi 207 . . . . 5 ((𝑢 × 𝑣) ⊆ ((+𝑓𝐺) “ 𝑈) → ∀𝑥𝑢𝑦𝑣 (𝑥 + 𝑦) ∈ 𝑈)
44433anim3i 1411 . . . 4 ((𝑋𝑢𝑌𝑣 ∧ (𝑢 × 𝑣) ⊆ ((+𝑓𝐺) “ 𝑈)) → (𝑋𝑢𝑌𝑣 ∧ ∀𝑥𝑢𝑦𝑣 (𝑥 + 𝑦) ∈ 𝑈))
4544reximi 3137 . . 3 (∃𝑣𝐽 (𝑋𝑢𝑌𝑣 ∧ (𝑢 × 𝑣) ⊆ ((+𝑓𝐺) “ 𝑈)) → ∃𝑣𝐽 (𝑋𝑢𝑌𝑣 ∧ ∀𝑥𝑢𝑦𝑣 (𝑥 + 𝑦) ∈ 𝑈))
4645reximi 3137 . 2 (∃𝑢𝐽𝑣𝐽 (𝑋𝑢𝑌𝑣 ∧ (𝑢 × 𝑣) ⊆ ((+𝑓𝐺) “ 𝑈)) → ∃𝑢𝐽𝑣𝐽 (𝑋𝑢𝑌𝑣 ∧ ∀𝑥𝑢𝑦𝑣 (𝑥 + 𝑦) ∈ 𝑈))
4726, 46syl 17 1 (((𝐺 ∈ TopMnd ∧ 𝑈𝐽) ∧ (𝑋𝐵𝑌𝐵 ∧ (𝑋 + 𝑌) ∈ 𝑈)) → ∃𝑢𝐽𝑣𝐽 (𝑋𝑢𝑌𝑣 ∧ ∀𝑥𝑢𝑦𝑣 (𝑥 + 𝑦) ∈ 𝑈))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383  w3a 1072   = wceq 1620  wcel 2127  wral 3038  wrex 3039  wss 3703  cop 4315   cuni 4576   × cxp 5252  ccnv 5253  cima 5257   Fn wfn 6032  cfv 6037  (class class class)co 6801  Basecbs 16030  +gcplusg 16114  TopOpenctopn 16255  +𝑓cplusf 17411  TopOnctopon 20888   Cn ccn 21201   CnP ccnp 21202   ×t ctx 21536  TopMndctmd 22046
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1859  ax-4 1874  ax-5 1976  ax-6 2042  ax-7 2078  ax-8 2129  ax-9 2136  ax-10 2156  ax-11 2171  ax-12 2184  ax-13 2379  ax-ext 2728  ax-sep 4921  ax-nul 4929  ax-pow 4980  ax-pr 5043  ax-un 7102
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1623  df-ex 1842  df-nf 1847  df-sb 2035  df-eu 2599  df-mo 2600  df-clab 2735  df-cleq 2741  df-clel 2744  df-nfc 2879  df-ne 2921  df-ral 3043  df-rex 3044  df-rab 3047  df-v 3330  df-sbc 3565  df-csb 3663  df-dif 3706  df-un 3708  df-in 3710  df-ss 3717  df-nul 4047  df-if 4219  df-pw 4292  df-sn 4310  df-pr 4312  df-op 4316  df-uni 4577  df-iun 4662  df-br 4793  df-opab 4853  df-mpt 4870  df-id 5162  df-xp 5260  df-rel 5261  df-cnv 5262  df-co 5263  df-dm 5264  df-rn 5265  df-res 5266  df-ima 5267  df-iota 6000  df-fun 6039  df-fn 6040  df-f 6041  df-fv 6045  df-ov 6804  df-oprab 6805  df-mpt2 6806  df-1st 7321  df-2nd 7322  df-map 8013  df-topgen 16277  df-plusf 17413  df-top 20872  df-topon 20889  df-topsp 20910  df-bases 20923  df-cn 21204  df-cnp 21205  df-tx 21538  df-tmd 22048
This theorem is referenced by:  tsmsxp  22130
  Copyright terms: Public domain W3C validator