Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > HSE Home > Th. List > hvadd32 | Structured version Visualization version GIF version |
Description: Commutative/associative law. (Contributed by NM, 16-Oct-1999.) (New usage is discouraged.) |
Ref | Expression |
---|---|
hvadd32 | ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = ((𝐴 +ℎ 𝐶) +ℎ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-hvcom 28772 | . . . 4 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 +ℎ 𝐶) = (𝐶 +ℎ 𝐵)) | |
2 | 1 | oveq2d 7166 | . . 3 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 +ℎ (𝐵 +ℎ 𝐶)) = (𝐴 +ℎ (𝐶 +ℎ 𝐵))) |
3 | 2 | 3adant1 1126 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 +ℎ (𝐵 +ℎ 𝐶)) = (𝐴 +ℎ (𝐶 +ℎ 𝐵))) |
4 | ax-hvass 28773 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = (𝐴 +ℎ (𝐵 +ℎ 𝐶))) | |
5 | ax-hvass 28773 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐶 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 +ℎ 𝐶) +ℎ 𝐵) = (𝐴 +ℎ (𝐶 +ℎ 𝐵))) | |
6 | 5 | 3com23 1122 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +ℎ 𝐶) +ℎ 𝐵) = (𝐴 +ℎ (𝐶 +ℎ 𝐵))) |
7 | 3, 4, 6 | 3eqtr4d 2866 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = ((𝐴 +ℎ 𝐶) +ℎ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 (class class class)co 7150 ℋchba 28690 +ℎ cva 28691 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-hvcom 28772 ax-hvass 28773 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rex 3144 df-rab 3147 df-v 3497 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-iota 6309 df-fv 6358 df-ov 7153 |
This theorem is referenced by: hvadd4 28807 hvadd32i 28825 |
Copyright terms: Public domain | W3C validator |