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 29363 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 +ℎ 𝐵) = (𝐵 +ℎ 𝐴)) | |
2 | 1 | oveq1d 7290 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = ((𝐵 +ℎ 𝐴) +ℎ 𝐶)) |
3 | 2 | 3adant3 1131 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = ((𝐵 +ℎ 𝐴) +ℎ 𝐶)) |
4 | ax-hvass 29364 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +ℎ 𝐵) +ℎ 𝐶) = (𝐴 +ℎ (𝐵 +ℎ 𝐶))) | |
5 | ax-hvass 29364 | . . 3 ⊢ ((𝐵 ∈ ℋ ∧ 𝐴 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐵 +ℎ 𝐴) +ℎ 𝐶) = (𝐵 +ℎ (𝐴 +ℎ 𝐶))) | |
6 | 5 | 3com12 1122 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐵 +ℎ 𝐴) +ℎ 𝐶) = (𝐵 +ℎ (𝐴 +ℎ 𝐶))) |
7 | 3, 4, 6 | 3eqtr3d 2786 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 +ℎ (𝐵 +ℎ 𝐶)) = (𝐵 +ℎ (𝐴 +ℎ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 (class class class)co 7275 ℋchba 29281 +ℎ cva 29282 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 ax-hvcom 29363 ax-hvass 29364 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-iota 6391 df-fv 6441 df-ov 7278 |
This theorem is referenced by: hvaddsub12 29400 |
Copyright terms: Public domain | W3C validator |