![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > lsmdisjr | Structured version Visualization version GIF version |
Description: Disjointness from 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‘𝐺) |
lsmdisjr.i | ⊢ (𝜑 → (𝑆 ∩ (𝑇 ⊕ 𝑈)) = { 0 }) |
Ref | Expression |
---|---|
lsmdisjr | ⊢ (𝜑 → ((𝑆 ∩ 𝑇) = { 0 } ∧ (𝑆 ∩ 𝑈) = { 0 })) |
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 | lsmdisj.o | . . 3 ⊢ 0 = (0g‘𝐺) | |
6 | incom 4197 | . . . 4 ⊢ (𝑆 ∩ (𝑇 ⊕ 𝑈)) = ((𝑇 ⊕ 𝑈) ∩ 𝑆) | |
7 | lsmdisjr.i | . . . 4 ⊢ (𝜑 → (𝑆 ∩ (𝑇 ⊕ 𝑈)) = { 0 }) | |
8 | 6, 7 | eqtr3id 2785 | . . 3 ⊢ (𝜑 → ((𝑇 ⊕ 𝑈) ∩ 𝑆) = { 0 }) |
9 | 1, 2, 3, 4, 5, 8 | lsmdisj 19513 | . 2 ⊢ (𝜑 → ((𝑇 ∩ 𝑆) = { 0 } ∧ (𝑈 ∩ 𝑆) = { 0 })) |
10 | incom 4197 | . . . 4 ⊢ (𝑇 ∩ 𝑆) = (𝑆 ∩ 𝑇) | |
11 | 10 | eqeq1i 2736 | . . 3 ⊢ ((𝑇 ∩ 𝑆) = { 0 } ↔ (𝑆 ∩ 𝑇) = { 0 }) |
12 | incom 4197 | . . . 4 ⊢ (𝑈 ∩ 𝑆) = (𝑆 ∩ 𝑈) | |
13 | 12 | eqeq1i 2736 | . . 3 ⊢ ((𝑈 ∩ 𝑆) = { 0 } ↔ (𝑆 ∩ 𝑈) = { 0 }) |
14 | 11, 13 | anbi12i 627 | . 2 ⊢ (((𝑇 ∩ 𝑆) = { 0 } ∧ (𝑈 ∩ 𝑆) = { 0 }) ↔ ((𝑆 ∩ 𝑇) = { 0 } ∧ (𝑆 ∩ 𝑈) = { 0 })) |
15 | 9, 14 | sylib 217 | 1 ⊢ (𝜑 → ((𝑆 ∩ 𝑇) = { 0 } ∧ (𝑆 ∩ 𝑈) = { 0 })) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∩ cin 3943 {csn 4622 ‘cfv 6532 (class class class)co 7393 0gc0g 17367 SubGrpcsubg 18972 LSSumclsm 19466 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7708 ax-cnex 11148 ax-resscn 11149 ax-1cn 11150 ax-icn 11151 ax-addcl 11152 ax-addrcl 11153 ax-mulcl 11154 ax-mulrcl 11155 ax-mulcom 11156 ax-addass 11157 ax-mulass 11158 ax-distr 11159 ax-i2m1 11160 ax-1ne0 11161 ax-1rid 11162 ax-rnegex 11163 ax-rrecex 11164 ax-cnre 11165 ax-pre-lttri 11166 ax-pre-lttrn 11167 ax-pre-ltadd 11168 ax-pre-mulgt0 11169 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3375 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-op 4629 df-uni 4902 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6289 df-ord 6356 df-on 6357 df-lim 6358 df-suc 6359 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-f1 6537 df-fo 6538 df-f1o 6539 df-fv 6540 df-riota 7349 df-ov 7396 df-oprab 7397 df-mpo 7398 df-om 7839 df-1st 7957 df-2nd 7958 df-frecs 8248 df-wrecs 8279 df-recs 8353 df-rdg 8392 df-er 8686 df-en 8923 df-dom 8924 df-sdom 8925 df-pnf 11232 df-mnf 11233 df-xr 11234 df-ltxr 11235 df-le 11236 df-sub 11428 df-neg 11429 df-nn 12195 df-2 12257 df-sets 17079 df-slot 17097 df-ndx 17109 df-base 17127 df-ress 17156 df-plusg 17192 df-0g 17369 df-mgm 18543 df-sgrp 18592 df-mnd 18603 df-submnd 18648 df-grp 18797 df-minusg 18798 df-subg 18975 df-lsm 19468 |
This theorem is referenced by: lsmdisj2a 19519 lsmdisj2b 19520 |
Copyright terms: Public domain | W3C validator |