Theorem cssi 22020

Description: Property of a closed subspace (of a pre-Hilbert space). (Contributed by Mario Carneiro, 13-Oct-2015.)

Hypotheses

Ref	Expression
cssval.o	⊢ ⊥ = (ocv‘𝑊)
cssval.c	⊢ 𝐶 = (ClSubSp‘𝑊)

Assertion

Ref	Expression
cssi	⊢ (𝑆 ∈ 𝐶 → 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)))

Proof of Theorem cssi

Step	Hyp	Ref	Expression
1		elfvdm 6942	. . . 4 ⊢ (𝑆 ∈ (ClSubSp‘𝑊) → 𝑊 ∈ dom ClSubSp)
2		cssval.c	. . . 4 ⊢ 𝐶 = (ClSubSp‘𝑊)
3	1, 2	eleq2s 2882	. . 3 ⊢ (𝑆 ∈ 𝐶 → 𝑊 ∈ dom ClSubSp)
4		cssval.o	. . . 4 ⊢ ⊥ = (ocv‘𝑊)
5	4, 2	iscss 22019	. . 3 ⊢ (𝑊 ∈ dom ClSubSp → (𝑆 ∈ 𝐶 ↔ 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆))))
6	3, 5	syl 18	. 2 ⊢ (𝑆 ∈ 𝐶 → (𝑆 ∈ 𝐶 ↔ 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆))))
7	6	ibi 270	1 ⊢ (𝑆 ∈ 𝐶 → 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  dom cdm 5655  ‘cfv 6558  ocvcocv 21996  ClSubSpccss 21997

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566  df-ov 7446  df-ocv 21999  df-css 22000

This theorem is used by:  cssss  22021  cssincl  22024  csslss  22027  cssmre  22029  mrccss  22030  ocvpj  22053  csscld  25600