| 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 6710 | . . . 4 ⊢ (𝜑 → 𝐴 Fn 𝐷) |
| 3 | suppssof1.b | . . . . 5 ⊢ (𝜑 → 𝐵:𝐷⟶𝑅) | |
| 4 | 3 | ffnd 6710 | . . . 4 ⊢ (𝜑 → 𝐵 Fn 𝐷) |
| 5 | suppssof1.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑊) | |
| 6 | inidm 4123 | . . . 4 ⊢ (𝐷 ∩ 𝐷) = 𝐷 | |
| 7 | eqidd 2761 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴‘𝑥) = (𝐴‘𝑥)) | |
| 8 | eqidd 2761 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐵‘𝑥) = (𝐵‘𝑥)) | |
| 9 | 2, 4, 5, 5, 6, 7, 8 | offval 7702 | . . 3 ⊢ (𝜑 → (𝐴 ∘f 𝑂𝐵) = (𝑥 ∈ 𝐷 ↦ ((𝐴‘𝑥)𝑂(𝐵‘𝑥)))) |
| 10 | 9 | oveq1d 7435 | . 2 ⊢ (𝜑 → ((𝐴 ∘f 𝑂𝐵) supp 𝑍) = ((𝑥 ∈ 𝐷 ↦ ((𝐴‘𝑥)𝑂(𝐵‘𝑥))) supp 𝑍)) |
| 11 | 1 | feqmptd 6953 | . . . . 5 ⊢ (𝜑 → 𝐴 = (𝑥 ∈ 𝐷 ↦ (𝐴‘𝑥))) |
| 12 | 11 | oveq1d 7435 | . . . 4 ⊢ (𝜑 → (𝐴 supp 𝑌) = ((𝑥 ∈ 𝐷 ↦ (𝐴‘𝑥)) supp 𝑌)) |
| 13 | suppssof1.s | . . . 4 ⊢ (𝜑 → (𝐴 supp 𝑌) ⊆ 𝐿) | |
| 14 | 12, 13 | eqsstrrd 3943 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ (𝐴‘𝑥)) supp 𝑌) ⊆ 𝐿) |
| 15 | suppssof1.o | . . 3 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑅) → (𝑌𝑂𝑣) = 𝑍) | |
| 16 | fvexd 6900 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐴‘𝑥) ∈ V) | |
| 17 | 3 | ffvelcdmda 7084 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐵‘𝑥) ∈ 𝑅) |
| 18 | suppssof1.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑈) | |
| 19 | 14, 15, 16, 17, 18 | suppssov1 8217 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ ((𝐴‘𝑥)𝑂(𝐵‘𝑥))) supp 𝑍) ⊆ 𝐿) |
| 20 | 10, 19 | eqsstrd 3942 | 1 ⊢ (𝜑 → ((𝐴 ∘f 𝑂𝐵) supp 𝑍) ⊆ 𝐿) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ⊆ wss 3895 ↦ cmpt 5185 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 ∘f cof 7691 supp csupp 8179 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 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 7423 df-oprab 7424 df-mpo 7425 df-of 7693 df-supp 8180 |
| This theorem is used by: frlmup1 22109 psrbagev1 22391 jensen 27321 offinsupp1 33364 |
| Copyright terms: Public domain | W3C validator |