Theorem nlelshi 28303

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

Hypothesis

Ref	Expression
nlelsh.1	⊢ 𝑇 ∈ LinFn

Assertion

Ref	Expression
nlelshi	⊢ (null‘𝑇) ∈ Sℋ

Proof of Theorem nlelshi

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax-hv0cl 27244	. . 3 ⊢ 0ℎ ∈ ℋ
2		nlelsh.1	. . . 4 ⊢ 𝑇 ∈ LinFn
3	2	lnfn0i 28285	. . 3 ⊢ (𝑇‘0ℎ) = 0
4	2	lnfnfi 28284	. . . 4 ⊢ 𝑇: ℋ⟶ℂ
5		elnlfn 28171	. . . 4 ⊢ (𝑇: ℋ⟶ℂ → (0ℎ ∈ (null‘𝑇) ↔ (0ℎ ∈ ℋ ∧ (𝑇‘0ℎ) = 0)))
6	4, 5	ax-mp 5	. . 3 ⊢ (0ℎ ∈ (null‘𝑇) ↔ (0ℎ ∈ ℋ ∧ (𝑇‘0ℎ) = 0))
7	1, 3, 6	mpbir2an 957	. 2 ⊢ 0ℎ ∈ (null‘𝑇)
8		nlfnval 28124	. . . . . . . . . 10 ⊢ (𝑇: ℋ⟶ℂ → (null‘𝑇) = (◡𝑇 “ {0}))
9	4, 8	ax-mp 5	. . . . . . . . 9 ⊢ (null‘𝑇) = (◡𝑇 “ {0})
10		cnvimass 5404	. . . . . . . . 9 ⊢ (◡𝑇 “ {0}) ⊆ dom 𝑇
11	9, 10	eqsstri 3598	. . . . . . . 8 ⊢ (null‘𝑇) ⊆ dom 𝑇
12	4	fdmi 5965	. . . . . . . 8 ⊢ dom 𝑇 = ℋ
13	11, 12	sseqtri 3600	. . . . . . 7 ⊢ (null‘𝑇) ⊆ ℋ
14	13	sseli 3564	. . . . . 6 ⊢ (𝑥 ∈ (null‘𝑇) → 𝑥 ∈ ℋ)
15	13	sseli 3564	. . . . . 6 ⊢ (𝑦 ∈ (null‘𝑇) → 𝑦 ∈ ℋ)
16		hvaddcl 27253	. . . . . 6 ⊢ ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑥 +ℎ 𝑦) ∈ ℋ)
17	14, 15, 16	syl2an 493	. . . . 5 ⊢ ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 +ℎ 𝑦) ∈ ℋ)
18	2	lnfnaddi 28286	. . . . . . . 8 ⊢ ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑇‘(𝑥 +ℎ 𝑦)) = ((𝑇‘𝑥) + (𝑇‘𝑦)))
19	14, 15, 18	syl2an 493	. . . . . . 7 ⊢ ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 +ℎ 𝑦)) = ((𝑇‘𝑥) + (𝑇‘𝑦)))
20		elnlfn 28171	. . . . . . . . . 10 ⊢ (𝑇: ℋ⟶ℂ → (𝑥 ∈ (null‘𝑇) ↔ (𝑥 ∈ ℋ ∧ (𝑇‘𝑥) = 0)))
21	4, 20	ax-mp 5	. . . . . . . . 9 ⊢ (𝑥 ∈ (null‘𝑇) ↔ (𝑥 ∈ ℋ ∧ (𝑇‘𝑥) = 0))
22	21	simprbi 479	. . . . . . . 8 ⊢ (𝑥 ∈ (null‘𝑇) → (𝑇‘𝑥) = 0)
23		elnlfn 28171	. . . . . . . . . 10 ⊢ (𝑇: ℋ⟶ℂ → (𝑦 ∈ (null‘𝑇) ↔ (𝑦 ∈ ℋ ∧ (𝑇‘𝑦) = 0)))
24	4, 23	ax-mp 5	. . . . . . . . 9 ⊢ (𝑦 ∈ (null‘𝑇) ↔ (𝑦 ∈ ℋ ∧ (𝑇‘𝑦) = 0))
25	24	simprbi 479	. . . . . . . 8 ⊢ (𝑦 ∈ (null‘𝑇) → (𝑇‘𝑦) = 0)
26	22, 25	oveqan12d 6568	. . . . . . 7 ⊢ ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → ((𝑇‘𝑥) + (𝑇‘𝑦)) = (0 + 0))
27	19, 26	eqtrd 2644	. . . . . 6 ⊢ ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 +ℎ 𝑦)) = (0 + 0))
28		00id 10090	. . . . . 6 ⊢ (0 + 0) = 0
29	27, 28	syl6eq 2660	. . . . 5 ⊢ ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 +ℎ 𝑦)) = 0)
30		elnlfn 28171	. . . . . 6 ⊢ (𝑇: ℋ⟶ℂ → ((𝑥 +ℎ 𝑦) ∈ (null‘𝑇) ↔ ((𝑥 +ℎ 𝑦) ∈ ℋ ∧ (𝑇‘(𝑥 +ℎ 𝑦)) = 0)))
31	4, 30	ax-mp 5	. . . . 5 ⊢ ((𝑥 +ℎ 𝑦) ∈ (null‘𝑇) ↔ ((𝑥 +ℎ 𝑦) ∈ ℋ ∧ (𝑇‘(𝑥 +ℎ 𝑦)) = 0))
32	17, 29, 31	sylanbrc 695	. . . 4 ⊢ ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 +ℎ 𝑦) ∈ (null‘𝑇))
33	32	rgen2 2958	. . 3 ⊢ ∀𝑥 ∈ (null‘𝑇)∀𝑦 ∈ (null‘𝑇)(𝑥 +ℎ 𝑦) ∈ (null‘𝑇)
34		hvmulcl 27254	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 ·ℎ 𝑦) ∈ ℋ)
35	15, 34	sylan2 490	. . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 ·ℎ 𝑦) ∈ ℋ)
36	2	lnfnmuli 28287	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑇‘(𝑥 ·ℎ 𝑦)) = (𝑥 · (𝑇‘𝑦)))
37	15, 36	sylan2 490	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 ·ℎ 𝑦)) = (𝑥 · (𝑇‘𝑦)))
38	25	oveq2d 6565	. . . . . . 7 ⊢ (𝑦 ∈ (null‘𝑇) → (𝑥 · (𝑇‘𝑦)) = (𝑥 · 0))
39		mul01 10094	. . . . . . 7 ⊢ (𝑥 ∈ ℂ → (𝑥 · 0) = 0)
40	38, 39	sylan9eqr 2666	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 · (𝑇‘𝑦)) = 0)
41	37, 40	eqtrd 2644	. . . . 5 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 ·ℎ 𝑦)) = 0)
42		elnlfn 28171	. . . . . 6 ⊢ (𝑇: ℋ⟶ℂ → ((𝑥 ·ℎ 𝑦) ∈ (null‘𝑇) ↔ ((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ (𝑇‘(𝑥 ·ℎ 𝑦)) = 0)))
43	4, 42	ax-mp 5	. . . . 5 ⊢ ((𝑥 ·ℎ 𝑦) ∈ (null‘𝑇) ↔ ((𝑥 ·ℎ 𝑦) ∈ ℋ ∧ (𝑇‘(𝑥 ·ℎ 𝑦)) = 0))
44	35, 41, 43	sylanbrc 695	. . . 4 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 ·ℎ 𝑦) ∈ (null‘𝑇))
45	44	rgen2 2958	. . 3 ⊢ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (null‘𝑇)(𝑥 ·ℎ 𝑦) ∈ (null‘𝑇)
46	33, 45	pm3.2i 470	. 2 ⊢ (∀𝑥 ∈ (null‘𝑇)∀𝑦 ∈ (null‘𝑇)(𝑥 +ℎ 𝑦) ∈ (null‘𝑇) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (null‘𝑇)(𝑥 ·ℎ 𝑦) ∈ (null‘𝑇))
47		issh3 27460	. . 3 ⊢ ((null‘𝑇) ⊆ ℋ → ((null‘𝑇) ∈ Sℋ ↔ (0ℎ ∈ (null‘𝑇) ∧ (∀𝑥 ∈ (null‘𝑇)∀𝑦 ∈ (null‘𝑇)(𝑥 +ℎ 𝑦) ∈ (null‘𝑇) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (null‘𝑇)(𝑥 ·ℎ 𝑦) ∈ (null‘𝑇)))))
48	13, 47	ax-mp 5	. 2 ⊢ ((null‘𝑇) ∈ Sℋ ↔ (0ℎ ∈ (null‘𝑇) ∧ (∀𝑥 ∈ (null‘𝑇)∀𝑦 ∈ (null‘𝑇)(𝑥 +ℎ 𝑦) ∈ (null‘𝑇) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (null‘𝑇)(𝑥 ·ℎ 𝑦) ∈ (null‘𝑇))))
49	7, 46, 48	mpbir2an 957	1 ⊢ (null‘𝑇) ∈ Sℋ

Syntax hints:   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896   ⊆ wss 3540  {csn 4125  ^◡ccnv 5037  dom cdm 5038   “ cima 5041  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549  ℂcc 9813  0cc0 9815   + caddc 9818   · cmul 9820   ℋchil 27160   +_ℎ cva 27161   ·_ℎ csm 27162  0_ℎc0v 27165   S_ℋ csh 27169  nullcnl 27193  LinFnclf 27195

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-hilex 27240  ax-hfvadd 27241  ax-hv0cl 27244  ax-hvaddid 27245  ax-hfvmul 27246  ax-hvmulid 27247

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-po 4959  df-so 4960  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-er 7629  df-map 7746  df-en 7842  df-dom 7843  df-sdom 7844  df-pnf 9955  df-mnf 9956  df-ltxr 9958  df-sub 10147  df-sh 27448  df-nlfn 28089  df-lnfn 28091

This theorem is referenced by:  nlelchi  28304