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

Theorem istmd 21688
 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 3758 . . 3 (𝐺 ∈ (Mnd ∩ TopSp) ↔ (𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp))
21anbi1i 727 . 2 ((𝐺 ∈ (Mnd ∩ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) ↔ ((𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
3 fvex 6113 . . . . 5 (TopOpen‘𝑓) ∈ V
43a1i 11 . . . 4 (𝑓 = 𝐺 → (TopOpen‘𝑓) ∈ V)
5 simpl 472 . . . . . . 7 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → 𝑓 = 𝐺)
65fveq2d 6107 . . . . . 6 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → (+𝑓𝑓) = (+𝑓𝐺))
7 istmd.1 . . . . . 6 𝐹 = (+𝑓𝐺)
86, 7syl6eqr 2662 . . . . 5 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → (+𝑓𝑓) = 𝐹)
9 id 22 . . . . . . . 8 (𝑗 = (TopOpen‘𝑓) → 𝑗 = (TopOpen‘𝑓))
10 fveq2 6103 . . . . . . . . 9 (𝑓 = 𝐺 → (TopOpen‘𝑓) = (TopOpen‘𝐺))
11 istmd.2 . . . . . . . . 9 𝐽 = (TopOpen‘𝐺)
1210, 11syl6eqr 2662 . . . . . . . 8 (𝑓 = 𝐺 → (TopOpen‘𝑓) = 𝐽)
139, 12sylan9eqr 2666 . . . . . . 7 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → 𝑗 = 𝐽)
1413, 13oveq12d 6567 . . . . . 6 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → (𝑗 ×t 𝑗) = (𝐽 ×t 𝐽))
1514, 13oveq12d 6567 . . . . 5 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → ((𝑗 ×t 𝑗) Cn 𝑗) = ((𝐽 ×t 𝐽) Cn 𝐽))
168, 15eleq12d 2682 . . . 4 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → ((+𝑓𝑓) ∈ ((𝑗 ×t 𝑗) Cn 𝑗) ↔ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
174, 16sbcied 3439 . . 3 (𝑓 = 𝐺 → ([(TopOpen‘𝑓) / 𝑗](+𝑓𝑓) ∈ ((𝑗 ×t 𝑗) Cn 𝑗) ↔ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
18 df-tmd 21686 . . 3 TopMnd = {𝑓 ∈ (Mnd ∩ TopSp) ∣ [(TopOpen‘𝑓) / 𝑗](+𝑓𝑓) ∈ ((𝑗 ×t 𝑗) Cn 𝑗)}
1917, 18elrab2 3333 . 2 (𝐺 ∈ TopMnd ↔ (𝐺 ∈ (Mnd ∩ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
20 df-3an 1033 . 2 ((𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) ↔ ((𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
212, 19, 203bitr4i 291 1 (𝐺 ∈ TopMnd ↔ (𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 195   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977  Vcvv 3173  [wsbc 3402   ∩ cin 3539  ‘cfv 5804  (class class class)co 6549  TopOpenctopn 15905  +𝑓cplusf 17062  Mndcmnd 17117  TopSpctps 20519   Cn ccn 20838   ×t ctx 21173  TopMndctmd 21684 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-nul 4717 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-iota 5768  df-fv 5812  df-ov 6552  df-tmd 21686 This theorem is referenced by:  tmdmnd  21689  tmdtps  21690  tmdcn  21697  istgp2  21705  oppgtmd  21711  symgtgp  21715  submtmd  21718  prdstmdd  21737  nrgtrg  22304  mhmhmeotmd  29301  xrge0tmdOLD  29319
 Copyright terms: Public domain W3C validator