| 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 6653 | . . . 4 ⊢ (𝜑 → 𝐴 Fn 𝐷) |
| 3 | suppssof1.b | . . . . 5 ⊢ (𝜑 → 𝐵:𝐷⟶𝑅) | |
| 4 | 3 | ffnd 6653 | . . . 4 ⊢ (𝜑 → 𝐵 Fn 𝐷) |
| 5 | suppssof1.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑊) | |
| 6 | inidm 4178 | . . . 4 ⊢ (𝐷 ∩ 𝐷) = 𝐷 | |
| 7 | eqidd 2730 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴‘𝑥) = (𝐴‘𝑥)) | |
| 8 | eqidd 2730 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐵‘𝑥) = (𝐵‘𝑥)) | |
| 9 | 2, 4, 5, 5, 6, 7, 8 | offval 7622 | . . 3 ⊢ (𝜑 → (𝐴 ∘f 𝑂𝐵) = (𝑥 ∈ 𝐷 ↦ ((𝐴‘𝑥)𝑂(𝐵‘𝑥)))) |
| 10 | 9 | oveq1d 7364 | . 2 ⊢ (𝜑 → ((𝐴 ∘f 𝑂𝐵) supp 𝑍) = ((𝑥 ∈ 𝐷 ↦ ((𝐴‘𝑥)𝑂(𝐵‘𝑥))) supp 𝑍)) |
| 11 | 1 | feqmptd 6891 | . . . . 5 ⊢ (𝜑 → 𝐴 = (𝑥 ∈ 𝐷 ↦ (𝐴‘𝑥))) |
| 12 | 11 | oveq1d 7364 | . . . 4 ⊢ (𝜑 → (𝐴 supp 𝑌) = ((𝑥 ∈ 𝐷 ↦ (𝐴‘𝑥)) supp 𝑌)) |
| 13 | suppssof1.s | . . . 4 ⊢ (𝜑 → (𝐴 supp 𝑌) ⊆ 𝐿) | |
| 14 | 12, 13 | eqsstrrd 3971 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ (𝐴‘𝑥)) supp 𝑌) ⊆ 𝐿) |
| 15 | suppssof1.o | . . 3 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑅) → (𝑌𝑂𝑣) = 𝑍) | |
| 16 | fvexd 6837 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴‘𝑥) ∈ V) | |
| 17 | 3 | ffvelcdmda 7018 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐵‘𝑥) ∈ 𝑅) |
| 18 | suppssof1.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑈) | |
| 19 | 14, 15, 16, 17, 18 | suppssov1 8130 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ ((𝐴‘𝑥)𝑂(𝐵‘𝑥))) supp 𝑍) ⊆ 𝐿) |
| 20 | 10, 19 | eqsstrd 3970 | 1 ⊢ (𝜑 → ((𝐴 ∘f 𝑂𝐵) supp 𝑍) ⊆ 𝐿) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 Vcvv 3436 ⊆ wss 3903 ↦ cmpt 5173 ⟶wf 6478 ‘cfv 6482 (class class class)co 7349 ∘f cof 7611 supp csupp 8093 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pr 5371 ax-un 7671 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-ov 7352 df-oprab 7353 df-mpo 7354 df-of 7613 df-supp 8094 |
| This theorem is referenced by: frlmup1 21705 psrbagev1 21982 jensen 26897 offinsupp1 32678 |
| Copyright terms: Public domain | W3C validator |