![]() |
Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > HSE Home > Th. List > shscom | Structured version Visualization version GIF version |
Description: Commutative law for subspace sum. (Contributed by NM, 15-Dec-2004.) (New usage is discouraged.) |
Ref | Expression |
---|---|
shscom | ⊢ ((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) → (𝐴 +ℋ 𝐵) = (𝐵 +ℋ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | shel 30969 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Sℋ ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ ℋ) | |
2 | shel 30969 | . . . . . . . . 9 ⊢ ((𝐵 ∈ Sℋ ∧ 𝑧 ∈ 𝐵) → 𝑧 ∈ ℋ) | |
3 | 1, 2 | anim12i 612 | . . . . . . . 8 ⊢ (((𝐴 ∈ Sℋ ∧ 𝑦 ∈ 𝐴) ∧ (𝐵 ∈ Sℋ ∧ 𝑧 ∈ 𝐵)) → (𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ)) |
4 | 3 | an4s 657 | . . . . . . 7 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) → (𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ)) |
5 | ax-hvcom 30759 | . . . . . . 7 ⊢ ((𝑦 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑦 +ℎ 𝑧) = (𝑧 +ℎ 𝑦)) | |
6 | 4, 5 | syl 17 | . . . . . 6 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) → (𝑦 +ℎ 𝑧) = (𝑧 +ℎ 𝑦)) |
7 | 6 | eqeq2d 2737 | . . . . 5 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) → (𝑥 = (𝑦 +ℎ 𝑧) ↔ 𝑥 = (𝑧 +ℎ 𝑦))) |
8 | 7 | 2rexbidva 3211 | . . . 4 ⊢ ((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) → (∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 +ℎ 𝑧) ↔ ∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝑥 = (𝑧 +ℎ 𝑦))) |
9 | rexcom 3281 | . . . 4 ⊢ (∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝑥 = (𝑧 +ℎ 𝑦) ↔ ∃𝑧 ∈ 𝐵 ∃𝑦 ∈ 𝐴 𝑥 = (𝑧 +ℎ 𝑦)) | |
10 | 8, 9 | bitrdi 287 | . . 3 ⊢ ((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) → (∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 +ℎ 𝑧) ↔ ∃𝑧 ∈ 𝐵 ∃𝑦 ∈ 𝐴 𝑥 = (𝑧 +ℎ 𝑦))) |
11 | shsel 31072 | . . 3 ⊢ ((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) → (𝑥 ∈ (𝐴 +ℋ 𝐵) ↔ ∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝑥 = (𝑦 +ℎ 𝑧))) | |
12 | shsel 31072 | . . . 4 ⊢ ((𝐵 ∈ Sℋ ∧ 𝐴 ∈ Sℋ ) → (𝑥 ∈ (𝐵 +ℋ 𝐴) ↔ ∃𝑧 ∈ 𝐵 ∃𝑦 ∈ 𝐴 𝑥 = (𝑧 +ℎ 𝑦))) | |
13 | 12 | ancoms 458 | . . 3 ⊢ ((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) → (𝑥 ∈ (𝐵 +ℋ 𝐴) ↔ ∃𝑧 ∈ 𝐵 ∃𝑦 ∈ 𝐴 𝑥 = (𝑧 +ℎ 𝑦))) |
14 | 10, 11, 13 | 3bitr4d 311 | . 2 ⊢ ((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) → (𝑥 ∈ (𝐴 +ℋ 𝐵) ↔ 𝑥 ∈ (𝐵 +ℋ 𝐴))) |
15 | 14 | eqrdv 2724 | 1 ⊢ ((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) → (𝐴 +ℋ 𝐵) = (𝐵 +ℋ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ∃wrex 3064 (class class class)co 7404 ℋchba 30677 +ℎ cva 30678 Sℋ csh 30686 +ℋ cph 30689 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7721 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-hilex 30757 ax-hfvadd 30758 ax-hvcom 30759 ax-hvass 30760 ax-hv0cl 30761 ax-hvaddid 30762 ax-hfvmul 30763 ax-hvmulid 30764 ax-hvdistr2 30767 ax-hvmul0 30768 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-id 5567 df-po 5581 df-so 5582 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-iota 6488 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7360 df-ov 7407 df-oprab 7408 df-mpo 7409 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-pnf 11251 df-mnf 11252 df-ltxr 11254 df-sub 11447 df-neg 11448 df-grpo 30251 df-ablo 30303 df-hvsub 30729 df-sh 30965 df-shs 31066 |
This theorem is referenced by: shsel2 31080 shsub2 31083 shscomi 31121 pjpjpre 31177 chscllem1 31395 chscllem2 31396 chscllem3 31397 chscllem4 31398 |
Copyright terms: Public domain | W3C validator |