| 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 19807 | . 2 ⊢ (𝜑 → ((𝑇 ⊕ 𝑈) ⊆ (𝑍‘𝑆) ↔ (𝑇 ⊆ (𝑍‘𝑆) ∧ 𝑈 ⊆ (𝑍‘𝑆)))) |
| 7 | subgrcl 19255 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 8 | grpmnd 19065 | . . . . 5 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd) | |
| 9 | 4, 7, 8 | 3syl 19 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mnd) |
| 10 | eqid 2762 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 11 | 10 | subgss 19251 | . . . . 5 ⊢ (𝑇 ∈ (SubGrp‘𝐺) → 𝑇 ⊆ (Base‘𝐺)) |
| 12 | 2, 11 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑇 ⊆ (Base‘𝐺)) |
| 13 | 10 | subgss 19251 | . . . . 5 ⊢ (𝑈 ∈ (SubGrp‘𝐺) → 𝑈 ⊆ (Base‘𝐺)) |
| 14 | 3, 13 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑈 ⊆ (Base‘𝐺)) |
| 15 | 10, 1 | lsmssv 19771 | . . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ (Base‘𝐺) ∧ 𝑈 ⊆ (Base‘𝐺)) → (𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺)) |
| 16 | 9, 12, 14, 15 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺)) |
| 17 | 10 | subgss 19251 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
| 18 | 4, 17 | syl 18 | . . 3 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝐺)) |
| 19 | 10, 5 | cntzrec 19464 | . . 3 ⊢ (((𝑇 ⊕ 𝑈) ⊆ (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → ((𝑇 ⊕ 𝑈) ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘(𝑇 ⊕ 𝑈)))) |
| 20 | 16, 18, 19 | syl2anc 596 | . 2 ⊢ (𝜑 → ((𝑇 ⊕ 𝑈) ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘(𝑇 ⊕ 𝑈)))) |
| 21 | 10, 5 | cntzrec 19464 | . . . 4 ⊢ ((𝑇 ⊆ (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → (𝑇 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑇))) |
| 22 | 12, 18, 21 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑇 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑇))) |
| 23 | 10, 5 | cntzrec 19464 | . . . 4 ⊢ ((𝑈 ⊆ (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → (𝑈 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑈))) |
| 24 | 14, 18, 23 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑈 ⊆ (𝑍‘𝑆) ↔ 𝑆 ⊆ (𝑍‘𝑈))) |
| 25 | 22, 24 | anbi12d 644 | . 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 401 = wceq 1570 ∈ wcel 2145 ⊆ wss 3902 ‘cfv 6537 (class class class)co 7416 Basecbs 17305 Mndcmnd 18838 Grpcgrp 19058 SubGrpcsubg 19244 Cntzccntz 19443 LSSumclsm 19762 |
| 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-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-2 12330 df-sets 17260 df-slot 17278 df-ndx 17290 df-base 17306 df-ress 17327 df-plusg 17359 df-0g 17530 df-mgm 18734 df-sgrp 18823 df-mnd 18839 df-submnd 18893 df-grp 19061 df-minusg 19062 df-subg 19247 df-cntz 19445 df-lsm 19764 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |