![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > istmd | Structured version Visualization version GIF version |
Description: The predicate "is a topological monoid". (Contributed by Mario Carneiro, 19-Sep-2015.) |
Ref | Expression |
---|---|
istmd.1 | ⊢ 𝐹 = (+𝑓‘𝐺) |
istmd.2 | ⊢ 𝐽 = (TopOpen‘𝐺) |
Ref | Expression |
---|---|
istmd | ⊢ (𝐺 ∈ TopMnd ↔ (𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elin 3897 | . . 3 ⊢ (𝐺 ∈ (Mnd ∩ TopSp) ↔ (𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp)) | |
2 | 1 | anbi1i 626 | . 2 ⊢ ((𝐺 ∈ (Mnd ∩ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) ↔ ((𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))) |
3 | fvexd 6660 | . . . 4 ⊢ (𝑓 = 𝐺 → (TopOpen‘𝑓) ∈ V) | |
4 | simpl 486 | . . . . . . 7 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → 𝑓 = 𝐺) | |
5 | 4 | fveq2d 6649 | . . . . . 6 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (+𝑓‘𝑓) = (+𝑓‘𝐺)) |
6 | istmd.1 | . . . . . 6 ⊢ 𝐹 = (+𝑓‘𝐺) | |
7 | 5, 6 | eqtr4di 2851 | . . . . 5 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (+𝑓‘𝑓) = 𝐹) |
8 | id 22 | . . . . . . . 8 ⊢ (𝑗 = (TopOpen‘𝑓) → 𝑗 = (TopOpen‘𝑓)) | |
9 | fveq2 6645 | . . . . . . . . 9 ⊢ (𝑓 = 𝐺 → (TopOpen‘𝑓) = (TopOpen‘𝐺)) | |
10 | istmd.2 | . . . . . . . . 9 ⊢ 𝐽 = (TopOpen‘𝐺) | |
11 | 9, 10 | eqtr4di 2851 | . . . . . . . 8 ⊢ (𝑓 = 𝐺 → (TopOpen‘𝑓) = 𝐽) |
12 | 8, 11 | sylan9eqr 2855 | . . . . . . 7 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → 𝑗 = 𝐽) |
13 | 12, 12 | oveq12d 7153 | . . . . . 6 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (𝑗 ×t 𝑗) = (𝐽 ×t 𝐽)) |
14 | 13, 12 | oveq12d 7153 | . . . . 5 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → ((𝑗 ×t 𝑗) Cn 𝑗) = ((𝐽 ×t 𝐽) Cn 𝐽)) |
15 | 7, 14 | eleq12d 2884 | . . . 4 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → ((+𝑓‘𝑓) ∈ ((𝑗 ×t 𝑗) Cn 𝑗) ↔ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))) |
16 | 3, 15 | sbcied 3762 | . . 3 ⊢ (𝑓 = 𝐺 → ([(TopOpen‘𝑓) / 𝑗](+𝑓‘𝑓) ∈ ((𝑗 ×t 𝑗) Cn 𝑗) ↔ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))) |
17 | df-tmd 22677 | . . 3 ⊢ TopMnd = {𝑓 ∈ (Mnd ∩ TopSp) ∣ [(TopOpen‘𝑓) / 𝑗](+𝑓‘𝑓) ∈ ((𝑗 ×t 𝑗) Cn 𝑗)} | |
18 | 16, 17 | elrab2 3631 | . 2 ⊢ (𝐺 ∈ TopMnd ↔ (𝐺 ∈ (Mnd ∩ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))) |
19 | df-3an 1086 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) ↔ ((𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))) | |
20 | 2, 18, 19 | 3bitr4i 306 | 1 ⊢ (𝐺 ∈ TopMnd ↔ (𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 Vcvv 3441 [wsbc 3720 ∩ cin 3880 ‘cfv 6324 (class class class)co 7135 TopOpenctopn 16687 +𝑓cplusf 17841 Mndcmnd 17903 TopSpctps 21537 Cn ccn 21829 ×t ctx 22165 TopMndctmd 22675 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-nul 5174 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-iota 6283 df-fv 6332 df-ov 7138 df-tmd 22677 |
This theorem is referenced by: tmdmnd 22680 tmdtps 22681 tmdcn 22688 istgp2 22696 oppgtmd 22702 efmndtmd 22706 submtmd 22709 prdstmdd 22729 nrgtrg 23296 mhmhmeotmd 31280 xrge0tmdALT 31299 |
Copyright terms: Public domain | W3C validator |