braadd - Hilbert Space Explorer

	Hilbert Space Explorer		< Previous Next > Nearby theorems
Mirrors > Home > HSE Home > Th. List > braadd		Structured version Visualization version GIF version

Theorem braadd 31964

Description: Linearity property of bra for addition. (Contributed by NM, 23-May-2006.) (New usage is discouraged.)

**Assertion**
Ref	Expression
braadd	⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴)‘(𝐵 +_ℎ 𝐶)) = (((bra‘𝐴)‘𝐵) + ((bra‘𝐴)‘𝐶)))

**Proof of Theorem braadd**
Step	Hyp	Ref	Expression
1		ax-his2 31102	. . 3 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ ∧ 𝐴 ∈ ℋ) → ((𝐵 +_ℎ 𝐶) ·_ih 𝐴) = ((𝐵 ·_ih 𝐴) + (𝐶 ·_ih 𝐴)))
2	1	3comr 1126	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐵 +_ℎ 𝐶) ·_ih 𝐴) = ((𝐵 ·_ih 𝐴) + (𝐶 ·_ih 𝐴)))
3		hvaddcl 31031	. . . 4 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 +_ℎ 𝐶) ∈ ℋ)
4		braval 31963	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ (𝐵 +_ℎ 𝐶) ∈ ℋ) → ((bra‘𝐴)‘(𝐵 +_ℎ 𝐶)) = ((𝐵 +_ℎ 𝐶) ·_ih 𝐴))
5	3, 4	sylan2 593	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → ((bra‘𝐴)‘(𝐵 +_ℎ 𝐶)) = ((𝐵 +_ℎ 𝐶) ·_ih 𝐴))
6	5	3impb 1115	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴)‘(𝐵 +_ℎ 𝐶)) = ((𝐵 +_ℎ 𝐶) ·_ih 𝐴))
7		braval 31963	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((bra‘𝐴)‘𝐵) = (𝐵 ·_ih 𝐴))
8	7	3adant3 1133	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴)‘𝐵) = (𝐵 ·_ih 𝐴))
9		braval 31963	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴)‘𝐶) = (𝐶 ·_ih 𝐴))
10	9	3adant2 1132	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴)‘𝐶) = (𝐶 ·_ih 𝐴))
11	8, 10	oveq12d 7449	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (((bra‘𝐴)‘𝐵) + ((bra‘𝐴)‘𝐶)) = ((𝐵 ·_ih 𝐴) + (𝐶 ·_ih 𝐴)))
12	2, 6, 11	3eqtr4d 2787	1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((bra‘𝐴)‘(𝐵 +_ℎ 𝐶)) = (((bra‘𝐴)‘𝐵) + ((bra‘𝐴)‘𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 ‘cfv 6561 (class class class)co 7431 + caddc 11158 ℋchba 30938 +_ℎ cva 30939 ·_ih csp 30941 bracbr 30975

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pr 5432 ax-hilex 31018 ax-hfvadd 31019 ax-his2 31102

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-nul 4334 df-if 4526 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-id 5578 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-ov 7434 df-bra 31869

This theorem is referenced by: bralnfn 31967

W3C validator