Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > lnon0 | Structured version Visualization version GIF version |
Description: The domain of a nonzero linear operator contains a nonzero vector. (Contributed by NM, 15-Dec-2007.) (New usage is discouraged.) |
Ref | Expression |
---|---|
lnon0.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
lnon0.6 | ⊢ 𝑍 = (0vec‘𝑈) |
lnon0.0 | ⊢ 𝑂 = (𝑈 0op 𝑊) |
lnon0.7 | ⊢ 𝐿 = (𝑈 LnOp 𝑊) |
Ref | Expression |
---|---|
lnon0 | ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ 𝑇 ≠ 𝑂) → ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralnex 3165 | . . . . 5 ⊢ (∀𝑥 ∈ 𝑋 ¬ 𝑥 ≠ 𝑍 ↔ ¬ ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍) | |
2 | nne 2948 | . . . . . 6 ⊢ (¬ 𝑥 ≠ 𝑍 ↔ 𝑥 = 𝑍) | |
3 | 2 | ralbii 3092 | . . . . 5 ⊢ (∀𝑥 ∈ 𝑋 ¬ 𝑥 ≠ 𝑍 ↔ ∀𝑥 ∈ 𝑋 𝑥 = 𝑍) |
4 | 1, 3 | bitr3i 276 | . . . 4 ⊢ (¬ ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍 ↔ ∀𝑥 ∈ 𝑋 𝑥 = 𝑍) |
5 | fveq2 6768 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑍 → (𝑇‘𝑥) = (𝑇‘𝑍)) | |
6 | lnon0.1 | . . . . . . . . . . 11 ⊢ 𝑋 = (BaseSet‘𝑈) | |
7 | eqid 2739 | . . . . . . . . . . 11 ⊢ (BaseSet‘𝑊) = (BaseSet‘𝑊) | |
8 | lnon0.6 | . . . . . . . . . . 11 ⊢ 𝑍 = (0vec‘𝑈) | |
9 | eqid 2739 | . . . . . . . . . . 11 ⊢ (0vec‘𝑊) = (0vec‘𝑊) | |
10 | lnon0.7 | . . . . . . . . . . 11 ⊢ 𝐿 = (𝑈 LnOp 𝑊) | |
11 | 6, 7, 8, 9, 10 | lno0 29097 | . . . . . . . . . 10 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇‘𝑍) = (0vec‘𝑊)) |
12 | 5, 11 | sylan9eqr 2801 | . . . . . . . . 9 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ 𝑥 = 𝑍) → (𝑇‘𝑥) = (0vec‘𝑊)) |
13 | 12 | ex 412 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑥 = 𝑍 → (𝑇‘𝑥) = (0vec‘𝑊))) |
14 | 13 | ralimdv 3105 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (∀𝑥 ∈ 𝑋 𝑥 = 𝑍 → ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (0vec‘𝑊))) |
15 | 6, 7, 10 | lnof 29096 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:𝑋⟶(BaseSet‘𝑊)) |
16 | 15 | ffnd 6597 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇 Fn 𝑋) |
17 | 14, 16 | jctild 525 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (∀𝑥 ∈ 𝑋 𝑥 = 𝑍 → (𝑇 Fn 𝑋 ∧ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (0vec‘𝑊)))) |
18 | fconstfv 7082 | . . . . . . 7 ⊢ (𝑇:𝑋⟶{(0vec‘𝑊)} ↔ (𝑇 Fn 𝑋 ∧ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (0vec‘𝑊))) | |
19 | fvex 6781 | . . . . . . . 8 ⊢ (0vec‘𝑊) ∈ V | |
20 | 19 | fconst2 7074 | . . . . . . 7 ⊢ (𝑇:𝑋⟶{(0vec‘𝑊)} ↔ 𝑇 = (𝑋 × {(0vec‘𝑊)})) |
21 | 18, 20 | bitr3i 276 | . . . . . 6 ⊢ ((𝑇 Fn 𝑋 ∧ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (0vec‘𝑊)) ↔ 𝑇 = (𝑋 × {(0vec‘𝑊)})) |
22 | 17, 21 | syl6ib 250 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (∀𝑥 ∈ 𝑋 𝑥 = 𝑍 → 𝑇 = (𝑋 × {(0vec‘𝑊)}))) |
23 | lnon0.0 | . . . . . . . 8 ⊢ 𝑂 = (𝑈 0op 𝑊) | |
24 | 6, 9, 23 | 0ofval 29128 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑂 = (𝑋 × {(0vec‘𝑊)})) |
25 | 24 | 3adant3 1130 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑂 = (𝑋 × {(0vec‘𝑊)})) |
26 | 25 | eqeq2d 2750 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇 = 𝑂 ↔ 𝑇 = (𝑋 × {(0vec‘𝑊)}))) |
27 | 22, 26 | sylibrd 258 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (∀𝑥 ∈ 𝑋 𝑥 = 𝑍 → 𝑇 = 𝑂)) |
28 | 4, 27 | syl5bi 241 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (¬ ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍 → 𝑇 = 𝑂)) |
29 | 28 | necon1ad 2961 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇 ≠ 𝑂 → ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍)) |
30 | 29 | imp 406 | 1 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ 𝑇 ≠ 𝑂) → ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1541 ∈ wcel 2109 ≠ wne 2944 ∀wral 3065 ∃wrex 3066 {csn 4566 × cxp 5586 Fn wfn 6425 ⟶wf 6426 ‘cfv 6430 (class class class)co 7268 NrmCVeccnv 28925 BaseSetcba 28927 0veccn0v 28929 LnOp clno 29081 0op c0o 29084 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-rep 5213 ax-sep 5226 ax-nul 5233 ax-pow 5291 ax-pr 5355 ax-un 7579 ax-resscn 10912 ax-1cn 10913 ax-icn 10914 ax-addcl 10915 ax-addrcl 10916 ax-mulcl 10917 ax-mulrcl 10918 ax-mulcom 10919 ax-addass 10920 ax-mulass 10921 ax-distr 10922 ax-i2m1 10923 ax-1ne0 10924 ax-1rid 10925 ax-rnegex 10926 ax-rrecex 10927 ax-cnre 10928 ax-pre-lttri 10929 ax-pre-lttrn 10930 ax-pre-ltadd 10931 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3070 df-rex 3071 df-reu 3072 df-rab 3074 df-v 3432 df-sbc 3720 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4845 df-iun 4931 df-br 5079 df-opab 5141 df-mpt 5162 df-id 5488 df-po 5502 df-so 5503 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-f1 6435 df-fo 6436 df-f1o 6437 df-fv 6438 df-riota 7225 df-ov 7271 df-oprab 7272 df-mpo 7273 df-1st 7817 df-2nd 7818 df-er 8472 df-map 8591 df-en 8708 df-dom 8709 df-sdom 8710 df-pnf 10995 df-mnf 10996 df-ltxr 10998 df-sub 11190 df-neg 11191 df-grpo 28834 df-gid 28835 df-ginv 28836 df-ablo 28886 df-vc 28900 df-nv 28933 df-va 28936 df-ba 28937 df-sm 28938 df-0v 28939 df-nmcv 28941 df-lno 29085 df-0o 29088 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |