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

Theorem suppofss1d 8235
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 6721 . . . . . . 7 (𝜑 → 𝐹 Fn 𝐴)
3 suppofssd.4 . . . . . . . 8 (𝜑 → 𝐺:𝐴⟶𝐵)
43ffnd 6721 . . . . . . 7 (𝜑 → 𝐺 Fn 𝐴)
5 suppofssd.1 . . . . . . 7 (𝜑 → 𝐴 ∈ 𝑉)
6 inidm 4126 . . . . . . 7 (𝐴 ∩ 𝐴) = 𝐴
7 eqidd 2764 . . . . . . 7 ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) = (𝐹‘𝑦))
8 eqidd 2764 . . . . . . 7 ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐺‘𝑦) = (𝐺‘𝑦))
92, 4, 5, 5, 6, 7, 8ofval 7714 . . . . . 6 ((𝜑 ∧ 𝑦 ∈ 𝐴) → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = ((𝐹‘𝑦)𝑋(𝐺‘𝑦)))
109adantr 486 . . . . 5 (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑦) = 𝑍) → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = ((𝐹‘𝑦)𝑋(𝐺‘𝑦)))
11 simpr 490 . . . . . 6 (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑦) = 𝑍) → (𝐹‘𝑦) = 𝑍)
1211oveq1d 7445 . . . . 5 (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑦) = 𝑍) → ((𝐹‘𝑦)𝑋(𝐺‘𝑦)) = (𝑍𝑋(𝐺‘𝑦)))
13 suppofss1d.5 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑍𝑋𝑥) = 𝑍)
1413ralrimiva 3158 . . . . . . . 8 (𝜑 → ∀𝑥 ∈ 𝐵 (𝑍𝑋𝑥) = 𝑍)
1514adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑦 ∈ 𝐴) → ∀𝑥 ∈ 𝐵 (𝑍𝑋𝑥) = 𝑍)
163ffvelcdmda 7095 . . . . . . . 8 ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐺‘𝑦) ∈ 𝐵)
17 simpr 490 . . . . . . . . . 10 (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 = (𝐺‘𝑦)) → 𝑥 = (𝐺‘𝑦))
1817oveq2d 7446 . . . . . . . . 9 (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 = (𝐺‘𝑦)) → (𝑍𝑋𝑥) = (𝑍𝑋(𝐺‘𝑦)))
1918eqeq1d 2765 . . . . . . . 8 (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 = (𝐺‘𝑦)) → ((𝑍𝑋𝑥) = 𝑍 ↔ (𝑍𝑋(𝐺‘𝑦)) = 𝑍))
2016, 19rspcdv 3572 . . . . . . 7 ((𝜑 ∧ 𝑦 ∈ 𝐴) → (∀𝑥 ∈ 𝐵 (𝑍𝑋𝑥) = 𝑍 → (𝑍𝑋(𝐺‘𝑦)) = 𝑍))
2115, 20mpd 16 . . . . . 6 ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝑍𝑋(𝐺‘𝑦)) = 𝑍)
2221adantr 486 . . . . 5 (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑦) = 𝑍) → (𝑍𝑋(𝐺‘𝑦)) = 𝑍)
2310, 12, 223eqtrd 2802 . . . 4 (((𝜑 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑦) = 𝑍) → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍)
2423ex 418 . . 3 ((𝜑 ∧ 𝑦 ∈ 𝐴) → ((𝐹‘𝑦) = 𝑍 → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍))
2524ralrimiva 3158 . 2 (𝜑 → ∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = 𝑍 → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍))
262, 4, 5, 5, 6offn 7716 . . 3 (𝜑 → (𝐹 ∘f 𝑋𝐺) Fn 𝐴)
27 ssidd 3936 . . 3 (𝜑 → 𝐴 ⊆ 𝐴)
28 suppofssd.2 . . 3 (𝜑 → 𝑍 ∈ 𝐵)
29 suppfnss 8220 . . 3 ((((𝐹 ∘f 𝑋𝐺) Fn 𝐴 ∧ 𝐹 Fn 𝐴) ∧ (𝐴 ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑍 ∈ 𝐵)) → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = 𝑍 → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍) → ((𝐹 ∘f 𝑋𝐺) supp 𝑍) ⊆ (𝐹 supp 𝑍)))
3026, 2, 27, 5, 28, 29syl23anc 1404 . 2 (𝜑 → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑦) = 𝑍 → ((𝐹 ∘f 𝑋𝐺)‘𝑦) = 𝑍) → ((𝐹 ∘f 𝑋𝐺) supp 𝑍) ⊆ (𝐹 supp 𝑍)))
3125, 30mpd 16 1 (𝜑 → ((𝐹 ∘f 𝑋𝐺) supp 𝑍) ⊆ (𝐹 supp 𝑍))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∀wral 3080   ⊆ wss 3900   Fn wfn 6542  ⟶wf 6543  ‘cfv 6547  (class class class)co 7430   ∘f cof 7701   supp csupp 8190
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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7761
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 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-of 7703  df-supp 8191
This theorem is used by:  frlmphllem  22101  rrxcph  25728
  Copyright terms: Public domain W3C validator