![]() |
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 29992 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 +ℎ 𝐵) = (𝐵 +ℎ 𝐴)) | |
2 | 1 | oveq1d 7376 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = ((𝐵 +ℎ 𝐴) +ℎ 𝐶)) |
3 | 2 | 3adant3 1133 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = ((𝐵 +ℎ 𝐴) +ℎ 𝐶)) |
4 | ax-hvass 29993 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = (𝐴 +ℎ (𝐵 +ℎ 𝐶))) | |
5 | ax-hvass 29993 | . . 3 ⊢ ((𝐵 ∈ ℋ ∧ 𝐴 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐵 +ℎ 𝐴) +ℎ 𝐶) = (𝐵 +ℎ (𝐴 +ℎ 𝐶))) | |
6 | 5 | 3com12 1124 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐵 +ℎ 𝐴) +ℎ 𝐶) = (𝐵 +ℎ (𝐴 +ℎ 𝐶))) |
7 | 3, 4, 6 | 3eqtr3d 2781 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 +ℎ (𝐵 +ℎ 𝐶)) = (𝐵 +ℎ (𝐴 +ℎ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 (class class class)co 7361 ℋchba 29910 +ℎ cva 29911 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 ax-hvcom 29992 ax-hvass 29993 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-rab 3407 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4287 df-if 4491 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4870 df-br 5110 df-iota 6452 df-fv 6508 df-ov 7364 |
This theorem is referenced by: hvaddsub12 30029 |
Copyright terms: Public domain | W3C validator |