Theorem issh 31633

Description: Subspace 𝐻 of a Hilbert space. A subspace is a subset of Hilbert space which contains the zero vector and is closed under vector addition and scalar multiplication. (Contributed by Mario Carneiro, 23-Dec-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
issh	⊢ (𝐻 ∈ Sℋ ↔ ((𝐻 ⊆ ℋ ∧ 0ℎ ∈ 𝐻) ∧ (( +ℎ “ (𝐻 × 𝐻)) ⊆ 𝐻 ∧ ( ·ℎ “ (ℂ × 𝐻)) ⊆ 𝐻)))

Proof of Theorem issh

Dummy variable ℎ is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax-hilex 31424	. . . 4 ⊢ ℋ ∈ V
2	1	elpw2 5307	. . 3 ⊢ (𝐻 ∈ 𝒫 ℋ ↔ 𝐻 ⊆ ℋ)
3		3anass 1111	. . 3 ⊢ ((0ℎ ∈ 𝐻 ∧ ( +ℎ “ (𝐻 × 𝐻)) ⊆ 𝐻 ∧ ( ·ℎ “ (ℂ × 𝐻)) ⊆ 𝐻) ↔ (0ℎ ∈ 𝐻 ∧ (( +ℎ “ (𝐻 × 𝐻)) ⊆ 𝐻 ∧ ( ·ℎ “ (ℂ × 𝐻)) ⊆ 𝐻)))
4	2, 3	anbi12i 640	. 2 ⊢ ((𝐻 ∈ 𝒫 ℋ ∧ (0ℎ ∈ 𝐻 ∧ ( +ℎ “ (𝐻 × 𝐻)) ⊆ 𝐻 ∧ ( ·ℎ “ (ℂ × 𝐻)) ⊆ 𝐻)) ↔ (𝐻 ⊆ ℋ ∧ (0ℎ ∈ 𝐻 ∧ (( +ℎ “ (𝐻 × 𝐻)) ⊆ 𝐻 ∧ ( ·ℎ “ (ℂ × 𝐻)) ⊆ 𝐻))))
5		eleq2 2854	. . . 4 ⊢ (ℎ = 𝐻 → (0ℎ ∈ ℎ ↔ 0ℎ ∈ 𝐻))
6		id 23	. . . . . . 7 ⊢ (ℎ = 𝐻 → ℎ = 𝐻)
7	6	sqxpeqd 5695	. . . . . 6 ⊢ (ℎ = 𝐻 → (ℎ × ℎ) = (𝐻 × 𝐻))
8	7	imaeq2d 6064	. . . . 5 ⊢ (ℎ = 𝐻 → ( +ℎ “ (ℎ × ℎ)) = ( +ℎ “ (𝐻 × 𝐻)))
9	8, 6	sseq12d 3971	. . . 4 ⊢ (ℎ = 𝐻 → (( +ℎ “ (ℎ × ℎ)) ⊆ ℎ ↔ ( +ℎ “ (𝐻 × 𝐻)) ⊆ 𝐻))
10		xpeq2 5684	. . . . . 6 ⊢ (ℎ = 𝐻 → (ℂ × ℎ) = (ℂ × 𝐻))
11	10	imaeq2d 6064	. . . . 5 ⊢ (ℎ = 𝐻 → ( ·ℎ “ (ℂ × ℎ)) = ( ·ℎ “ (ℂ × 𝐻)))
12	11, 6	sseq12d 3971	. . . 4 ⊢ (ℎ = 𝐻 → (( ·ℎ “ (ℂ × ℎ)) ⊆ ℎ ↔ ( ·ℎ “ (ℂ × 𝐻)) ⊆ 𝐻))
13	5, 9, 12	3anbi123d 1464	. . 3 ⊢ (ℎ = 𝐻 → ((0ℎ ∈ ℎ ∧ ( +ℎ “ (ℎ × ℎ)) ⊆ ℎ ∧ ( ·ℎ “ (ℂ × ℎ)) ⊆ ℎ) ↔ (0ℎ ∈ 𝐻 ∧ ( +ℎ “ (𝐻 × 𝐻)) ⊆ 𝐻 ∧ ( ·ℎ “ (ℂ × 𝐻)) ⊆ 𝐻)))
14		df-sh 31632	. . 3 ⊢ Sℋ = {ℎ ∈ 𝒫 ℋ ∣ (0ℎ ∈ ℎ ∧ ( +ℎ “ (ℎ × ℎ)) ⊆ ℎ ∧ ( ·ℎ “ (ℂ × ℎ)) ⊆ ℎ)}
15	13, 14	elrab2 3656	. 2 ⊢ (𝐻 ∈ Sℋ ↔ (𝐻 ∈ 𝒫 ℋ ∧ (0ℎ ∈ 𝐻 ∧ ( +ℎ “ (𝐻 × 𝐻)) ⊆ 𝐻 ∧ ( ·ℎ “ (ℂ × 𝐻)) ⊆ 𝐻)))
16		anass 474	. 2 ⊢ (((𝐻 ⊆ ℋ ∧ 0ℎ ∈ 𝐻) ∧ (( +ℎ “ (𝐻 × 𝐻)) ⊆ 𝐻 ∧ ( ·ℎ “ (ℂ × 𝐻)) ⊆ 𝐻)) ↔ (𝐻 ⊆ ℋ ∧ (0ℎ ∈ 𝐻 ∧ (( +ℎ “ (𝐻 × 𝐻)) ⊆ 𝐻 ∧ ( ·ℎ “ (ℂ × 𝐻)) ⊆ 𝐻))))
17	4, 15, 16	3bitr4i 306	1 ⊢ (𝐻 ∈ Sℋ ↔ ((𝐻 ⊆ ℋ ∧ 0ℎ ∈ 𝐻) ∧ (( +ℎ “ (𝐻 × 𝐻)) ⊆ 𝐻 ∧ ( ·ℎ “ (ℂ × 𝐻)) ⊆ 𝐻)))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ⊆ wss 3906  𝒫 cpw 4564   × cxp 5661   “ cima 5666  ℂcc 11115   ℋchba 31344   +_ℎ cva 31345   ·_ℎ csm 31346  0_ℎc0v 31349   S_ℋ csh 31353

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-hilex 31424

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-xp 5669  df-cnv 5671  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-sh 31632

This theorem is used by:  issh2  31634  shss  31635  sh0  31641