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

Theorem suppcoss 8208
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 8203, 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 6714 . . . 4 (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹)
31, 2sylib 221 . . 3 (𝜑 → 𝐹:𝐴⟶ran 𝐹)
4 suppcoss.g . . 3 (𝜑 → 𝐺:𝐵⟶𝐴)
53, 4fcod 6727 . 2 (𝜑 → (𝐹 ∘ 𝐺):𝐵⟶ran 𝐹)
6 eldif 3909 . . . . 5 (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) ↔ (𝑘 ∈ 𝐵 ∧ ¬ 𝑘 ∈ (𝐺 supp 𝑌)))
74ffnd 6702 . . . . . . . . 9 (𝜑 → 𝐺 Fn 𝐵)
8 suppcoss.b . . . . . . . . 9 (𝜑 → 𝐵 ∈ 𝑊)
9 suppcoss.y . . . . . . . . 9 (𝜑 → 𝑌 ∈ 𝑉)
10 elsuppfn 8171 . . . . . . . . 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 2960 . . . . . 6 (¬ (𝐺‘𝑘) ≠ 𝑌 ↔ (𝐺‘𝑘) = 𝑌)
1817anbi2i 635 . . . . 5 ((𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌) ↔ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌))
194adantr 486 . . . . . . . 8 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → 𝐺:𝐵⟶𝐴)
20 simprl 783 . . . . . . . 8 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → 𝑘 ∈ 𝐵)
2119, 20fvco3d 6978 . . . . . . 7 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = (𝐹‘(𝐺‘𝑘)))
22 simprr 785 . . . . . . . 8 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐺‘𝑘) = 𝑌)
2322fveq2d 6881 . . . . . . 7 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐹‘(𝐺‘𝑘)) = (𝐹‘𝑌))
24 suppcoss.1 . . . . . . . 8 (𝜑 → (𝐹‘𝑌) = 𝑍)
2524adantr 486 . . . . . . 7 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → (𝐹‘𝑌) = 𝑍)
2621, 23, 253eqtrd 2800 . . . . . 6 ((𝜑 ∧ (𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍)
2726ex 418 . . . . 5 (𝜑 → ((𝑘 ∈ 𝐵 ∧ (𝐺‘𝑘) = 𝑌) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
2818, 27biimtrid 245 . . . 4 (𝜑 → ((𝑘 ∈ 𝐵 ∧ ¬ (𝐺‘𝑘) ≠ 𝑌) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
2916, 28sylbid 243 . . 3 (𝜑 → (𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌)) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍))
3029imp 412 . 2 ((𝜑 ∧ 𝑘 ∈ (𝐵 ∖ (𝐺 supp 𝑌))) → ((𝐹 ∘ 𝐺)‘𝑘) = 𝑍)
315, 30suppss 8195 1 (𝜑 → ((𝐹 ∘ 𝐺) supp 𝑍) ⊆ (𝐺 supp 𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2956   ∖ cdif 3896   ⊆ wss 3899  ran crn 5652   ∘ ccom 5655   Fn wfn 6526  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412   supp csupp 8161
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-supp 8162
This theorem is used by:  mplsubglem  22286  mhpinvcl  22453
  Copyright terms: Public domain W3C validator