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

Theorem suppcoss 8227
Description: The support of the composition of two functions is a subset of the support of the inner function if the outer function preserves zero. Compare suppssfv 8222, which has a sethood condition on 𝐴 instead of 𝐵. (Contributed by SN, 25-May-2024.)
Hypotheses
Ref Expression
suppcoss.f (𝜑 → 𝐹 Fn 𝐴)
suppcoss.g (𝜑 → 𝐺:𝐵⟶𝐴)
suppcoss.b (𝜑 → 𝐵 ∈ 𝑊)
suppcoss.y (𝜑 → 𝑌 ∈ 𝑉)
suppcoss.1 (𝜑 → (𝐹‘𝑌) = 𝑍)
Assertion
Ref Expression
suppcoss (𝜑 → ((𝐹 ∘ 𝐺) supp 𝑍) ⊆ (𝐺 supp 𝑌))

Proof of Theorem suppcoss
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 suppcoss.f . . . 4 (𝜑 → 𝐹 Fn 𝐴)
2 dffn3 6722 . . . 4 (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹)
31, 2sylib 221 . . 3 (𝜑 → 𝐹:𝐴⟶ran 𝐹)
4 suppcoss.g . . 3 (𝜑 → 𝐺:𝐵⟶𝐴)
53, 4fcod 6735 . 2 (𝜑 → (𝐹 ∘ 𝐺):𝐵⟶ran 𝐹)
6 eldif 4049 . . . . 5 (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑌)))
74ffnd 6710 . . . . . . . . 9 (𝜑 → 𝐺 Fn 𝐵)
8 suppcoss.b . . . . . . . . 9 (𝜑 → 𝐵 ∈ 𝑊)
9 suppcoss.y . . . . . . . . 9 (𝜑 → 𝑌 ∈ 𝑉)
10 elsuppfn 8190 . . . . . . . . 9 ((𝐺 Fn 𝐵 ∧ 𝐵 ∈ 𝑊 ∧ 𝑌 ∈ 𝑉) → (𝑘 ∈ (𝐺 supp 𝑌) ↔ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)))
117, 8, 9, 10syl3anc 1398 . . . . . . . 8 (𝜑 → (𝑘 ∈ (𝐺 supp 𝑌) ↔ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)))
1211notbid 321 . . . . . . 7 (𝜑 → (¬ 𝑘 ∈ (𝐺 supp 𝑌) ↔ ¬ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)))
1312anbi2d 642 . . . . . 6 (𝜑 → ((𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌))))
14 annotanannot 848 . . . . . 6 ((𝑘 ∈ 𝐵 ∧ ¬ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) ≠ 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌))
1513, 14bitrdi 290 . . . . 5 (𝜑 → ((𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌)))
166, 15bitrid 286 . . . 4 (𝜑 → (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌)))
17 nne 2959 . . . . . 6 (¬ (𝐺‘𝑘) ≠ 𝑌 ↔ (𝐺‘𝑘) = 𝑌)
1817anbi2i 635 . . . . 5 ((𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌) ↔ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌))
194adantr 486 . . . . . . . 8 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → 𝐺:𝐵⟶𝐴)
20 simprl 783 . . . . . . . 8 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → 𝑘 ∈ 𝐵)
2119, 20fvco3d 6986 . . . . . . 7 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = (𝐹‘(𝐺‘𝑘)))
22 simprr 785 . . . . . . . 8 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐺‘𝑘) = 𝑌)
2322fveq2d 6889 . . . . . . 7 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐹‘(𝐺‘𝑘)) = (𝐹‘𝑌))
24 suppcoss.1 . . . . . . . 8 (𝜑 → (𝐹‘𝑌) = 𝑍)
2524adantr 486 . . . . . . 7 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐹‘𝑌) = 𝑍)
2621, 23, 253eqtrd 2799 . . . . . 6 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍)
2726ex 418 . . . . 5 (𝜑 → ((𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
2818, 27biimtrid 245 . . . 4 (𝜑 → ((𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
2916, 28sylbid 243 . . 3 (𝜑 → (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
3029imp 412 . 2 ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌))) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍)
315, 30suppss 8214 1 (𝜑 → ((𝐹 ∘ 𝐺) supp 𝑍) ⊆ (𝐺 supp 𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955   ⊆ wss 3895   ∖ cdif 4045  ran crn 5651   ∘ ccom 5654   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420   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-supp 8180
This theorem is used by:  mplsubglem  22311  mhpinvcl  22478
  Copyright terms: Public domain W3C validator