| 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 3092 | . . . . 5 ⊢ (∀𝑥 ∈ 𝑋 ¬ 𝑥 ≠ 𝑍 ↔ ¬ ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍) | |
| 2 | nne 2963 | . . . . . 6 ⊢ (¬ 𝑥 ≠ 𝑍 ↔ 𝑥 = 𝑍) | |
| 3 | 2 | ralbii 3112 | . . . . 5 ⊢ (∀𝑥 ∈ 𝑋 ¬ 𝑥 ≠ 𝑍 ↔ ∀𝑥 ∈ 𝑋 𝑥 = 𝑍) |
| 4 | 1, 3 | bitr3i 280 | . . . 4 ⊢ (¬ ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍 ↔ ∀𝑥 ∈ 𝑋 𝑥 = 𝑍) |
| 5 | fveq2 6916 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑍 → (𝑇‘𝑥) = (𝑇‘𝑍)) | |
| 6 | lnon0.1 | . . . . . . . . . . 11 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 7 | eqid 2763 | . . . . . . . . . . 11 ⊢ (BaseSet‘𝑊) = (BaseSet‘𝑊) | |
| 8 | lnon0.6 | . . . . . . . . . . 11 ⊢ 𝑍 = (0vec‘𝑈) | |
| 9 | eqid 2763 | . . . . . . . . . . 11 ⊢ (0vec‘𝑊) = (0vec‘𝑊) | |
| 10 | lnon0.7 | . . . . . . . . . . 11 ⊢ 𝐿 = (𝑈 LnOp 𝑊) | |
| 11 | 6, 7, 8, 9, 10 | lno0 31415 | . . . . . . . . . 10 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇‘𝑍) = (0vec‘𝑊)) |
| 12 | 5, 11 | sylan9eqr 2820 | . . . . . . . . 9 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ 𝑥 = 𝑍) → (𝑇‘𝑥) = (0vec‘𝑊)) |
| 13 | 12 | ex 418 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑥 = 𝑍 → (𝑇‘𝑥) = (0vec‘𝑊))) |
| 14 | 13 | ralimdv 3180 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (∀𝑥 ∈ 𝑋 𝑥 = 𝑍 → ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (0vec‘𝑊))) |
| 15 | 6, 7, 10 | lnof 31414 | . . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:𝑋⟶(BaseSet‘𝑊)) |
| 16 | 15 | ffnd 6740 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇 Fn 𝑋) |
| 17 | 14, 16 | jctild 535 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (∀𝑥 ∈ 𝑋 𝑥 = 𝑍 → (𝑇 Fn 𝑋 ∧ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (0vec‘𝑊)))) |
| 18 | fconstfv 7249 | . . . . . . 7 ⊢ (𝑇:𝑋⟶{(0vec‘𝑊)} ↔ (𝑇 Fn 𝑋 ∧ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (0vec‘𝑊))) | |
| 19 | fvex 6929 | . . . . . . . 8 ⊢ (0vec‘𝑊) ∈ V | |
| 20 | 19 | fconst2 7242 | . . . . . . 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 31446 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑂 = (𝑋 × {(0vec‘𝑊)})) |
| 25 | 24 | 3adant3 1150 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑂 = (𝑋 × {(0vec‘𝑊)})) |
| 26 | 25 | eqeq2d 2774 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇 = 𝑂 ↔ 𝑇 = (𝑋 × {(0vec‘𝑊)}))) |
| 27 | 22, 26 | sylibrd 262 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (∀𝑥 ∈ 𝑋 𝑥 = 𝑍 → 𝑇 = 𝑂)) |
| 28 | 4, 27 | biimtrid 245 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (¬ ∃𝑥 ∈ 𝑋 𝑥 ≠ 𝑍 → 𝑇 = 𝑂)) |
| 29 | 28 | necon1ad 2976 | . 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 2147 ≠ wne 2959 ∀wral 3080 ∃wrex 3090 {csn 4588 × cxp 5656 Fn wfn 6561 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 NrmCVeccnv 31243 BaseSetcba 31245 0veccn0v 31247 LnOp clno 31399 0op c0o 31402 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-ltxr 11387 df-sub 11582 df-neg 11583 df-grpo 31152 df-gid 31153 df-ginv 31154 df-ablo 31204 df-vc 31218 df-nv 31251 df-va 31254 df-ba 31255 df-sm 31256 df-0v 31257 df-nmcv 31259 df-lno 31403 df-0o 31406 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |