| 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 6663 | . . . 4 ⊢ (𝜑 → 𝐴 Fn 𝐷) |
| 3 | suppssof1.b | . . . . 5 ⊢ (𝜑 → 𝐵:𝐷⟶𝑅) | |
| 4 | 3 | ffnd 6663 | . . . 4 ⊢ (𝜑 → 𝐵 Fn 𝐷) |
| 5 | suppssof1.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑊) | |
| 6 | inidm 4162 | . . . 4 ⊢ (𝐷 ∩ 𝐷) = 𝐷 | |
| 7 | eqidd 2741 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴‘𝑥) = (𝐴‘𝑥)) | |
| 8 | eqidd 2741 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐵‘𝑥) = (𝐵‘𝑥)) | |
| 9 | 2, 4, 5, 5, 6, 7, 8 | offval 7636 | . . 3 ⊢ (𝜑 → (𝐴 ∘f 𝑂𝐵) = (𝑥 ∈ 𝐷 ↦ ((𝐴‘𝑥)𝑂(𝐵‘𝑥)))) |
| 10 | 9 | oveq1d 7378 | . 2 ⊢ (𝜑 → ((𝐴 ∘f 𝑂𝐵) supp 𝑍) = ((𝑥 ∈ 𝐷 ↦ ((𝐴‘𝑥)𝑂(𝐵‘𝑥))) supp 𝑍)) |
| 11 | 1 | feqmptd 6902 | . . . . 5 ⊢ (𝜑 → 𝐴 = (𝑥 ∈ 𝐷 ↦ (𝐴‘𝑥))) |
| 12 | 11 | oveq1d 7378 | . . . 4 ⊢ (𝜑 → (𝐴 supp 𝑌) = ((𝑥 ∈ 𝐷 ↦ (𝐴‘𝑥)) supp 𝑌)) |
| 13 | suppssof1.s | . . . 4 ⊢ (𝜑 → (𝐴 supp 𝑌) ⊆ 𝐿) | |
| 14 | 12, 13 | eqsstrrd 3957 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ (𝐴‘𝑥)) supp 𝑌) ⊆ 𝐿) |
| 15 | suppssof1.o | . . 3 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑅) → (𝑌𝑂𝑣) = 𝑍) | |
| 16 | fvexd 6849 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴‘𝑥) ∈ V) | |
| 17 | 3 | ffvelcdmda 7032 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐵‘𝑥) ∈ 𝑅) |
| 18 | suppssof1.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑈) | |
| 19 | 14, 15, 16, 17, 18 | suppssov1 8144 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ ((𝐴‘𝑥)𝑂(𝐵‘𝑥))) supp 𝑍) ⊆ 𝐿) |
| 20 | 10, 19 | eqsstrd 3956 | 1 ⊢ (𝜑 → ((𝐴 ∘f 𝑂𝐵) supp 𝑍) ⊆ 𝐿) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 Vcvv 3432 ⊆ wss 3890 ↦ cmpt 5160 ⟶wf 6488 ‘cfv 6492 (class class class)co 7363 ∘f cof 7625 supp csupp 8107 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pr 5369 ax-un 7685 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7366 df-oprab 7367 df-mpo 7368 df-of 7627 df-supp 8108 |
| This theorem is referenced by: frlmup1 21780 psrbagev1 22060 jensen 26977 offinsupp1 32825 |
| Copyright terms: Public domain | W3C validator |