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

Theorem suppofss1d 8203
Description: Condition for the support of a function operation to be a subset of the support of the left function term. (Contributed by Thierry Arnoux, 21-Jun-2019.)
Hypotheses
Ref Expression
suppofssd.1 (𝜑𝐴𝑉)
suppofssd.2 (𝜑𝑍𝐵)
suppofssd.3 (𝜑𝐹:𝐴𝐵)
suppofssd.4 (𝜑𝐺:𝐴𝐵)
suppofss1d.5 ((𝜑𝑥𝐵) → (𝑍𝑋𝑥) = 𝑍)
Assertion
Ref Expression
suppofss1d (𝜑 → ((𝐹f 𝑋𝐺) supp 𝑍) ⊆ (𝐹 supp 𝑍))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹   𝑥,𝐺   𝑥,𝑋   𝑥,𝑍   𝜑,𝑥
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem suppofss1d
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 suppofssd.3 . . . . . . . 8 (𝜑𝐹:𝐴𝐵)
21ffnd 6707 . . . . . . 7 (𝜑𝐹 Fn 𝐴)
3 suppofssd.4 . . . . . . . 8 (𝜑𝐺:𝐴𝐵)
43ffnd 6707 . . . . . . 7 (𝜑𝐺 Fn 𝐴)
5 suppofssd.1 . . . . . . 7 (𝜑𝐴𝑉)
6 inidm 4202 . . . . . . 7 (𝐴𝐴) = 𝐴
7 eqidd 2736 . . . . . . 7 ((𝜑𝑦𝐴) → (𝐹𝑦) = (𝐹𝑦))
8 eqidd 2736 . . . . . . 7 ((𝜑𝑦𝐴) → (𝐺𝑦) = (𝐺𝑦))
92, 4, 5, 5, 6, 7, 8ofval 7682 . . . . . 6 ((𝜑𝑦𝐴) → ((𝐹f 𝑋𝐺)‘𝑦) = ((𝐹𝑦)𝑋(𝐺𝑦)))
109adantr 480 . . . . 5 (((𝜑𝑦𝐴) ∧ (𝐹𝑦) = 𝑍) → ((𝐹f 𝑋𝐺)‘𝑦) = ((𝐹𝑦)𝑋(𝐺𝑦)))
11 simpr 484 . . . . . 6 (((𝜑𝑦𝐴) ∧ (𝐹𝑦) = 𝑍) → (𝐹𝑦) = 𝑍)
1211oveq1d 7420 . . . . 5 (((𝜑𝑦𝐴) ∧ (𝐹𝑦) = 𝑍) → ((𝐹𝑦)𝑋(𝐺𝑦)) = (𝑍𝑋(𝐺𝑦)))
13 suppofss1d.5 . . . . . . . . 9 ((𝜑𝑥𝐵) → (𝑍𝑋𝑥) = 𝑍)
1413ralrimiva 3132 . . . . . . . 8 (𝜑 → ∀𝑥𝐵 (𝑍𝑋𝑥) = 𝑍)
1514adantr 480 . . . . . . 7 ((𝜑𝑦𝐴) → ∀𝑥𝐵 (𝑍𝑋𝑥) = 𝑍)
163ffvelcdmda 7074 . . . . . . . 8 ((𝜑𝑦𝐴) → (𝐺𝑦) ∈ 𝐵)
17 simpr 484 . . . . . . . . . 10 (((𝜑𝑦𝐴) ∧ 𝑥 = (𝐺𝑦)) → 𝑥 = (𝐺𝑦))
1817oveq2d 7421 . . . . . . . . 9 (((𝜑𝑦𝐴) ∧ 𝑥 = (𝐺𝑦)) → (𝑍𝑋𝑥) = (𝑍𝑋(𝐺𝑦)))
1918eqeq1d 2737 . . . . . . . 8 (((𝜑𝑦𝐴) ∧ 𝑥 = (𝐺𝑦)) → ((𝑍𝑋𝑥) = 𝑍 ↔ (𝑍𝑋(𝐺𝑦)) = 𝑍))
2016, 19rspcdv 3593 . . . . . . 7 ((𝜑𝑦𝐴) → (∀𝑥𝐵 (𝑍𝑋𝑥) = 𝑍 → (𝑍𝑋(𝐺𝑦)) = 𝑍))
2115, 20mpd 15 . . . . . 6 ((𝜑𝑦𝐴) → (𝑍𝑋(𝐺𝑦)) = 𝑍)
2221adantr 480 . . . . 5 (((𝜑𝑦𝐴) ∧ (𝐹𝑦) = 𝑍) → (𝑍𝑋(𝐺𝑦)) = 𝑍)
2310, 12, 223eqtrd 2774 . . . 4 (((𝜑𝑦𝐴) ∧ (𝐹𝑦) = 𝑍) → ((𝐹f 𝑋𝐺)‘𝑦) = 𝑍)
2423ex 412 . . 3 ((𝜑𝑦𝐴) → ((𝐹𝑦) = 𝑍 → ((𝐹f 𝑋𝐺)‘𝑦) = 𝑍))
2524ralrimiva 3132 . 2 (𝜑 → ∀𝑦𝐴 ((𝐹𝑦) = 𝑍 → ((𝐹f 𝑋𝐺)‘𝑦) = 𝑍))
262, 4, 5, 5, 6offn 7684 . . 3 (𝜑 → (𝐹f 𝑋𝐺) Fn 𝐴)
27 ssidd 3982 . . 3 (𝜑𝐴𝐴)
28 suppofssd.2 . . 3 (𝜑𝑍𝐵)
29 suppfnss 8188 . . 3 ((((𝐹f 𝑋𝐺) Fn 𝐴𝐹 Fn 𝐴) ∧ (𝐴𝐴𝐴𝑉𝑍𝐵)) → (∀𝑦𝐴 ((𝐹𝑦) = 𝑍 → ((𝐹f 𝑋𝐺)‘𝑦) = 𝑍) → ((𝐹f 𝑋𝐺) supp 𝑍) ⊆ (𝐹 supp 𝑍)))
3026, 2, 27, 5, 28, 29syl23anc 1379 . 2 (𝜑 → (∀𝑦𝐴 ((𝐹𝑦) = 𝑍 → ((𝐹f 𝑋𝐺)‘𝑦) = 𝑍) → ((𝐹f 𝑋𝐺) supp 𝑍) ⊆ (𝐹 supp 𝑍)))
3125, 30mpd 15 1 (𝜑 → ((𝐹f 𝑋𝐺) supp 𝑍) ⊆ (𝐹 supp 𝑍))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  wral 3051  wss 3926   Fn wfn 6526  wf 6527  cfv 6531  (class class class)co 7405  f cof 7669   supp csupp 8159
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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pr 5402  ax-un 7729
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 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7408  df-oprab 7409  df-mpo 7410  df-of 7671  df-supp 8160
This theorem is referenced by:  frlmphllem  21740  rrxcph  25344
  Copyright terms: Public domain W3C validator