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

Theorem istmd 22676
 Description: The predicate "is a topological monoid". (Contributed by Mario Carneiro, 19-Sep-2015.)
Hypotheses
Ref Expression
istmd.1 𝐹 = (+𝑓𝐺)
istmd.2 𝐽 = (TopOpen‘𝐺)
Assertion
Ref Expression
istmd (𝐺 ∈ TopMnd ↔ (𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))

Proof of Theorem istmd
Dummy variables 𝑓 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elin 4168 . . 3 (𝐺 ∈ (Mnd ∩ TopSp) ↔ (𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp))
21anbi1i 625 . 2 ((𝐺 ∈ (Mnd ∩ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) ↔ ((𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
3 fvexd 6679 . . . 4 (𝑓 = 𝐺 → (TopOpen‘𝑓) ∈ V)
4 simpl 485 . . . . . . 7 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → 𝑓 = 𝐺)
54fveq2d 6668 . . . . . 6 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → (+𝑓𝑓) = (+𝑓𝐺))
6 istmd.1 . . . . . 6 𝐹 = (+𝑓𝐺)
75, 6syl6eqr 2874 . . . . 5 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → (+𝑓𝑓) = 𝐹)
8 id 22 . . . . . . . 8 (𝑗 = (TopOpen‘𝑓) → 𝑗 = (TopOpen‘𝑓))
9 fveq2 6664 . . . . . . . . 9 (𝑓 = 𝐺 → (TopOpen‘𝑓) = (TopOpen‘𝐺))
10 istmd.2 . . . . . . . . 9 𝐽 = (TopOpen‘𝐺)
119, 10syl6eqr 2874 . . . . . . . 8 (𝑓 = 𝐺 → (TopOpen‘𝑓) = 𝐽)
128, 11sylan9eqr 2878 . . . . . . 7 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → 𝑗 = 𝐽)
1312, 12oveq12d 7168 . . . . . 6 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → (𝑗 ×t 𝑗) = (𝐽 ×t 𝐽))
1413, 12oveq12d 7168 . . . . 5 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → ((𝑗 ×t 𝑗) Cn 𝑗) = ((𝐽 ×t 𝐽) Cn 𝐽))
157, 14eleq12d 2907 . . . 4 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → ((+𝑓𝑓) ∈ ((𝑗 ×t 𝑗) Cn 𝑗) ↔ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
163, 15sbcied 3813 . . 3 (𝑓 = 𝐺 → ([(TopOpen‘𝑓) / 𝑗](+𝑓𝑓) ∈ ((𝑗 ×t 𝑗) Cn 𝑗) ↔ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
17 df-tmd 22674 . . 3 TopMnd = {𝑓 ∈ (Mnd ∩ TopSp) ∣ [(TopOpen‘𝑓) / 𝑗](+𝑓𝑓) ∈ ((𝑗 ×t 𝑗) Cn 𝑗)}
1816, 17elrab2 3682 . 2 (𝐺 ∈ TopMnd ↔ (𝐺 ∈ (Mnd ∩ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
19 df-3an 1085 . 2 ((𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) ↔ ((𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
202, 18, 193bitr4i 305 1 (𝐺 ∈ TopMnd ↔ (𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1533   ∈ wcel 2110  Vcvv 3494  [wsbc 3771   ∩ cin 3934  ‘cfv 6349  (class class class)co 7150  TopOpenctopn 16689  +𝑓cplusf 17843  Mndcmnd 17905  TopSpctps 21534   Cn ccn 21826   ×t ctx 22162  TopMndctmd 22672 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-nul 5202 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-iota 6308  df-fv 6357  df-ov 7153  df-tmd 22674 This theorem is referenced by:  tmdmnd  22677  tmdtps  22678  tmdcn  22685  istgp2  22693  oppgtmd  22699  efmndtmd  22703  submtmd  22706  prdstmdd  22726  nrgtrg  23293  mhmhmeotmd  31165  xrge0tmdALT  31184
 Copyright terms: Public domain W3C validator