| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsmdisj3b | Structured version Visualization version GIF version | ||
| Description: Association of the disjointness constraint in a subgroup sum. (Contributed by Mario Carneiro, 21-Apr-2016.) |
| Ref | Expression |
|---|---|
| lsmcntz.p | ⊢ ⊕ = (LSSum‘𝐺) |
| lsmcntz.s | ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺)) |
| lsmcntz.t | ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) |
| lsmcntz.u | ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) |
| lsmdisj.o | ⊢ 0 = (0g‘𝐺) |
| lsmdisj3b.z | ⊢ 𝑍 = (Cntz‘𝐺) |
| lsmdisj3b.2 | ⊢ (𝜑 → 𝑇 ⊆ (𝑍‘𝑈)) |
| Ref | Expression |
|---|---|
| lsmdisj3b | ⊢ (𝜑 → ((((𝑆 ⊕ 𝑇) ∩ 𝑈) = { 0 } ∧ (𝑆 ∩ 𝑇) = { 0 }) ↔ ((𝑆 ∩ (𝑇 ⊕ 𝑈)) = { 0 } ∧ (𝑇 ∩ 𝑈) = { 0 }))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lsmcntz.p | . . 3 ⊢ ⊕ = (LSSum‘𝐺) | |
| 2 | lsmcntz.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 3 | lsmcntz.u | . . 3 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) | |
| 4 | lsmcntz.t | . . 3 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) | |
| 5 | lsmdisj.o | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 6 | 1, 2, 3, 4, 5 | lsmdisj2b 19615 | . 2 ⊢ (𝜑 → ((((𝑆 ⊕ 𝑇) ∩ 𝑈) = { 0 } ∧ (𝑆 ∩ 𝑇) = { 0 }) ↔ ((𝑆 ∩ (𝑈 ⊕ 𝑇)) = { 0 } ∧ (𝑈 ∩ 𝑇) = { 0 }))) |
| 7 | lsmdisj3b.2 | . . . . . 6 ⊢ (𝜑 → 𝑇 ⊆ (𝑍‘𝑈)) | |
| 8 | lsmdisj3b.z | . . . . . . 7 ⊢ 𝑍 = (Cntz‘𝐺) | |
| 9 | 1, 8 | lsmcom2 19582 | . . . . . 6 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺) ∧ 𝑇 ⊆ (𝑍‘𝑈)) → (𝑇 ⊕ 𝑈) = (𝑈 ⊕ 𝑇)) |
| 10 | 4, 3, 7, 9 | syl3anc 1373 | . . . . 5 ⊢ (𝜑 → (𝑇 ⊕ 𝑈) = (𝑈 ⊕ 𝑇)) |
| 11 | 10 | ineq2d 4170 | . . . 4 ⊢ (𝜑 → (𝑆 ∩ (𝑇 ⊕ 𝑈)) = (𝑆 ∩ (𝑈 ⊕ 𝑇))) |
| 12 | 11 | eqeq1d 2736 | . . 3 ⊢ (𝜑 → ((𝑆 ∩ (𝑇 ⊕ 𝑈)) = { 0 } ↔ (𝑆 ∩ (𝑈 ⊕ 𝑇)) = { 0 })) |
| 13 | incom 4159 | . . . . 5 ⊢ (𝑇 ∩ 𝑈) = (𝑈 ∩ 𝑇) | |
| 14 | 13 | a1i 11 | . . . 4 ⊢ (𝜑 → (𝑇 ∩ 𝑈) = (𝑈 ∩ 𝑇)) |
| 15 | 14 | eqeq1d 2736 | . . 3 ⊢ (𝜑 → ((𝑇 ∩ 𝑈) = { 0 } ↔ (𝑈 ∩ 𝑇) = { 0 })) |
| 16 | 12, 15 | anbi12d 632 | . 2 ⊢ (𝜑 → (((𝑆 ∩ (𝑇 ⊕ 𝑈)) = { 0 } ∧ (𝑇 ∩ 𝑈) = { 0 }) ↔ ((𝑆 ∩ (𝑈 ⊕ 𝑇)) = { 0 } ∧ (𝑈 ∩ 𝑇) = { 0 }))) |
| 17 | 6, 16 | bitr4d 282 | 1 ⊢ (𝜑 → ((((𝑆 ⊕ 𝑇) ∩ 𝑈) = { 0 } ∧ (𝑆 ∩ 𝑇) = { 0 }) ↔ ((𝑆 ∩ (𝑇 ⊕ 𝑈)) = { 0 } ∧ (𝑇 ∩ 𝑈) = { 0 }))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∩ cin 3898 ⊆ wss 3899 {csn 4578 ‘cfv 6490 (class class class)co 7356 0gc0g 17357 SubGrpcsubg 19048 Cntzccntz 19242 LSSumclsm 19561 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-tpos 8166 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-2 12206 df-sets 17089 df-slot 17107 df-ndx 17119 df-base 17135 df-ress 17156 df-plusg 17188 df-0g 17359 df-mgm 18563 df-sgrp 18642 df-mnd 18658 df-submnd 18707 df-grp 18864 df-minusg 18865 df-subg 19051 df-cntz 19244 df-oppg 19273 df-lsm 19563 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |