| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0oo | Structured version Visualization version GIF version | ||
| Description: The zero operator is an operator. (Contributed by NM, 28-Nov-2007.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| 0oo.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| 0oo.2 | ⊢ 𝑌 = (BaseSet‘𝑊) |
| 0oo.0 | ⊢ 𝑍 = (𝑈 0op 𝑊) |
| Ref | Expression |
|---|---|
| 0oo | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑍:𝑋⟶𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvex 6896 | . . . . 5 ⊢ (0vec‘𝑊) ∈ V | |
| 2 | 1 | fconst 6766 | . . . 4 ⊢ (𝑋 × {(0vec‘𝑊)}):𝑋⟶{(0vec‘𝑊)} |
| 3 | 0oo.2 | . . . . . 6 ⊢ 𝑌 = (BaseSet‘𝑊) | |
| 4 | eqid 2763 | . . . . . 6 ⊢ (0vec‘𝑊) = (0vec‘𝑊) | |
| 5 | 3, 4 | nvzcl 30967 | . . . . 5 ⊢ (𝑊 ∈ NrmCVec → (0vec‘𝑊) ∈ 𝑌) |
| 6 | 5 | snssd 4753 | . . . 4 ⊢ (𝑊 ∈ NrmCVec → {(0vec‘𝑊)} ⊆ 𝑌) |
| 7 | fss 6724 | . . . 4 ⊢ (((𝑋 × {(0vec‘𝑊)}):𝑋⟶{(0vec‘𝑊)} ∧ {(0vec‘𝑊)} ⊆ 𝑌) → (𝑋 × {(0vec‘𝑊)}):𝑋⟶𝑌) | |
| 8 | 2, 6, 7 | sylancr 598 | . . 3 ⊢ (𝑊 ∈ NrmCVec → (𝑋 × {(0vec‘𝑊)}):𝑋⟶𝑌) |
| 9 | 8 | adantl 486 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑋 × {(0vec‘𝑊)}):𝑋⟶𝑌) |
| 10 | 0oo.1 | . . . 4 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 11 | 0oo.0 | . . . 4 ⊢ 𝑍 = (𝑈 0op 𝑊) | |
| 12 | 10, 4, 11 | 0ofval 31120 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑍 = (𝑋 × {(0vec‘𝑊)})) |
| 13 | 12 | feq1d 6689 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑍:𝑋⟶𝑌 ↔ (𝑋 × {(0vec‘𝑊)}):𝑋⟶𝑌)) |
| 14 | 9, 13 | mpbird 260 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑍:𝑋⟶𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ⊆ wss 3906 {csn 4590 × cxp 5661 ⟶wf 6534 ‘cfv 6538 (class class class)co 7412 NrmCVeccnv 30917 BaseSetcba 30919 0veccn0v 30921 0op c0o 31076 |
| This theorem was proved from 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-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 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-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7987 df-2nd 7988 df-grpo 30826 df-gid 30827 df-ablo 30878 df-vc 30892 df-nv 30925 df-va 30928 df-ba 30929 df-sm 30930 df-0v 30931 df-nmcv 30933 df-0o 31080 |
| This theorem is referenced by: 0lno 31123 nmoo0 31124 nmlno0lem 31126 |
| Copyright terms: Public domain | W3C validator |