| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsmdisj2r | Structured version Visualization version GIF version | ||
| Description: Association of the disjointness constraint in a subgroup sum. (Contributed by Mario Carneiro, 22-Apr-2016.) |
| Ref | Expression |
|---|---|
| lsmcntz.p | ⊢ ⊕ = (LSSum‘𝐺) |
| lsmcntz.s | ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺)) |
| lsmcntz.t | ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) |
| lsmcntz.u | ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) |
| lsmdisj.o | ⊢ 0 = (0g‘𝐺) |
| lsmdisjr.i | ⊢ (𝜑 → (𝑆 ∩ (𝑇 ⊕ 𝑈)) = { 0 }) |
| lsmdisj2r.i | ⊢ (𝜑 → (𝑇 ∩ 𝑈) = { 0 }) |
| Ref | Expression |
|---|---|
| lsmdisj2r | ⊢ (𝜑 → ((𝑆 ⊕ 𝑈) ∩ 𝑇) = { 0 }) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2761 | . . . . 5 ⊢ (oppg‘𝐺) = (oppg‘𝐺) | |
| 2 | lsmcntz.p | . . . . 5 ⊢ ⊕ = (LSSum‘𝐺) | |
| 3 | 1, 2 | oppglsm 19849 | . . . 4 ⊢ (𝑈(LSSum‘(oppg‘𝐺))𝑆) = (𝑆 ⊕ 𝑈) |
| 4 | 3 | ineq2i 4163 | . . 3 ⊢ (𝑇 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑆)) = (𝑇 ∩ (𝑆 ⊕ 𝑈)) |
| 5 | incom 4155 | . . 3 ⊢ (𝑇 ∩ (𝑆 ⊕ 𝑈)) = ((𝑆 ⊕ 𝑈) ∩ 𝑇) | |
| 6 | 4, 5 | eqtri 2784 | . 2 ⊢ (𝑇 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑆)) = ((𝑆 ⊕ 𝑈) ∩ 𝑇) |
| 7 | eqid 2761 | . . 3 ⊢ (LSSum‘(oppg‘𝐺)) = (LSSum‘(oppg‘𝐺)) | |
| 8 | lsmcntz.u | . . . 4 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) | |
| 9 | 1 | oppgsubg 19570 | . . . 4 ⊢ (SubGrp‘𝐺) = (SubGrp‘(oppg‘𝐺)) |
| 10 | 8, 9 | eleqtrdi 2871 | . . 3 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘(oppg‘𝐺))) |
| 11 | lsmcntz.t | . . . 4 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) | |
| 12 | 11, 9 | eleqtrdi 2871 | . . 3 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘(oppg‘𝐺))) |
| 13 | lsmcntz.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 14 | 13, 9 | eleqtrdi 2871 | . . 3 ⊢ (𝜑 → 𝑆 ∈ (SubGrp‘(oppg‘𝐺))) |
| 15 | lsmdisj.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 16 | 1, 15 | oppgid 19563 | . . 3 ⊢ 0 = (0g‘(oppg‘𝐺)) |
| 17 | 1, 2 | oppglsm 19849 | . . . . . 6 ⊢ (𝑈(LSSum‘(oppg‘𝐺))𝑇) = (𝑇 ⊕ 𝑈) |
| 18 | 17 | ineq1i 4162 | . . . . 5 ⊢ ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = ((𝑇 ⊕ 𝑈) ∩ 𝑆) |
| 19 | incom 4155 | . . . . 5 ⊢ ((𝑇 ⊕ 𝑈) ∩ 𝑆) = (𝑆 ∩ (𝑇 ⊕ 𝑈)) | |
| 20 | 18, 19 | eqtri 2784 | . . . 4 ⊢ ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = (𝑆 ∩ (𝑇 ⊕ 𝑈)) |
| 21 | lsmdisjr.i | . . . 4 ⊢ (𝜑 → (𝑆 ∩ (𝑇 ⊕ 𝑈)) = { 0 }) | |
| 22 | 20, 21 | eqtrid 2808 | . . 3 ⊢ (𝜑 → ((𝑈(LSSum‘(oppg‘𝐺))𝑇) ∩ 𝑆) = { 0 }) |
| 23 | incom 4155 | . . . 4 ⊢ (𝑇 ∩ 𝑈) = (𝑈 ∩ 𝑇) | |
| 24 | lsmdisj2r.i | . . . 4 ⊢ (𝜑 → (𝑇 ∩ 𝑈) = { 0 }) | |
| 25 | 23, 24 | eqtr3id 2810 | . . 3 ⊢ (𝜑 → (𝑈 ∩ 𝑇) = { 0 }) |
| 26 | 7, 10, 12, 14, 16, 22, 25 | lsmdisj2 19889 | . 2 ⊢ (𝜑 → (𝑇 ∩ (𝑈(LSSum‘(oppg‘𝐺))𝑆)) = { 0 }) |
| 27 | 6, 26 | eqtr3id 2810 | 1 ⊢ (𝜑 → ((𝑆 ⊕ 𝑈) ∩ 𝑇) = { 0 }) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ∩ cin 3898 {csn 4584 ‘cfv 6537 (class class class)co 7418 0gc0g 17603 SubGrpcsubg 19323 oppgcoppg 19552 LSSumclsm 19841 |
| 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 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 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 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-1st 7999 df-2nd 8000 df-tpos 8236 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-2 12398 df-sets 17335 df-slot 17353 df-ndx 17365 df-base 17381 df-ress 17402 df-plusg 17434 df-0g 17605 df-mgm 18809 df-sgrp 18901 df-mnd 18917 df-submnd 18972 df-grp 19140 df-minusg 19141 df-subg 19326 df-oppg 19553 df-lsm 19843 |
| This theorem is used by: lsmdisj3r 19893 lsmdisj2b 19895 |
| Copyright terms: Public domain | W3C validator |