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 29592 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 +ℎ 𝐵) = (𝐵 +ℎ 𝐴)) | |
2 | 1 | oveq1d 7344 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = ((𝐵 +ℎ 𝐴) +ℎ 𝐶)) |
3 | 2 | 3adant3 1131 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = ((𝐵 +ℎ 𝐴) +ℎ 𝐶)) |
4 | ax-hvass 29593 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = (𝐴 +ℎ (𝐵 +ℎ 𝐶))) | |
5 | ax-hvass 29593 | . . 3 ⊢ ((𝐵 ∈ ℋ ∧ 𝐴 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐵 +ℎ 𝐴) +ℎ 𝐶) = (𝐵 +ℎ (𝐴 +ℎ 𝐶))) | |
6 | 5 | 3com12 1122 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐵 +ℎ 𝐴) +ℎ 𝐶) = (𝐵 +ℎ (𝐴 +ℎ 𝐶))) |
7 | 3, 4, 6 | 3eqtr3d 2784 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 +ℎ (𝐵 +ℎ 𝐶)) = (𝐵 +ℎ (𝐴 +ℎ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1540 ∈ wcel 2105 (class class class)co 7329 ℋchba 29510 +ℎ cva 29511 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2707 ax-hvcom 29592 ax-hvass 29593 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-sb 2067 df-clab 2714 df-cleq 2728 df-clel 2814 df-rab 3404 df-v 3443 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4269 df-if 4473 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4852 df-br 5090 df-iota 6425 df-fv 6481 df-ov 7332 |
This theorem is referenced by: hvaddsub12 29629 |
Copyright terms: Public domain | W3C validator |