| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > istgp | Structured version Visualization version GIF version | ||
| Description: The predicate "is a topological group". Definition 1 of [BourbakiTop1] p. III.1. (Contributed by FL, 18-Apr-2010.) (Revised by Mario Carneiro, 13-Aug-2015.) |
| Ref | Expression |
|---|---|
| istgp.1 | ⊢ 𝐽 = (TopOpen‘𝐺) |
| istgp.2 | ⊢ 𝐼 = (invg‘𝐺) |
| Ref | Expression |
|---|---|
| istgp | ⊢ (𝐺 ∈ TopGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd ∧ 𝐼 ∈ (𝐽 Cn 𝐽))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elin 3915 | . . 3 ⊢ (𝐺 ∈ (Grp ∩ TopMnd) ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd)) | |
| 2 | 1 | anbi1i 636 | . 2 ⊢ ((𝐺 ∈ (Grp ∩ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽)) ↔ ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽))) |
| 3 | fvexd 6889 | . . . 4 ⊢ (𝑓 = 𝐺 → (TopOpen‘𝑓) ∈ V) | |
| 4 | simpl 488 | . . . . . . 7 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → 𝑓 = 𝐺) | |
| 5 | 4 | fveq2d 6878 | . . . . . 6 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (invg‘𝑓) = (invg‘𝐺)) |
| 6 | istgp.2 | . . . . . 6 ⊢ 𝐼 = (invg‘𝐺) | |
| 7 | 5, 6 | eqtr4di 2813 | . . . . 5 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (invg‘𝑓) = 𝐼) |
| 8 | id 23 | . . . . . . 7 ⊢ (𝑗 = (TopOpen‘𝑓) → 𝑗 = (TopOpen‘𝑓)) | |
| 9 | fveq2 6874 | . . . . . . . 8 ⊢ (𝑓 = 𝐺 → (TopOpen‘𝑓) = (TopOpen‘𝐺)) | |
| 10 | istgp.1 | . . . . . . . 8 ⊢ 𝐽 = (TopOpen‘𝐺) | |
| 11 | 9, 10 | eqtr4di 2813 | . . . . . . 7 ⊢ (𝑓 = 𝐺 → (TopOpen‘𝑓) = 𝐽) |
| 12 | 8, 11 | sylan9eqr 2817 | . . . . . 6 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → 𝑗 = 𝐽) |
| 13 | 12, 12 | oveq12d 7427 | . . . . 5 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (𝑗 Cn 𝑗) = (𝐽 Cn 𝐽)) |
| 14 | 7, 13 | eleq12d 2854 | . . . 4 ⊢ ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → ((invg‘𝑓) ∈ (𝑗 Cn 𝑗) ↔ 𝐼 ∈ (𝐽 Cn 𝐽))) |
| 15 | 3, 14 | sbcied 3782 | . . 3 ⊢ (𝑓 = 𝐺 → ([(TopOpen‘𝑓) / 𝑗](invg‘𝑓) ∈ (𝑗 Cn 𝑗) ↔ 𝐼 ∈ (𝐽 Cn 𝐽))) |
| 16 | df-tgp 24339 | . . 3 ⊢ TopGrp = {𝑓 ∈ (Grp ∩ TopMnd) ∣ [(TopOpen‘𝑓) / 𝑗](invg‘𝑓) ∈ (𝑗 Cn 𝑗)} | |
| 17 | 15, 16 | elrab2 3649 | . 2 ⊢ (𝐺 ∈ TopGrp ↔ (𝐺 ∈ (Grp ∩ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽))) |
| 18 | df-3an 1105 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd ∧ 𝐼 ∈ (𝐽 Cn 𝐽)) ↔ ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽))) | |
| 19 | 2, 17, 18 | 3bitr4i 306 | 1 ⊢ (𝐺 ∈ TopGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd ∧ 𝐼 ∈ (𝐽 Cn 𝐽))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 Vcvv 3450 [wsbc 3739 ∩ cin 3898 ‘cfv 6528 (class class class)co 7409 TopOpenctopn 17539 Grpcgrp 19091 invgcminusg 19092 Cn ccn 23489 TopMndctmd 24336 TopGrpctgp 24337 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-nul 5260 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-rab 3413 df-v 3452 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-iota 6484 df-fv 6536 df-ov 7412 df-tgp 24339 |
| This theorem is used by: tgpgrp 24344 tgptmd 24345 tgpinv 24351 istgp2 24357 oppgtgp 24364 subgtgp 24371 symgtgp 24372 prdstgpd 24391 tlmtgp 24462 nrgtdrg 24959 |
| Copyright terms: Public domain | W3C validator |