![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > subgdisjb | Structured version Visualization version GIF version |
Description: Vectors belonging to disjoint commuting subgroups are uniquely determined by their sum. Analogous to opth 5333, this theorem shows a way of representing a pair of vectors. (Contributed by NM, 5-Jul-2014.) (Revised by Mario Carneiro, 19-Apr-2016.) |
Ref | Expression |
---|---|
subgdisj.p | ⊢ + = (+g‘𝐺) |
subgdisj.o | ⊢ 0 = (0g‘𝐺) |
subgdisj.z | ⊢ 𝑍 = (Cntz‘𝐺) |
subgdisj.t | ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) |
subgdisj.u | ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) |
subgdisj.i | ⊢ (𝜑 → (𝑇 ∩ 𝑈) = { 0 }) |
subgdisj.s | ⊢ (𝜑 → 𝑇 ⊆ (𝑍‘𝑈)) |
subgdisj.a | ⊢ (𝜑 → 𝐴 ∈ 𝑇) |
subgdisj.c | ⊢ (𝜑 → 𝐶 ∈ 𝑇) |
subgdisj.b | ⊢ (𝜑 → 𝐵 ∈ 𝑈) |
subgdisj.d | ⊢ (𝜑 → 𝐷 ∈ 𝑈) |
Ref | Expression |
---|---|
subgdisjb | ⊢ (𝜑 → ((𝐴 + 𝐵) = (𝐶 + 𝐷) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | subgdisj.p | . . . . 5 ⊢ + = (+g‘𝐺) | |
2 | subgdisj.o | . . . . 5 ⊢ 0 = (0g‘𝐺) | |
3 | subgdisj.z | . . . . 5 ⊢ 𝑍 = (Cntz‘𝐺) | |
4 | subgdisj.t | . . . . . 6 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) | |
5 | 4 | adantr 484 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 + 𝐵) = (𝐶 + 𝐷)) → 𝑇 ∈ (SubGrp‘𝐺)) |
6 | subgdisj.u | . . . . . 6 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) | |
7 | 6 | adantr 484 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 + 𝐵) = (𝐶 + 𝐷)) → 𝑈 ∈ (SubGrp‘𝐺)) |
8 | subgdisj.i | . . . . . 6 ⊢ (𝜑 → (𝑇 ∩ 𝑈) = { 0 }) | |
9 | 8 | adantr 484 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 + 𝐵) = (𝐶 + 𝐷)) → (𝑇 ∩ 𝑈) = { 0 }) |
10 | subgdisj.s | . . . . . 6 ⊢ (𝜑 → 𝑇 ⊆ (𝑍‘𝑈)) | |
11 | 10 | adantr 484 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 + 𝐵) = (𝐶 + 𝐷)) → 𝑇 ⊆ (𝑍‘𝑈)) |
12 | subgdisj.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑇) | |
13 | 12 | adantr 484 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 + 𝐵) = (𝐶 + 𝐷)) → 𝐴 ∈ 𝑇) |
14 | subgdisj.c | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝑇) | |
15 | 14 | adantr 484 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 + 𝐵) = (𝐶 + 𝐷)) → 𝐶 ∈ 𝑇) |
16 | subgdisj.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑈) | |
17 | 16 | adantr 484 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 + 𝐵) = (𝐶 + 𝐷)) → 𝐵 ∈ 𝑈) |
18 | subgdisj.d | . . . . . 6 ⊢ (𝜑 → 𝐷 ∈ 𝑈) | |
19 | 18 | adantr 484 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 + 𝐵) = (𝐶 + 𝐷)) → 𝐷 ∈ 𝑈) |
20 | simpr 488 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 + 𝐵) = (𝐶 + 𝐷)) → (𝐴 + 𝐵) = (𝐶 + 𝐷)) | |
21 | 1, 2, 3, 5, 7, 9, 11, 13, 15, 17, 19, 20 | subgdisj1 18809 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 + 𝐵) = (𝐶 + 𝐷)) → 𝐴 = 𝐶) |
22 | 1, 2, 3, 5, 7, 9, 11, 13, 15, 17, 19, 20 | subgdisj2 18810 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 + 𝐵) = (𝐶 + 𝐷)) → 𝐵 = 𝐷) |
23 | 21, 22 | jca 515 | . . 3 ⊢ ((𝜑 ∧ (𝐴 + 𝐵) = (𝐶 + 𝐷)) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
24 | 23 | ex 416 | . 2 ⊢ (𝜑 → ((𝐴 + 𝐵) = (𝐶 + 𝐷) → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
25 | oveq12 7144 | . 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐴 + 𝐵) = (𝐶 + 𝐷)) | |
26 | 24, 25 | impbid1 228 | 1 ⊢ (𝜑 → ((𝐴 + 𝐵) = (𝐶 + 𝐷) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∩ cin 3880 ⊆ wss 3881 {csn 4525 ‘cfv 6324 (class class class)co 7135 +gcplusg 16557 0gc0g 16705 SubGrpcsubg 18265 Cntzccntz 18437 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-0g 16707 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 df-minusg 18099 df-sbg 18100 df-subg 18268 df-cntz 18439 |
This theorem is referenced by: pj1eu 18814 pj1eq 18818 lvecindp2 19904 |
Copyright terms: Public domain | W3C validator |