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

Theorem nlelshi 32421
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 31364 . . 3 0 ∈ ℋ
2 nlelsh.1 . . . 4 𝑇 ∈ LinFn
32lnfn0i 32403 . . 3 (𝑇‘0) = 0
42lnfnfi 32402 . . . 4 𝑇: ℋ⟶ℂ
5 elnlfn 32289 . . . 4 (𝑇: ℋ⟶ℂ → (0 ∈ (null‘𝑇) ↔ (0 ∈ ℋ ∧ (𝑇‘0) = 0)))
64, 5ax-mp 5 . . 3 (0 ∈ (null‘𝑇) ↔ (0 ∈ ℋ ∧ (𝑇‘0) = 0))
71, 3, 6mpbir2an 723 . 2 0 ∈ (null‘𝑇)
8 nlfnval 32242 . . . . . . . . . 10 (𝑇: ℋ⟶ℂ → (null‘𝑇) = (𝑇 “ {0}))
94, 8ax-mp 5 . . . . . . . . 9 (null‘𝑇) = (𝑇 “ {0})
10 cnvimass 6084 . . . . . . . . 9 (𝑇 “ {0}) ⊆ dom 𝑇
119, 10eqsstri 3983 . . . . . . . 8 (null‘𝑇) ⊆ dom 𝑇
124fdmi 6717 . . . . . . . 8 dom 𝑇 = ℋ
1311, 12sseqtri 3985 . . . . . . 7 (null‘𝑇) ⊆ ℋ
1413sseli 3933 . . . . . 6 (𝑥 ∈ (null‘𝑇) → 𝑥 ∈ ℋ)
1513sseli 3933 . . . . . 6 (𝑦 ∈ (null‘𝑇) → 𝑦 ∈ ℋ)
16 hvaddcl 31373 . . . . . 6 ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑥 + 𝑦) ∈ ℋ)
1714, 15, 16syl2an 607 . . . . 5 ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 + 𝑦) ∈ ℋ)
182lnfnaddi 32404 . . . . . . . 8 ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑇‘(𝑥 + 𝑦)) = ((𝑇𝑥) + (𝑇𝑦)))
1914, 15, 18syl2an 607 . . . . . . 7 ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 + 𝑦)) = ((𝑇𝑥) + (𝑇𝑦)))
20 elnlfn 32289 . . . . . . . . . 10 (𝑇: ℋ⟶ℂ → (𝑥 ∈ (null‘𝑇) ↔ (𝑥 ∈ ℋ ∧ (𝑇𝑥) = 0)))
214, 20ax-mp 5 . . . . . . . . 9 (𝑥 ∈ (null‘𝑇) ↔ (𝑥 ∈ ℋ ∧ (𝑇𝑥) = 0))
2221simprbi 502 . . . . . . . 8 (𝑥 ∈ (null‘𝑇) → (𝑇𝑥) = 0)
23 elnlfn 32289 . . . . . . . . . 10 (𝑇: ℋ⟶ℂ → (𝑦 ∈ (null‘𝑇) ↔ (𝑦 ∈ ℋ ∧ (𝑇𝑦) = 0)))
244, 23ax-mp 5 . . . . . . . . 9 (𝑦 ∈ (null‘𝑇) ↔ (𝑦 ∈ ℋ ∧ (𝑇𝑦) = 0))
2524simprbi 502 . . . . . . . 8 (𝑦 ∈ (null‘𝑇) → (𝑇𝑦) = 0)
2622, 25oveqan12d 7429 . . . . . . 7 ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → ((𝑇𝑥) + (𝑇𝑦)) = (0 + 0))
2719, 26eqtrd 2798 . . . . . 6 ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 + 𝑦)) = (0 + 0))
28 00id 11389 . . . . . 6 (0 + 0) = 0
2927, 28eqtrdi 2814 . . . . 5 ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 + 𝑦)) = 0)
30 elnlfn 32289 . . . . . 6 (𝑇: ℋ⟶ℂ → ((𝑥 + 𝑦) ∈ (null‘𝑇) ↔ ((𝑥 + 𝑦) ∈ ℋ ∧ (𝑇‘(𝑥 + 𝑦)) = 0)))
314, 30ax-mp 5 . . . . 5 ((𝑥 + 𝑦) ∈ (null‘𝑇) ↔ ((𝑥 + 𝑦) ∈ ℋ ∧ (𝑇‘(𝑥 + 𝑦)) = 0))
3217, 29, 31sylanbrc 594 . . . 4 ((𝑥 ∈ (null‘𝑇) ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 + 𝑦) ∈ (null‘𝑇))
3332rgen2 3205 . . 3 𝑥 ∈ (null‘𝑇)∀𝑦 ∈ (null‘𝑇)(𝑥 + 𝑦) ∈ (null‘𝑇)
34 hvmulcl 31374 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑥 · 𝑦) ∈ ℋ)
3515, 34sylan2 604 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 · 𝑦) ∈ ℋ)
362lnfnmuli 32405 . . . . . . 7 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℋ) → (𝑇‘(𝑥 · 𝑦)) = (𝑥 · (𝑇𝑦)))
3715, 36sylan2 604 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 · 𝑦)) = (𝑥 · (𝑇𝑦)))
3825oveq2d 7426 . . . . . . 7 (𝑦 ∈ (null‘𝑇) → (𝑥 · (𝑇𝑦)) = (𝑥 · 0))
39 mul01 11393 . . . . . . 7 (𝑥 ∈ ℂ → (𝑥 · 0) = 0)
4038, 39sylan9eqr 2820 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 · (𝑇𝑦)) = 0)
4137, 40eqtrd 2798 . . . . 5 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑇‘(𝑥 · 𝑦)) = 0)
42 elnlfn 32289 . . . . . 6 (𝑇: ℋ⟶ℂ → ((𝑥 · 𝑦) ∈ (null‘𝑇) ↔ ((𝑥 · 𝑦) ∈ ℋ ∧ (𝑇‘(𝑥 · 𝑦)) = 0)))
434, 42ax-mp 5 . . . . 5 ((𝑥 · 𝑦) ∈ (null‘𝑇) ↔ ((𝑥 · 𝑦) ∈ ℋ ∧ (𝑇‘(𝑥 · 𝑦)) = 0))
4435, 41, 43sylanbrc 594 . . . 4 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ (null‘𝑇)) → (𝑥 · 𝑦) ∈ (null‘𝑇))
4544rgen2 3205 . . 3 𝑥 ∈ ℂ ∀𝑦 ∈ (null‘𝑇)(𝑥 · 𝑦) ∈ (null‘𝑇)
4633, 45pm3.2i 475 . 2 (∀𝑥 ∈ (null‘𝑇)∀𝑦 ∈ (null‘𝑇)(𝑥 + 𝑦) ∈ (null‘𝑇) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (null‘𝑇)(𝑥 · 𝑦) ∈ (null‘𝑇))
47 issh3 31580 . . 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 723 1 (null‘𝑇) ∈ S
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wa 400   = wceq 1570  wcel 2143  wral 3079  wss 3905  {csn 4589  ccnv 5660  dom cdm 5661  cima 5664  wf 6532  cfv 6536  (class class class)co 7410  cc 11102  0cc0 11104   + caddc 11107   · cmul 11109  chba 31280   + cva 31281   · csm 31282  0c0v 31285   S csh 31289  nullcnl 31313  LinFnclf 31315
This proof depends on 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 11160  ax-resscn 11161  ax-1cn 11162  ax-icn 11163  ax-addcl 11164  ax-addrcl 11165  ax-mulcl 11166  ax-mulrcl 11167  ax-mulcom 11168  ax-addass 11169  ax-mulass 11170  ax-distr 11171  ax-i2m1 11172  ax-1ne0 11173  ax-1rid 11174  ax-rnegex 11175  ax-rrecex 11176  ax-cnre 11177  ax-pre-lttri 11178  ax-pre-lttrn 11179  ax-pre-ltadd 11180  ax-hilex 31360  ax-hfvadd 31361  ax-hv0cl 31364  ax-hvaddid 31365  ax-hfvmul 31366  ax-hvmulid 31367
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  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-nel 3065  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  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-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-po 5569  df-so 5570  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-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-er 8690  df-map 8822  df-en 8940  df-dom 8941  df-sdom 8942  df-pnf 11249  df-mnf 11250  df-ltxr 11252  df-sub 11447  df-sh 31568  df-nlfn 32207  df-lnfn 32209
This theorem is used by:  nlelchi  32422
  Copyright terms: Public domain W3C validator