| 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 3088 | . . . . 5 ⊢ (∀𝑥 ∈ 𝑋 ¬ 𝑥 ≠ 𝑍 ↔ ¬ ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍) | |
| 2 | nne 2959 | . . . . . 6 ⊢ (¬ 𝑥 ≠ 𝑍 ↔ 𝑥 = 𝑍) | |
| 3 | 2 | ralbii 3108 | . . . . 5 ⊢ (∀𝑥 ∈ 𝑋 ¬ 𝑥 ≠ 𝑍 ↔ ∀𝑥 ∈ 𝑋 𝑥 = 𝑍) |
| 4 | 1, 3 | bitr3i 280 | . . . 4 ⊢ (¬ ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍 ↔ ∀𝑥 ∈ 𝑋 𝑥 = 𝑍) |
| 5 | fveq2 6878 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑍 → (𝑇‘𝑥) = (𝑇‘𝑍)) | |
| 6 | lnon0.1 | . . . . . . . . . . 11 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 7 | eqid 2760 | . . . . . . . . . . 11 ⊢ (BaseSet‘𝑊) = (BaseSet‘𝑊) | |
| 8 | lnon0.6 | . . . . . . . . . . 11 ⊢ 𝑍 = (0vec‘𝑈) | |
| 9 | eqid 2760 | . . . . . . . . . . 11 ⊢ (0vec‘𝑊) = (0vec‘𝑊) | |
| 10 | lnon0.7 | . . . . . . . . . . 11 ⊢ 𝐿 = (𝑈 LnOp 𝑊) | |
| 11 | 6, 7, 8, 9, 10 | lno0 31237 | . . . . . . . . . 10 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇‘𝑍) = (0vec‘𝑊)) |
| 12 | 5, 11 | sylan9eqr 2817 | . . . . . . . . 9 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ 𝑥 = 𝑍) → (𝑇‘𝑥) = (0vec‘𝑊)) |
| 13 | 12 | ex 418 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑥 = 𝑍 → (𝑇‘𝑥) = (0vec‘𝑊))) |
| 14 | 13 | ralimdv 3176 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (∀𝑥 ∈ 𝑋 𝑥 = 𝑍 → ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (0vec‘𝑊))) |
| 15 | 6, 7, 10 | lnof 31236 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:𝑋⟶(BaseSet‘𝑊)) |
| 16 | 15 | ffnd 6703 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇 Fn 𝑋) |
| 17 | 14, 16 | jctild 535 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (∀𝑥 ∈ 𝑋 𝑥 = 𝑍 → (𝑇 Fn 𝑋 ∧ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (0vec‘𝑊)))) |
| 18 | fconstfv 7211 | . . . . . . 7 ⊢ (𝑇:𝑋⟶{(0vec‘𝑊)} ↔ (𝑇 Fn 𝑋 ∧ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (0vec‘𝑊))) | |
| 19 | fvex 6891 | . . . . . . . 8 ⊢ (0vec‘𝑊) ∈ V | |
| 20 | 19 | fconst2 7204 | . . . . . . 7 ⊢ (𝑇:𝑋⟶{(0vec‘𝑊)} ↔ 𝑇 = (𝑋 × {(0vec‘𝑊)})) |
| 21 | 18, 20 | bitr3i 280 | . . . . . 6 ⊢ ((𝑇 Fn 𝑋 ∧ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (0vec‘𝑊)) ↔ 𝑇 = (𝑋 × {(0vec‘𝑊)})) |
| 22 | 17, 21 | imbitrdi 254 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (∀𝑥 ∈ 𝑋 𝑥 = 𝑍 → 𝑇 = (𝑋 × {(0vec‘𝑊)}))) |
| 23 | lnon0.0 | . . . . . . . 8 ⊢ 𝑂 = (𝑈 0op 𝑊) | |
| 24 | 6, 9, 23 | 0ofval 31268 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑂 = (𝑋 × {(0vec‘𝑊)})) |
| 25 | 24 | 3adant3 1150 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑂 = (𝑋 × {(0vec‘𝑊)})) |
| 26 | 25 | eqeq2d 2771 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇 = 𝑂 ↔ 𝑇 = (𝑋 × {(0vec‘𝑊)}))) |
| 27 | 22, 26 | sylibrd 262 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (∀𝑥 ∈ 𝑋 𝑥 = 𝑍 → 𝑇 = 𝑂)) |
| 28 | 4, 27 | biimtrid 245 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (¬ ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍 → 𝑇 = 𝑂)) |
| 29 | 28 | necon1ad 2972 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇 ≠ 𝑂 → ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍)) |
| 30 | 29 | imp 412 | 1 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ 𝑇 ≠ 𝑂) → ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ∀wral 3076 ∃wrex 3086 {csn 4584 × cxp 5653 Fn wfn 6528 ⟶wf 6529 ‘cfv 6533 (class class class)co 7413 NrmCVeccnv 31065 BaseSetcba 31067 0veccn0v 31069 LnOp clno 31221 0op c0o 31224 |
| 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 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987 df-er 8696 df-map 8828 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-ltxr 11272 df-sub 11467 df-neg 11468 df-grpo 30974 df-gid 30975 df-ginv 30976 df-ablo 31026 df-vc 31040 df-nv 31073 df-va 31076 df-ba 31077 df-sm 31078 df-0v 31079 df-nmcv 31081 df-lno 31225 df-0o 31228 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |