| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsmcntzr | Structured version Visualization version GIF version | ||
| Description: The "subgroups commute" predicate applied to a subgroup sum. (Contributed by Mario Carneiro, 21-Apr-2016.) |
| Ref | Expression |
|---|---|
| lsmcntz.p | ⊢ ⊕ = (LSSum‘𝐺) |
| lsmcntz.s | ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺)) |
| lsmcntz.t | ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) |
| lsmcntz.u | ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) |
| lsmcntz.z | ⊢ 𝑍 = (Cntz‘𝐺) |
| Ref | Expression |
|---|---|
| lsmcntzr | ⊢ (𝜑 → (𝑆 ⊆ (𝑍‘(𝑇 ⊕ 𝑈)) ↔ (𝑆 ⊆ (𝑍‘𝑇) ∧ 𝑆 ⊆ (𝑍‘𝑈)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lsmcntz.p | . . 3 ⊢ ⊕ = (LSSum‘𝐺) | |
| 2 | lsmcntz.t | . . 3 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) | |
| 3 | lsmcntz.u | . . 3 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) | |
| 4 | lsmcntz.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 5 | lsmcntz.z | . . 3 ⊢ 𝑍 = (Cntz‘𝐺) | |
| 6 | 1, 2, 3, 4, 5 | lsmcntz 19753 | . 2 ⊢ (𝜑 → ((𝑇 ⊕ 𝑈) ⊆ (𝑍‘𝑆) ↔ (𝑇 ⊆ (𝑍‘𝑆) ∧ 𝑈 ⊆ (𝑍‘𝑆)))) |
| 7 | subgrcl 19201 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 8 | grpmnd 19011 | . . . . 5 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd) | |
| 9 | 4, 7, 8 | 3syl 19 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| 10 | eqid 2763 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 11 | 10 | subgss 19197 | . . . . 5 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ⊆ (Base‘𝐺)) |
| 12 | 2, 11 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑇 ⊆ (Base‘𝐺)) |
| 13 | 10 | subgss 19197 | . . . . 5 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺)) |
| 14 | 3, 13 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑈 ⊆ (Base‘𝐺)) |
| 15 | 10, 1 | lsmssv 19717 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)) → (𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺)) |
| 16 | 9, 12, 14, 15 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺)) |
| 17 | 10 | subgss 19197 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
| 18 | 4, 17 | syl 18 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝐺)) |
| 19 | 10, 5 | cntzrec 19410 | . . 3 ⊢ (((𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → ((𝑇 ⊕ 𝑈) ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘(𝑇 ⊕ 𝑈)))) |
| 20 | 16, 18, 19 | syl2anc 595 | . 2 ⊢ (𝜑 → ((𝑇 ⊕ 𝑈) ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘(𝑇 ⊕ 𝑈)))) |
| 21 | 10, 5 | cntzrec 19410 | . . . 4 ⊢ ((𝑇 ⊆ (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → (𝑇 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑇))) |
| 22 | 12, 18, 21 | syl2anc 595 | . . 3 ⊢ (𝜑 → (𝑇 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑇))) |
| 23 | 10, 5 | cntzrec 19410 | . . . 4 ⊢ ((𝑈 ⊆ (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → (𝑈 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑈))) |
| 24 | 14, 18, 23 | syl2anc 595 | . . 3 ⊢ (𝜑 → (𝑈 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑈))) |
| 25 | 22, 24 | anbi12d 643 | . 2 ⊢ (𝜑 → ((𝑇 ⊆ (𝑍‘𝑆) ∧ 𝑈 ⊆ (𝑍‘𝑆)) ↔ (𝑆 ⊆ (𝑍‘𝑇) ∧ 𝑆 ⊆ (𝑍‘𝑈)))) |
| 26 | 6, 20, 25 | 3bitr3d 312 | 1 ⊢ (𝜑 → (𝑆 ⊆ (𝑍‘(𝑇 ⊕ 𝑈)) ↔ (𝑆 ⊆ (𝑍‘𝑇) ∧ 𝑆 ⊆ (𝑍‘𝑈)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ⊆ wss 3905 ‘cfv 6536 (class class class)co 7410 Basecbs 17273 Mndcmnd 18796 Grpcgrp 19004 SubGrpcsubg 19190 Cntzccntz 19389 LSSumclsm 19708 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11160 ax-resscn 11161 ax-1cn 11162 ax-icn 11163 ax-addcl 11164 ax-addrcl 11165 ax-mulcl 11166 ax-mulrcl 11167 ax-mulcom 11168 ax-addass 11169 ax-mulass 11170 ax-distr 11171 ax-i2m1 11172 ax-1ne0 11173 ax-1rid 11174 ax-rnegex 11175 ax-rrecex 11176 ax-cnre 11177 ax-pre-lttri 11178 ax-pre-lttrn 11179 ax-pre-ltadd 11180 ax-pre-mulgt0 11181 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11447 df-neg 11448 df-nn 12238 df-2 12307 df-sets 17228 df-slot 17246 df-ndx 17258 df-base 17274 df-ress 17295 df-plusg 17327 df-0g 17498 df-mgm 18702 df-sgrp 18781 df-mnd 18797 df-submnd 18846 df-grp 19007 df-minusg 19008 df-subg 19193 df-cntz 19391 df-lsm 19710 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |