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 4168 | . . 3 ⊢ (𝐺 ∈ (Mnd ∩ TopSp) ↔ (𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp)) | |
2 | 1 | anbi1i 625 | . 2 ⊢ ((𝐺 ∈ (Mnd ∩ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) ↔ ((𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))) |
3 | fvexd 6684 | . . . 4 ⊢ (𝑓 = 𝐺 → (TopOpen‘𝑓) ∈ V) | |
4 | simpl 485 | . . . . . . 7 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → 𝑓 = 𝐺) | |
5 | 4 | fveq2d 6673 | . . . . . 6 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (+𝑓‘𝑓) = (+𝑓‘𝐺)) |
6 | istmd.1 | . . . . . 6 ⊢ 𝐹 = (+𝑓‘𝐺) | |
7 | 5, 6 | syl6eqr 2874 | . . . . 5 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (+𝑓‘𝑓) = 𝐹) |
8 | id 22 | . . . . . . . 8 ⊢ (𝑗 = (TopOpen‘𝑓) → 𝑗 = (TopOpen‘𝑓)) | |
9 | fveq2 6669 | . . . . . . . . 9 ⊢ (𝑓 = 𝐺 → (TopOpen‘𝑓) = (TopOpen‘𝐺)) | |
10 | istmd.2 | . . . . . . . . 9 ⊢ 𝐽 = (TopOpen‘𝐺) | |
11 | 9, 10 | syl6eqr 2874 | . . . . . . . 8 ⊢ (𝑓 = 𝐺 → (TopOpen‘𝑓) = 𝐽) |
12 | 8, 11 | sylan9eqr 2878 | . . . . . . 7 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → 𝑗 = 𝐽) |
13 | 12, 12 | oveq12d 7173 | . . . . . 6 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (𝑗 ×t 𝑗) = (𝐽 ×t 𝐽)) |
14 | 13, 12 | oveq12d 7173 | . . . . 5 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → ((𝑗 ×t 𝑗) Cn 𝑗) = ((𝐽 ×t 𝐽) Cn 𝐽)) |
15 | 7, 14 | eleq12d 2907 | . . . 4 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → ((+𝑓‘𝑓) ∈ ((𝑗 ×t 𝑗) Cn 𝑗) ↔ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))) |
16 | 3, 15 | sbcied 3813 | . . 3 ⊢ (𝑓 = 𝐺 → ([(TopOpen‘𝑓) / 𝑗](+𝑓‘𝑓) ∈ ((𝑗 ×t 𝑗) Cn 𝑗) ↔ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))) |
17 | df-tmd 22679 | . . 3 ⊢ TopMnd = {𝑓 ∈ (Mnd ∩ TopSp) ∣ [(TopOpen‘𝑓) / 𝑗](+𝑓‘𝑓) ∈ ((𝑗 ×t 𝑗) Cn 𝑗)} | |
18 | 16, 17 | elrab2 3682 | . 2 ⊢ (𝐺 ∈ TopMnd ↔ (𝐺 ∈ (Mnd ∩ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))) |
19 | df-3an 1085 | . 2 ⊢ ((𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) ↔ ((𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp) ∧ 𝐹 ∈ ((𝐽 ×t 𝐽) Cn 𝐽))) | |
20 | 2, 18, 19 | 3bitr4i 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 6354 (class class class)co 7155 TopOpenctopn 16694 +𝑓cplusf 17848 Mndcmnd 17910 TopSpctps 21539 Cn ccn 21831 ×t ctx 22167 TopMndctmd 22677 |
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 5209 |
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 4567 df-pr 4569 df-op 4573 df-uni 4838 df-br 5066 df-iota 6313 df-fv 6362 df-ov 7158 df-tmd 22679 |
This theorem is referenced by: tmdmnd 22682 tmdtps 22683 tmdcn 22690 istgp2 22698 oppgtmd 22704 efmndtmd 22708 submtmd 22711 prdstmdd 22731 nrgtrg 23298 mhmhmeotmd 31170 xrge0tmdALT 31189 |
Copyright terms: Public domain | W3C validator |