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

Theorem suppofss1d 8184
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 6692 . . . . . . 7 (𝜑𝐹 Fn 𝐴)
3 suppofssd.4 . . . . . . . 8 (𝜑𝐺:𝐴𝐵)
43ffnd 6692 . . . . . . 7 (𝜑𝐺 Fn 𝐴)
5 suppofssd.1 . . . . . . 7 (𝜑𝐴𝑉)
6 inidm 4178 . . . . . . 7 (𝐴𝐴) = 𝐴
7 eqidd 2763 . . . . . . 7 ((𝜑𝑦𝐴) → (𝐹𝑦) = (𝐹𝑦))
8 eqidd 2763 . . . . . . 7 ((𝜑𝑦𝐴) → (𝐺𝑦) = (𝐺𝑦))
92, 4, 5, 5, 6, 7, 8ofval 7671 . . . . . 6 ((𝜑𝑦𝐴) → ((𝐹f 𝑋𝐺)‘𝑦) = ((𝐹𝑦)𝑋(𝐺𝑦)))
109adantr 484 . . . . 5 (((𝜑𝑦𝐴) ∧ (𝐹𝑦) = 𝑍) → ((𝐹f 𝑋𝐺)‘𝑦) = ((𝐹𝑦)𝑋(𝐺𝑦)))
11 simpr 488 . . . . . 6 (((𝜑𝑦𝐴) ∧ (𝐹𝑦) = 𝑍) → (𝐹𝑦) = 𝑍)
1211oveq1d 7411 . . . . 5 (((𝜑𝑦𝐴) ∧ (𝐹𝑦) = 𝑍) → ((𝐹𝑦)𝑋(𝐺𝑦)) = (𝑍𝑋(𝐺𝑦)))
13 suppofss1d.5 . . . . . . . . 9 ((𝜑𝑥𝐵) → (𝑍𝑋𝑥) = 𝑍)
1413ralrimiva 3154 . . . . . . . 8 (𝜑 → ∀𝑥𝐵 (𝑍𝑋𝑥) = 𝑍)
1514adantr 484 . . . . . . 7 ((𝜑𝑦𝐴) → ∀𝑥𝐵 (𝑍𝑋𝑥) = 𝑍)
163ffvelcdmda 7065 . . . . . . . 8 ((𝜑𝑦𝐴) → (𝐺𝑦) ∈ 𝐵)
17 simpr 488 . . . . . . . . . 10 (((𝜑𝑦𝐴) ∧ 𝑥 = (𝐺𝑦)) → 𝑥 = (𝐺𝑦))
1817oveq2d 7412 . . . . . . . . 9 (((𝜑𝑦𝐴) ∧ 𝑥 = (𝐺𝑦)) → (𝑍𝑋𝑥) = (𝑍𝑋(𝐺𝑦)))
1918eqeq1d 2764 . . . . . . . 8 (((𝜑𝑦𝐴) ∧ 𝑥 = (𝐺𝑦)) → ((𝑍𝑋𝑥) = 𝑍 ↔ (𝑍𝑋(𝐺𝑦)) = 𝑍))
2016, 19rspcdv 3573 . . . . . . 7 ((𝜑𝑦𝐴) → (∀𝑥𝐵 (𝑍𝑋𝑥) = 𝑍 → (𝑍𝑋(𝐺𝑦)) = 𝑍))
2115, 20mpd 15 . . . . . 6 ((𝜑𝑦𝐴) → (𝑍𝑋(𝐺𝑦)) = 𝑍)
2221adantr 484 . . . . 5 (((𝜑𝑦𝐴) ∧ (𝐹𝑦) = 𝑍) → (𝑍𝑋(𝐺𝑦)) = 𝑍)
2310, 12, 223eqtrd 2801 . . . 4 (((𝜑𝑦𝐴) ∧ (𝐹𝑦) = 𝑍) → ((𝐹f 𝑋𝐺)‘𝑦) = 𝑍)
2423ex 416 . . 3 ((𝜑𝑦𝐴) → ((𝐹𝑦) = 𝑍 → ((𝐹f 𝑋𝐺)‘𝑦) = 𝑍))
2524ralrimiva 3154 . 2 (𝜑 → ∀𝑦𝐴 ((𝐹𝑦) = 𝑍 → ((𝐹f 𝑋𝐺)‘𝑦) = 𝑍))
262, 4, 5, 5, 6offn 7673 . . 3 (𝜑 → (𝐹f 𝑋𝐺) Fn 𝐴)
27 ssidd 3959 . . 3 (𝜑𝐴𝐴)
28 suppofssd.2 . . 3 (𝜑𝑍𝐵)
29 suppfnss 8169 . . 3 ((((𝐹f 𝑋𝐺) Fn 𝐴𝐹 Fn 𝐴) ∧ (𝐴𝐴𝐴𝑉𝑍𝐵)) → (∀𝑦𝐴 ((𝐹𝑦) = 𝑍 → ((𝐹f 𝑋𝐺)‘𝑦) = 𝑍) → ((𝐹f 𝑋𝐺) supp 𝑍) ⊆ (𝐹 supp 𝑍)))
3026, 2, 27, 5, 28, 29syl23anc 1396 . 2 (𝜑 → (∀𝑦𝐴 ((𝐹𝑦) = 𝑍 → ((𝐹f 𝑋𝐺)‘𝑦) = 𝑍) → ((𝐹f 𝑋𝐺) supp 𝑍) ⊆ (𝐹 supp 𝑍)))
3125, 30mpd 15 1 (𝜑 → ((𝐹f 𝑋𝐺) supp 𝑍) ⊆ (𝐹 supp 𝑍))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1560  wcel 2142  wral 3076  wss 3904   Fn wfn 6516  wf 6517  cfv 6521  (class class class)co 7396  f cof 7658   supp csupp 8140
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-ov 7399  df-oprab 7400  df-mpo 7401  df-of 7660  df-supp 8141
This theorem is referenced by:  frlmphllem  21832  rrxcph  25454
  Copyright terms: Public domain W3C validator