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

Theorem suppun 8204
Description: The support of a class/function is a subset of the support of the union of this class/function with another class/function. (Contributed by AV, 4-Jun-2019.)
Hypothesis
Ref Expression
suppun.g (𝜑 → 𝐺 ∈ 𝑉)
Assertion
Ref Expression
suppun (𝜑 → (𝐹 supp 𝑍) ⊆ ((𝐹 ∪ 𝐺) supp 𝑍))

Proof of Theorem suppun
StepHypRef Expression
1 ssun1 4176 . . . . . 6 (◡𝐹 “ (V ∖ {𝑍})) ⊆ ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍})))
2 cnvun 6132 . . . . . . . 8 ◡(𝐹 ∪ 𝐺) = (◡𝐹 ∪ ◡𝐺)
32imaeq1i 6048 . . . . . . 7 (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 ∪ ◡𝐺) “ (V ∖ {𝑍}))
4 imaundir 6141 . . . . . . 7 ((◡𝐹 ∪ ◡𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍})))
53, 4eqtri 2783 . . . . . 6 (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍})))
61, 5sseqtrri 3957 . . . . 5 (◡𝐹 “ (V ∖ {𝑍})) ⊆ (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍}))
76a1i 11 . . . 4 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (◡𝐹 “ (V ∖ {𝑍})) ⊆ (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})))
8 suppimacnv 8194 . . . . 5 ((𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍})))
98adantr 486 . . . 4 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍})))
10 suppun.g . . . . . 6 (𝜑 → 𝐺 ∈ 𝑉)
11 unexg 7760 . . . . . . 7 ((𝐹 ∈ V ∧ 𝐺 ∈ 𝑉) → (𝐹 ∪ 𝐺) ∈ V)
1211adantlr 728 . . . . . 6 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝐺 ∈ 𝑉) → (𝐹 ∪ 𝐺) ∈ V)
1310, 12sylan2 605 . . . . 5 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝐹 ∪ 𝐺) ∈ V)
14 simplr 781 . . . . 5 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → 𝑍 ∈ V)
15 suppimacnv 8194 . . . . 5 (((𝐹 ∪ 𝐺) ∈ V ∧ 𝑍 ∈ V) → ((𝐹 ∪ 𝐺) supp 𝑍) = (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})))
1613, 14, 15syl2anc 596 . . . 4 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → ((𝐹 ∪ 𝐺) supp 𝑍) = (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})))
177, 9, 163sstr4d 3963 . . 3 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝐹 supp 𝑍) ⊆ ((𝐹 ∪ 𝐺) supp 𝑍))
1817ex 418 . 2 ((𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝜑 → (𝐹 supp 𝑍) ⊆ ((𝐹 ∪ 𝐺) supp 𝑍)))
19 supp0prc 8182 . . . 4 (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) = ∅)
20 0ss 4349 . . . 4 ∅ ⊆ ((𝐹 ∪ 𝐺) supp 𝑍)
2119, 20eqsstrdi 3952 . . 3 (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) ⊆ ((𝐹 ∪ 𝐺) supp 𝑍))
2221a1d 26 . 2 (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝜑 → (𝐹 supp 𝑍) ⊆ ((𝐹 ∪ 𝐺) supp 𝑍)))
2318, 22pm2.61i 184 1 (𝜑 → (𝐹 supp 𝑍) ⊆ ((𝐹 ∪ 𝐺) supp 𝑍))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895   ∖ cdif 4045   ∪ cun 4149  ∅c0 4278  {csn 4584  ◡ccnv 5649   “ cima 5653  (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-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-rab 3413  df-v 3452  df-sbc 3739  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-br 5103  df-opab 5167  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-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-supp 8180
This theorem is used by:  fsuppunbi  9384  gsumzaddlem  20140
  Copyright terms: Public domain W3C validator