Theorem elnlfn 32280

Description: Membership in the null space of a Hilbert space functional. (Contributed by NM, 11-Feb-2006.) (Revised by Mario Carneiro, 17-Nov-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
elnlfn	⊢ (𝑇: ℋ⟶ℂ → (𝐴 ∈ (null‘𝑇) ↔ (𝐴 ∈ ℋ ∧ (𝑇‘𝐴) = 0)))

Proof of Theorem elnlfn

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nlfnval 32233	. . . . . 6 ⊢ (𝑇: ℋ⟶ℂ → (null‘𝑇) = (◡𝑇 “ {0}))
2		cnvimass 6084	. . . . . 6 ⊢ (◡𝑇 “ {0}) ⊆ dom 𝑇
3	1, 2	eqsstrdi 3981	. . . . 5 ⊢ (𝑇: ℋ⟶ℂ → (null‘𝑇) ⊆ dom 𝑇)
4		fdm 6715	. . . . 5 ⊢ (𝑇: ℋ⟶ℂ → dom 𝑇 = ℋ)
5	3, 4	sseqtrd 3973	. . . 4 ⊢ (𝑇: ℋ⟶ℂ → (null‘𝑇) ⊆ ℋ)
6	5	sseld 3936	. . 3 ⊢ (𝑇: ℋ⟶ℂ → (𝐴 ∈ (null‘𝑇) → 𝐴 ∈ ℋ))
7	6	pm4.71rd 571	. 2 ⊢ (𝑇: ℋ⟶ℂ → (𝐴 ∈ (null‘𝑇) ↔ (𝐴 ∈ ℋ ∧ 𝐴 ∈ (null‘𝑇))))
8	1	eleq2d 2849	. . . . 5 ⊢ (𝑇: ℋ⟶ℂ → (𝐴 ∈ (null‘𝑇) ↔ 𝐴 ∈ (◡𝑇 “ {0})))
9	8	adantr 485	. . . 4 ⊢ ((𝑇: ℋ⟶ℂ ∧ 𝐴 ∈ ℋ) → (𝐴 ∈ (null‘𝑇) ↔ 𝐴 ∈ (◡𝑇 “ {0})))
10		ffn 6705	. . . . 5 ⊢ (𝑇: ℋ⟶ℂ → 𝑇 Fn ℋ)
11		eleq1 2851	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ (◡𝑇 “ {0}) ↔ 𝐴 ∈ (◡𝑇 “ {0})))
12		fveqeq2 6890	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → ((𝑇‘𝑥) = 0 ↔ (𝑇‘𝐴) = 0))
13	11, 12	bibi12d 348	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ (◡𝑇 “ {0}) ↔ (𝑇‘𝑥) = 0) ↔ (𝐴 ∈ (◡𝑇 “ {0}) ↔ (𝑇‘𝐴) = 0)))
14	13	imbi2d 343	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑇 Fn ℋ → (𝑥 ∈ (◡𝑇 “ {0}) ↔ (𝑇‘𝑥) = 0)) ↔ (𝑇 Fn ℋ → (𝐴 ∈ (◡𝑇 “ {0}) ↔ (𝑇‘𝐴) = 0))))
15		0cn 11193	. . . . . . . . 9 ⊢ 0 ∈ ℂ
16		vex 3459	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
17	16	eliniseg 6096	. . . . . . . . 9 ⊢ (0 ∈ ℂ → (𝑥 ∈ (◡𝑇 “ {0}) ↔ 𝑥𝑇0))
18	15, 17	ax-mp 5	. . . . . . . 8 ⊢ (𝑥 ∈ (◡𝑇 “ {0}) ↔ 𝑥𝑇0)
19		fnbrfvb 6931	. . . . . . . 8 ⊢ ((𝑇 Fn ℋ ∧ 𝑥 ∈ ℋ) → ((𝑇‘𝑥) = 0 ↔ 𝑥𝑇0))
20	18, 19	bitr4id 293	. . . . . . 7 ⊢ ((𝑇 Fn ℋ ∧ 𝑥 ∈ ℋ) → (𝑥 ∈ (◡𝑇 “ {0}) ↔ (𝑇‘𝑥) = 0))
21	20	expcom 418	. . . . . 6 ⊢ (𝑥 ∈ ℋ → (𝑇 Fn ℋ → (𝑥 ∈ (◡𝑇 “ {0}) ↔ (𝑇‘𝑥) = 0)))
22	14, 21	vtoclga 3541	. . . . 5 ⊢ (𝐴 ∈ ℋ → (𝑇 Fn ℋ → (𝐴 ∈ (◡𝑇 “ {0}) ↔ (𝑇‘𝐴) = 0)))
23	10, 22	mpan9 515	. . . 4 ⊢ ((𝑇: ℋ⟶ℂ ∧ 𝐴 ∈ ℋ) → (𝐴 ∈ (◡𝑇 “ {0}) ↔ (𝑇‘𝐴) = 0))
24	9, 23	bitrd 282	. . 3 ⊢ ((𝑇: ℋ⟶ℂ ∧ 𝐴 ∈ ℋ) → (𝐴 ∈ (null‘𝑇) ↔ (𝑇‘𝐴) = 0))
25	24	pm5.32da 589	. 2 ⊢ (𝑇: ℋ⟶ℂ → ((𝐴 ∈ ℋ ∧ 𝐴 ∈ (null‘𝑇)) ↔ (𝐴 ∈ ℋ ∧ (𝑇‘𝐴) = 0)))
26	7, 25	bitrd 282	1 ⊢ (𝑇: ℋ⟶ℂ → (𝐴 ∈ (null‘𝑇) ↔ (𝐴 ∈ ℋ ∧ (𝑇‘𝐴) = 0)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  {csn 4589   class class class wbr 5109  ^◡ccnv 5660  dom cdm 5661   “ cima 5664   Fn wfn 6531  ⟶wf 6532  ‘cfv 6536  ℂcc 11093  0cc0 11095   ℋchba 31271  nullcnl 31304

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11151  ax-1cn 11153  ax-icn 11154  ax-addcl 11155  ax-mulcl 11157  ax-i2m1 11163  ax-hilex 31351

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-map 8822  df-nlfn 32198

This theorem is referenced by:  elnlfn2  32281  nlelshi  32412  nlelchi  32413  riesz3i  32414