MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  suppssof1 Structured version   Visualization version   GIF version

Theorem suppssof1 8204
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.)
Hypotheses
Ref Expression
suppssof1.s (𝜑 → (𝐴 supp 𝑌) ⊆ 𝐿)
suppssof1.o ((𝜑𝑣𝑅) → (𝑌𝑂𝑣) = 𝑍)
suppssof1.a (𝜑𝐴:𝐷𝑉)
suppssof1.b (𝜑𝐵:𝐷𝑅)
suppssof1.d (𝜑𝐷𝑊)
suppssof1.y (𝜑𝑌𝑈)
Assertion
Ref Expression
suppssof1 (𝜑 → ((𝐴f 𝑂𝐵) supp 𝑍) ⊆ 𝐿)
Distinct variable groups:   𝜑,𝑣   𝑣,𝐵   𝑣,𝑂   𝑣,𝑅   𝑣,𝑌   𝑣,𝑍
Allowed substitution hints:   𝐴(𝑣)   𝐷(𝑣)   𝑈(𝑣)   𝐿(𝑣)   𝑉(𝑣)   𝑊(𝑣)

Proof of Theorem suppssof1
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 suppssof1.a . . . . 5 (𝜑𝐴:𝐷𝑉)
21ffnd 6713 . . . 4 (𝜑𝐴 Fn 𝐷)
3 suppssof1.b . . . . 5 (𝜑𝐵:𝐷𝑅)
43ffnd 6713 . . . 4 (𝜑𝐵 Fn 𝐷)
5 suppssof1.d . . . 4 (𝜑𝐷𝑊)
6 inidm 4182 . . . 4 (𝐷𝐷) = 𝐷
7 eqidd 2767 . . . 4 ((𝜑𝑥𝐷) → (𝐴𝑥) = (𝐴𝑥))
8 eqidd 2767 . . . 4 ((𝜑𝑥𝐷) → (𝐵𝑥) = (𝐵𝑥))
92, 4, 5, 5, 6, 7, 8offval 7696 . . 3 (𝜑 → (𝐴f 𝑂𝐵) = (𝑥𝐷 ↦ ((𝐴𝑥)𝑂(𝐵𝑥))))
109oveq1d 7438 . 2 (𝜑 → ((𝐴f 𝑂𝐵) supp 𝑍) = ((𝑥𝐷 ↦ ((𝐴𝑥)𝑂(𝐵𝑥))) supp 𝑍))
111feqmptd 6956 . . . . 5 (𝜑𝐴 = (𝑥𝐷 ↦ (𝐴𝑥)))
1211oveq1d 7438 . . . 4 (𝜑 → (𝐴 supp 𝑌) = ((𝑥𝐷 ↦ (𝐴𝑥)) supp 𝑌))
13 suppssof1.s . . . 4 (𝜑 → (𝐴 supp 𝑌) ⊆ 𝐿)
1412, 13eqsstrrd 3975 . . 3 (𝜑 → ((𝑥𝐷 ↦ (𝐴𝑥)) supp 𝑌) ⊆ 𝐿)
15 suppssof1.o . . 3 ((𝜑𝑣𝑅) → (𝑌𝑂𝑣) = 𝑍)
16 fvexd 6903 . . 3 ((𝜑𝑥𝐷) → (𝐴𝑥) ∈ V)
173ffvelcdmda 7086 . . 3 ((𝜑𝑥𝐷) → (𝐵𝑥) ∈ 𝑅)
18 suppssof1.y . . 3 (𝜑𝑌𝑈)
1914, 15, 16, 17, 18suppssov1 8202 . 2 (𝜑 → ((𝑥𝐷 ↦ ((𝐴𝑥)𝑂(𝐵𝑥))) supp 𝑍) ⊆ 𝐿)
2010, 19eqsstrd 3974 1 (𝜑 → ((𝐴f 𝑂𝐵) supp 𝑍) ⊆ 𝐿)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  Vcvv 3458  wss 3908  cmpt 5197  wf 6539  cfv 6543  (class class class)co 7423  f cof 7685   supp csupp 8165
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pr 5409  ax-un 7745
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-of 7687  df-supp 8166
This theorem is used by:  frlmup1  21985  psrbagev1  22265  jensen  27190  offinsupp1  33108
  Copyright terms: Public domain W3C validator