| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > suppssof1 | Structured version Visualization version GIF version | ||
| Description: Formula building theorem for support restrictions: vector operation with left annihilator. (Contributed by Stefan O'Rear, 9-Mar-2015.) (Revised by AV, 28-May-2019.) |
| Ref | Expression |
|---|---|
| suppssof1.s | ⊢ (𝜑 → (𝐴 supp 𝑌) ⊆ 𝐿) |
| suppssof1.o | ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑅) → (𝑌𝑂𝑣) = 𝑍) |
| suppssof1.a | ⊢ (𝜑 → 𝐴:𝐷⟶𝑉) |
| suppssof1.b | ⊢ (𝜑 → 𝐵:𝐷⟶𝑅) |
| suppssof1.d | ⊢ (𝜑 → 𝐷 ∈ 𝑊) |
| suppssof1.y | ⊢ (𝜑 → 𝑌 ∈ 𝑈) |
| Ref | Expression |
|---|---|
| suppssof1 | ⊢ (𝜑 → ((𝐴 ∘f 𝑂𝐵) supp 𝑍) ⊆ 𝐿) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | suppssof1.a | . . . . 5 ⊢ (𝜑 → 𝐴:𝐷⟶𝑉) | |
| 2 | 1 | ffnd 6708 | . . . 4 ⊢ (𝜑 → 𝐴 Fn 𝐷) |
| 3 | suppssof1.b | . . . . 5 ⊢ (𝜑 → 𝐵:𝐷⟶𝑅) | |
| 4 | 3 | ffnd 6708 | . . . 4 ⊢ (𝜑 → 𝐵 Fn 𝐷) |
| 5 | suppssof1.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑊) | |
| 6 | inidm 4180 | . . . 4 ⊢ (𝐷 ∩ 𝐷) = 𝐷 | |
| 7 | eqidd 2764 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴‘𝑥) = (𝐴‘𝑥)) | |
| 8 | eqidd 2764 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐵‘𝑥) = (𝐵‘𝑥)) | |
| 9 | 2, 4, 5, 5, 6, 7, 8 | offval 7685 | . . 3 ⊢ (𝜑 → (𝐴 ∘f 𝑂𝐵) = (𝑥 ∈ 𝐷 ↦ ((𝐴‘𝑥)𝑂(𝐵‘𝑥)))) |
| 10 | 9 | oveq1d 7427 | . 2 ⊢ (𝜑 → ((𝐴 ∘f 𝑂𝐵) supp 𝑍) = ((𝑥 ∈ 𝐷 ↦ ((𝐴‘𝑥)𝑂(𝐵‘𝑥))) supp 𝑍)) |
| 11 | 1 | feqmptd 6951 | . . . . 5 ⊢ (𝜑 → 𝐴 = (𝑥 ∈ 𝐷 ↦ (𝐴‘𝑥))) |
| 12 | 11 | oveq1d 7427 | . . . 4 ⊢ (𝜑 → (𝐴 supp 𝑌) = ((𝑥 ∈ 𝐷 ↦ (𝐴‘𝑥)) supp 𝑌)) |
| 13 | suppssof1.s | . . . 4 ⊢ (𝜑 → (𝐴 supp 𝑌) ⊆ 𝐿) | |
| 14 | 12, 13 | eqsstrrd 3973 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ (𝐴‘𝑥)) supp 𝑌) ⊆ 𝐿) |
| 15 | suppssof1.o | . . 3 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑅) → (𝑌𝑂𝑣) = 𝑍) | |
| 16 | fvexd 6898 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴‘𝑥) ∈ V) | |
| 17 | 3 | ffvelcdmda 7081 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐵‘𝑥) ∈ 𝑅) |
| 18 | suppssof1.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑈) | |
| 19 | 14, 15, 16, 17, 18 | suppssov1 8194 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ ((𝐴‘𝑥)𝑂(𝐵‘𝑥))) supp 𝑍) ⊆ 𝐿) |
| 20 | 10, 19 | eqsstrd 3972 | 1 ⊢ (𝜑 → ((𝐴 ∘f 𝑂𝐵) supp 𝑍) ⊆ 𝐿) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ⊆ wss 3906 ↦ cmpt 5193 ⟶wf 6534 ‘cfv 6538 (class class class)co 7412 ∘f cof 7674 supp csupp 8157 |
| 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-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-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7676 df-supp 8158 |
| This theorem is referenced by: frlmup1 21929 psrbagev1 22209 jensen 27131 offinsupp1 33049 |
| Copyright terms: Public domain | W3C validator |