Theorem tmdcn 24414

Description: In a topological monoid, the operation 𝐹 representing the functionalization of the operator slot +_g is continuous. (Contributed by Mario Carneiro, 19-Sep-2015.)

Hypotheses

Ref	Expression
tgpcn.j	⊢ 𝐽 = (TopOpen‘𝐺)
tgpcn.1	⊢ 𝐹 = (+𝑓‘𝐺)

Assertion

Ref	Expression
tmdcn	⊢ (𝐺 ∈ TopMnd → 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))

Proof of Theorem tmdcn

Step	Hyp	Ref	Expression
1		tgpcn.1	. . 3 ⊢ 𝐹 = (+𝑓‘𝐺)
2		tgpcn.j	. . 3 ⊢ 𝐽 = (TopOpen‘𝐺)
3	1, 2	istmd 24405	. 2 ⊢ (𝐺 ∈ TopMnd ↔ (𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
4	3	simp3bi 1165	1 ⊢ (𝐺 ∈ TopMnd → 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2146  ‘cfv 6546  (class class class)co 7427  TopOpenctopn 17604  +_𝑓cplusf 18825  Mndcmnd 18935  TopSpctps 23262   Cn ccn 23554   ×_t ctx 23891  TopMndctmd 24401

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-nul 5262

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-iota 6500  df-fv 6554  df-ov 7430  df-tmd 24403

This theorem is used by:  tgpcn  24415  cnmpt1plusg  24418  cnmpt2plusg  24419  tmdcn2  24420  submtmd  24435  tsmsadd  24478  mulrcn  24510  mhmhmeotmd  34612  xrge0pluscn  34625