issh3 - Hilbert Space Explorer

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

Theorem issh3 31290

Description: Subspace 𝐻 of a Hilbert space. (Contributed by NM, 16-Aug-1999.) (New usage is discouraged.)

**Assertion**
Ref	Expression
issh3	⊢ (𝐻 ⊆ ℋ → (𝐻 ∈ S_ℋ ↔ (0_ℎ ∈ 𝐻 ∧ (∀𝑥 ∈ 𝐻 ∀𝑦 ∈ 𝐻 (𝑥 +_ℎ 𝑦) ∈ 𝐻 ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝐻 (𝑥 ·_ℎ 𝑦) ∈ 𝐻))))

Distinct variable group: 𝑥,𝑦,𝐻

**Proof of Theorem issh3**
Step	Hyp	Ref	Expression
1		issh2 31280	. 2 ⊢ (𝐻 ∈ S_ℋ ↔ ((𝐻 ⊆ ℋ ∧ 0_ℎ ∈ 𝐻) ∧ (∀𝑥 ∈ 𝐻 ∀𝑦 ∈ 𝐻 (𝑥 +_ℎ 𝑦) ∈ 𝐻 ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝐻 (𝑥 ·_ℎ 𝑦) ∈ 𝐻)))
2		anass 468	. . 3 ⊢ (((𝐻 ⊆ ℋ ∧ 0_ℎ ∈ 𝐻) ∧ (∀𝑥 ∈ 𝐻 ∀𝑦 ∈ 𝐻 (𝑥 +_ℎ 𝑦) ∈ 𝐻 ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝐻 (𝑥 ·_ℎ 𝑦) ∈ 𝐻)) ↔ (𝐻 ⊆ ℋ ∧ (0_ℎ ∈ 𝐻 ∧ (∀𝑥 ∈ 𝐻 ∀𝑦 ∈ 𝐻 (𝑥 +_ℎ 𝑦) ∈ 𝐻 ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝐻 (𝑥 ·_ℎ 𝑦) ∈ 𝐻))))
3	2	baib 535	. 2 ⊢ (𝐻 ⊆ ℋ → (((𝐻 ⊆ ℋ ∧ 0_ℎ ∈ 𝐻) ∧ (∀𝑥 ∈ 𝐻 ∀𝑦 ∈ 𝐻 (𝑥 +_ℎ 𝑦) ∈ 𝐻 ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝐻 (𝑥 ·_ℎ 𝑦) ∈ 𝐻)) ↔ (0_ℎ ∈ 𝐻 ∧ (∀𝑥 ∈ 𝐻 ∀𝑦 ∈ 𝐻 (𝑥 +_ℎ 𝑦) ∈ 𝐻 ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝐻 (𝑥 ·_ℎ 𝑦) ∈ 𝐻))))
4	1, 3	bitrid 283	1 ⊢ (𝐻 ⊆ ℋ → (𝐻 ∈ S_ℋ ↔ (0_ℎ ∈ 𝐻 ∧ (∀𝑥 ∈ 𝐻 ∀𝑦 ∈ 𝐻 (𝑥 +_ℎ 𝑦) ∈ 𝐻 ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝐻 (𝑥 ·_ℎ 𝑦) ∈ 𝐻))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2114 ∀wral 3051 ⊆ wss 3889 (class class class)co 7367 ℂcc 11036 ℋchba 30990 +_ℎ cva 30991 ·_ℎ csm 30992 0_ℎc0v 30995 S_ℋ csh 30999

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pr 5375 ax-hilex 31070 ax-hfvadd 31071 ax-hfvmul 31076

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-fv 6506 df-ov 7370 df-sh 31278

This theorem is referenced by: nlelshi 32131

W3C validator