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

Theorem nlelshi 32525
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.
StepHypRef Expression
1 ax-hv0cl 31468 . . 3 0 ∈ ℋ
2 nlelsh.1 . . . 4 𝑇 ∈ LinFn
32lnfn0i 32507 . . 3 (𝑇‘0) = 0
42lnfnfi 32506 . . . 4 𝑇: ℋ⟶ℂ
5 elnlfn 32393 . . . 4 (𝑇: ℋ⟶ℂ → (0 ∈ (null‘𝑇) ↔ (0 ∈ ℋ ∧ (𝑇‘0) = 0)))
64, 5ax-mp 5 . . 3 (0 ∈ (null‘𝑇) ↔ (0 ∈ ℋ ∧ (𝑇‘0) = 0))
71, 3, 6mpbir2an 724 . 2 0 ∈ (null‘𝑇)
8 nlfnval 32346 . . . . . . . . . 10 (𝑇: ℋ⟶ℂ → (null‘𝑇) = (𝑇 “ {0}))
94, 8ax-mp 5 . . . . . . . . 9 (null‘𝑇) = (𝑇 “ {0})
10 cnvimass 6082 . . . . . . . . 9 (𝑇 “ {0}) ⊆ dom 𝑇
119, 10eqsstri 3980 . . . . . . . 8 (null‘𝑇) ⊆ dom 𝑇
124fdmi 6718 . . . . . . . 8 dom 𝑇 = ℋ
1311, 12sseqtri 3982 . . . . . . 7 (null‘𝑇) ⊆ ℋ
1413sseli 3930 . . . . . 6 (𝑥 ∈ (null‘𝑇) → 𝑥 ∈ ℋ)
1513sseli 3930 . . . . . 6 (𝑦 ∈ (null‘𝑇) → 𝑦 ∈ ℋ)
16 hvaddcl 31477 . . . . . 6 ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑥 + 𝑦) ∈ ℋ)
1714, 15, 16syl2an 608 . . . . 5 ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 + 𝑦) ∈ ℋ)
182lnfnaddi 32508 . . . . . . . 8 ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑇‘(𝑥 + 𝑦)) = ((𝑇𝑥) + (𝑇𝑦)))
1914, 15, 18syl2an 608 . . . . . . 7 ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 + 𝑦)) = ((𝑇𝑥) + (𝑇𝑦)))
20 elnlfn 32393 . . . . . . . . . 10 (𝑇: ℋ⟶ℂ → (𝑥 ∈ (null‘𝑇) ↔ (𝑥 ∈ ℋ ∧ (𝑇𝑥) = 0)))
214, 20ax-mp 5 . . . . . . . . 9 (𝑥 ∈ (null‘𝑇) ↔ (𝑥 ∈ ℋ ∧ (𝑇𝑥) = 0))
2221simprbi 503 . . . . . . . 8 (𝑥 ∈ (null‘𝑇) → (𝑇𝑥) = 0)
23 elnlfn 32393 . . . . . . . . . 10 (𝑇: ℋ⟶ℂ → (𝑦 ∈ (null‘𝑇) ↔ (𝑦 ∈ ℋ ∧ (𝑇𝑦) = 0)))
244, 23ax-mp 5 . . . . . . . . 9 (𝑦 ∈ (null‘𝑇) ↔ (𝑦 ∈ ℋ ∧ (𝑇𝑦) = 0))
2524simprbi 503 . . . . . . . 8 (𝑦 ∈ (null‘𝑇) → (𝑇𝑦) = 0)
2622, 25oveqan12d 7435 . . . . . . 7 ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → ((𝑇𝑥) + (𝑇𝑦)) = (0 + 0))
2719, 26eqtrd 2797 . . . . . 6 ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 + 𝑦)) = (0 + 0))
28 00id 11410 . . . . . 6 (0 + 0) = 0
2927, 28eqtrdi 2813 . . . . 5 ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 + 𝑦)) = 0)
30 elnlfn 32393 . . . . . 6 (𝑇: ℋ⟶ℂ → ((𝑥 + 𝑦) ∈ (null‘𝑇) ↔ ((𝑥 + 𝑦) ∈ ℋ ∧ (𝑇‘(𝑥 + 𝑦)) = 0)))
314, 30ax-mp 5 . . . . 5 ((𝑥 + 𝑦) ∈ (null‘𝑇) ↔ ((𝑥 + 𝑦) ∈ ℋ ∧ (𝑇‘(𝑥 + 𝑦)) = 0))
3217, 29, 31sylanbrc 595 . . . 4 ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 + 𝑦) ∈ (null‘𝑇))
3332rgen2 3204 . . 3 𝑥 ∈ (null‘𝑇)∀𝑦 ∈ (null‘𝑇)(𝑥 + 𝑦) ∈ (null‘𝑇)
34 hvmulcl 31478 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 · 𝑦) ∈ ℋ)
3515, 34sylan2 605 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 · 𝑦) ∈ ℋ)
362lnfnmuli 32509 . . . . . . 7 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑇‘(𝑥 · 𝑦)) = (𝑥 · (𝑇𝑦)))
3715, 36sylan2 605 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 · 𝑦)) = (𝑥 · (𝑇𝑦)))
3825oveq2d 7432 . . . . . . 7 (𝑦 ∈ (null‘𝑇) → (𝑥 · (𝑇𝑦)) = (𝑥 · 0))
39 mul01 11414 . . . . . . 7 (𝑥 ∈ ℂ → (𝑥 · 0) = 0)
4038, 39sylan9eqr 2819 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 · (𝑇𝑦)) = 0)
4137, 40eqtrd 2797 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 · 𝑦)) = 0)
42 elnlfn 32393 . . . . . 6 (𝑇: ℋ⟶ℂ → ((𝑥 · 𝑦) ∈ (null‘𝑇) ↔ ((𝑥 · 𝑦) ∈ ℋ ∧ (𝑇‘(𝑥 · 𝑦)) = 0)))
434, 42ax-mp 5 . . . . 5 ((𝑥 · 𝑦) ∈ (null‘𝑇) ↔ ((𝑥 · 𝑦) ∈ ℋ ∧ (𝑇‘(𝑥 · 𝑦)) = 0))
4435, 41, 43sylanbrc 595 . . . 4 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 · 𝑦) ∈ (null‘𝑇))
4544rgen2 3204 . . 3 𝑥 ∈ ℂ ∀𝑦 ∈ (null‘𝑇)(𝑥 · 𝑦) ∈ (null‘𝑇)
4633, 45pm3.2i 476 . 2 (∀𝑥 ∈ (null‘𝑇)∀𝑦 ∈ (null‘𝑇)(𝑥 + 𝑦) ∈ (null‘𝑇) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (null‘𝑇)(𝑥 · 𝑦) ∈ (null‘𝑇))
47 issh3 31684 . . 3 ((null‘𝑇) ⊆ ℋ → ((null‘𝑇) ∈ S ↔ (0 ∈ (null‘𝑇) ∧ (∀𝑥 ∈ (null‘𝑇)∀𝑦 ∈ (null‘𝑇)(𝑥 + 𝑦) ∈ (null‘𝑇) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (null‘𝑇)(𝑥 · 𝑦) ∈ (null‘𝑇)))))
4813, 47ax-mp 5 . 2 ((null‘𝑇) ∈ S ↔ (0 ∈ (null‘𝑇) ∧ (∀𝑥 ∈ (null‘𝑇)∀𝑦 ∈ (null‘𝑇)(𝑥 + 𝑦) ∈ (null‘𝑇) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (null‘𝑇)(𝑥 · 𝑦) ∈ (null‘𝑇))))
497, 46, 48mpbir2an 724 1 (null‘𝑇) ∈ S
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wa 401   = wceq 1570  wcel 2145  wral 3078  wss 3902  {csn 4587  ccnv 5658  dom cdm 5659  cima 5662  wf 6533  cfv 6537  (class class class)co 7416  cc 11123  0cc0 11125   + caddc 11128   · cmul 11130  chba 31384   + cva 31385   · csm 31386  0c0v 31389   S csh 31393  nullcnl 31417  LinFnclf 31419
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-cnex 11181  ax-resscn 11182  ax-1cn 11183  ax-icn 11184  ax-addcl 11185  ax-addrcl 11186  ax-mulcl 11187  ax-mulrcl 11188  ax-mulcom 11189  ax-addass 11190  ax-mulass 11191  ax-distr 11192  ax-i2m1 11193  ax-1ne0 11194  ax-1rid 11195  ax-rnegex 11196  ax-rrecex 11197  ax-cnre 11198  ax-pre-lttri 11199  ax-pre-lttrn 11200  ax-pre-ltadd 11201  ax-hilex 31464  ax-hfvadd 31465  ax-hv0cl 31468  ax-hvaddid 31469  ax-hfvmul 31470  ax-hvmulid 31471
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-po 5567  df-so 5568  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-er 8699  df-map 8831  df-en 8956  df-dom 8957  df-sdom 8958  df-pnf 11270  df-mnf 11271  df-ltxr 11273  df-sub 11468  df-sh 31672  df-nlfn 32311  df-lnfn 32313
This theorem is used by:  nlelchi  32526
  Copyright terms: Public domain W3C validator