hvsubass - Hilbert Space Explorer

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

Theorem hvsubass 31133

Description: Hilbert vector space associative law for subtraction. (Contributed by Mario Carneiro, 15-May-2014.) (New usage is discouraged.)

**Assertion**
Ref	Expression
hvsubass	⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 −_ℎ 𝐵) −_ℎ 𝐶) = (𝐴 −_ℎ (𝐵 +_ℎ 𝐶)))

**Proof of Theorem hvsubass**
Step	Hyp	Ref	Expression
1		neg1cn 12135	. . . 4 ⊢ -1 ∈ ℂ
2		hvmulcl 31102	. . . 4 ⊢ ((-1 ∈ ℂ ∧ 𝐵 ∈ ℋ) → (-1 ·_ℎ 𝐵) ∈ ℋ)
3	1, 2	mpan 696	. . 3 ⊢ (𝐵 ∈ ℋ → (-1 ·_ℎ 𝐵) ∈ ℋ)
4		hvaddsubass 31130	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ (-1 ·_ℎ 𝐵) ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +_ℎ (-1 ·_ℎ 𝐵)) −_ℎ 𝐶) = (𝐴 +_ℎ ((-1 ·_ℎ 𝐵) −_ℎ 𝐶)))
5	3, 4	syl3an2 1170	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 +_ℎ (-1 ·_ℎ 𝐵)) −_ℎ 𝐶) = (𝐴 +_ℎ ((-1 ·_ℎ 𝐵) −_ℎ 𝐶)))
6		hvsubval 31105	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 −_ℎ 𝐵) = (𝐴 +_ℎ (-1 ·_ℎ 𝐵)))
7	6	3adant3 1138	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 −_ℎ 𝐵) = (𝐴 +_ℎ (-1 ·_ℎ 𝐵)))
8	7	oveq1d 7371	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 −_ℎ 𝐵) −_ℎ 𝐶) = ((𝐴 +_ℎ (-1 ·_ℎ 𝐵)) −_ℎ 𝐶))
9		simp1 1142	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → 𝐴 ∈ ℋ)
10		hvaddcl 31101	. . . . 5 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 +_ℎ 𝐶) ∈ ℋ)
11	10	3adant1 1136	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 +_ℎ 𝐶) ∈ ℋ)
12		hvsubval 31105	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ (𝐵 +_ℎ 𝐶) ∈ ℋ) → (𝐴 −_ℎ (𝐵 +_ℎ 𝐶)) = (𝐴 +_ℎ (-1 ·_ℎ (𝐵 +_ℎ 𝐶))))
13	9, 11, 12	syl2anc 590	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 −_ℎ (𝐵 +_ℎ 𝐶)) = (𝐴 +_ℎ (-1 ·_ℎ (𝐵 +_ℎ 𝐶))))
14		hvsubval 31105	. . . . . . 7 ⊢ (((-1 ·_ℎ 𝐵) ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((-1 ·_ℎ 𝐵) −_ℎ 𝐶) = ((-1 ·_ℎ 𝐵) +_ℎ (-1 ·_ℎ 𝐶)))
15	3, 14	sylan 586	. . . . . 6 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((-1 ·_ℎ 𝐵) −_ℎ 𝐶) = ((-1 ·_ℎ 𝐵) +_ℎ (-1 ·_ℎ 𝐶)))
16	15	3adant1 1136	. . . . 5 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((-1 ·_ℎ 𝐵) −_ℎ 𝐶) = ((-1 ·_ℎ 𝐵) +_ℎ (-1 ·_ℎ 𝐶)))
17		ax-hvdistr1 31097	. . . . . . 7 ⊢ ((-1 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (-1 ·_ℎ (𝐵 +_ℎ 𝐶)) = ((-1 ·_ℎ 𝐵) +_ℎ (-1 ·_ℎ 𝐶)))
18	1, 17	mp3an1 1456	. . . . . 6 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (-1 ·_ℎ (𝐵 +_ℎ 𝐶)) = ((-1 ·_ℎ 𝐵) +_ℎ (-1 ·_ℎ 𝐶)))
19	18	3adant1 1136	. . . . 5 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (-1 ·_ℎ (𝐵 +_ℎ 𝐶)) = ((-1 ·_ℎ 𝐵) +_ℎ (-1 ·_ℎ 𝐶)))
20	16, 19	eqtr4d 2777	. . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((-1 ·_ℎ 𝐵) −_ℎ 𝐶) = (-1 ·_ℎ (𝐵 +_ℎ 𝐶)))
21	20	oveq2d 7372	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 +_ℎ ((-1 ·_ℎ 𝐵) −_ℎ 𝐶)) = (𝐴 +_ℎ (-1 ·_ℎ (𝐵 +_ℎ 𝐶))))
22	13, 21	eqtr4d 2777	. 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 −_ℎ (𝐵 +_ℎ 𝐶)) = (𝐴 +_ℎ ((-1 ·_ℎ 𝐵) −_ℎ 𝐶)))
23	5, 8, 22	3eqtr4d 2784	1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 −_ℎ 𝐵) −_ℎ 𝐶) = (𝐴 −_ℎ (𝐵 +_ℎ 𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 (class class class)co 7356 ℂcc 11027 1c1 11030 -cneg 11369 ℋchba 31008 +_ℎ cva 31009 ·_ℎ csm 31010 −_ℎ cmv 31014

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-hfvadd 31089 ax-hvass 31091 ax-hfvmul 31094 ax-hvdistr1 31097

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-po 5526 df-so 5527 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-er 8633 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11172 df-mnf 11173 df-ltxr 11175 df-sub 11370 df-neg 11371 df-hvsub 31060

This theorem is referenced by: hvsub32 31134 hvsubassi 31144 pjhthlem1 31480

W3C validator