Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > HSE Home > Th. List > hvadd12 | Structured version Visualization version GIF version |
Description: Commutative/associative law. (Contributed by NM, 19-Oct-1999.) (New usage is discouraged.) |
Ref | Expression |
---|---|
hvadd12 | ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 +ℎ (𝐵 +ℎ 𝐶)) = (𝐵 +ℎ (𝐴 +ℎ 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-hvcom 29264 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 +ℎ 𝐵) = (𝐵 +ℎ 𝐴)) | |
2 | 1 | oveq1d 7270 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = ((𝐵 +ℎ 𝐴) +ℎ 𝐶)) |
3 | 2 | 3adant3 1130 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = ((𝐵 +ℎ 𝐴) +ℎ 𝐶)) |
4 | ax-hvass 29265 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = (𝐴 +ℎ (𝐵 +ℎ 𝐶))) | |
5 | ax-hvass 29265 | . . 3 ⊢ ((𝐵 ∈ ℋ ∧ 𝐴 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐵 +ℎ 𝐴) +ℎ 𝐶) = (𝐵 +ℎ (𝐴 +ℎ 𝐶))) | |
6 | 5 | 3com12 1121 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐵 +ℎ 𝐴) +ℎ 𝐶) = (𝐵 +ℎ (𝐴 +ℎ 𝐶))) |
7 | 3, 4, 6 | 3eqtr3d 2786 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 +ℎ (𝐵 +ℎ 𝐶)) = (𝐵 +ℎ (𝐴 +ℎ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 (class class class)co 7255 ℋchba 29182 +ℎ cva 29183 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 ax-hvcom 29264 ax-hvass 29265 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-iota 6376 df-fv 6426 df-ov 7258 |
This theorem is referenced by: hvaddsub12 29301 |
Copyright terms: Public domain | W3C validator |