![]() |
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 4201 | . . . 4 ⊢ (𝑆 ∩ (𝑇 ⊕ 𝑈)) = ((𝑇 ⊕ 𝑈) ∩ 𝑆) | |
7 | lsmdisjr.i | . . . 4 ⊢ (𝜑 → (𝑆 ∩ (𝑇 ⊕ 𝑈)) = { 0 }) | |
8 | 6, 7 | eqtr3id 2785 | . . 3 ⊢ (𝜑 → ((𝑇 ⊕ 𝑈) ∩ 𝑆) = { 0 }) |
9 | 1, 2, 3, 4, 5, 8 | lsmdisj 19591 | . 2 ⊢ (𝜑 → ((𝑇 ∩ 𝑆) = { 0 } ∧ (𝑈 ∩ 𝑆) = { 0 })) |
10 | incom 4201 | . . . 4 ⊢ (𝑇 ∩ 𝑆) = (𝑆 ∩ 𝑇) | |
11 | 10 | eqeq1i 2736 | . . 3 ⊢ ((𝑇 ∩ 𝑆) = { 0 } ↔ (𝑆 ∩ 𝑇) = { 0 }) |
12 | incom 4201 | . . . 4 ⊢ (𝑈 ∩ 𝑆) = (𝑆 ∩ 𝑈) | |
13 | 12 | eqeq1i 2736 | . . 3 ⊢ ((𝑈 ∩ 𝑆) = { 0 } ↔ (𝑆 ∩ 𝑈) = { 0 }) |
14 | 11, 13 | anbi12i 626 | . 2 ⊢ (((𝑇 ∩ 𝑆) = { 0 } ∧ (𝑈 ∩ 𝑆) = { 0 }) ↔ ((𝑆 ∩ 𝑇) = { 0 } ∧ (𝑆 ∩ 𝑈) = { 0 })) |
15 | 9, 14 | sylib 217 | 1 ⊢ (𝜑 → ((𝑆 ∩ 𝑇) = { 0 } ∧ (𝑆 ∩ 𝑈) = { 0 })) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2105 ∩ cin 3947 {csn 4628 ‘cfv 6543 (class class class)co 7412 0gc0g 17390 SubGrpcsubg 19037 LSSumclsm 19544 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7728 ax-cnex 11169 ax-resscn 11170 ax-1cn 11171 ax-icn 11172 ax-addcl 11173 ax-addrcl 11174 ax-mulcl 11175 ax-mulrcl 11176 ax-mulcom 11177 ax-addass 11178 ax-mulass 11179 ax-distr 11180 ax-i2m1 11181 ax-1ne0 11182 ax-1rid 11183 ax-rnegex 11184 ax-rrecex 11185 ax-cnre 11186 ax-pre-lttri 11187 ax-pre-lttrn 11188 ax-pre-ltadd 11189 ax-pre-mulgt0 11190 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 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 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7859 df-1st 7978 df-2nd 7979 df-frecs 8269 df-wrecs 8300 df-recs 8374 df-rdg 8413 df-er 8706 df-en 8943 df-dom 8944 df-sdom 8945 df-pnf 11255 df-mnf 11256 df-xr 11257 df-ltxr 11258 df-le 11259 df-sub 11451 df-neg 11452 df-nn 12218 df-2 12280 df-sets 17102 df-slot 17120 df-ndx 17132 df-base 17150 df-ress 17179 df-plusg 17215 df-0g 17392 df-mgm 18566 df-sgrp 18645 df-mnd 18661 df-submnd 18707 df-grp 18859 df-minusg 18860 df-subg 19040 df-lsm 19546 |
This theorem is referenced by: lsmdisj2a 19597 lsmdisj2b 19598 |
Copyright terms: Public domain | W3C validator |