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

Theorem suppun 8229
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 4179 . . . . . 6 (◡𝐹 “ (V ∖ {𝑍})) ⊆ ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍})))
2 cnvun 6145 . . . . . . . 8 ◡(𝐹 ∪ 𝐺) = (◡𝐹 ∪ ◡𝐺)
32imaeq1i 6061 . . . . . . 7 (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 ∪ ◡𝐺) “ (V ∖ {𝑍}))
4 imaundir 6154 . . . . . . 7 ((◡𝐹 ∪ ◡𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍})))
53, 4eqtri 2786 . . . . . 6 (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍})))
61, 5sseqtrri 3962 . . . . 5 (◡𝐹 “ (V ∖ {𝑍})) ⊆ (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍}))
76a1i 11 . . . 4 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (◡𝐹 “ (V ∖ {𝑍})) ⊆ (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})))
8 suppimacnv 8219 . . . . 5 ((𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍})))
98adantr 486 . . . 4 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍})))
10 suppun.g . . . . . 6 (𝜑 → 𝐺 ∈ 𝑉)
11 unexg 7784 . . . . . . 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 8219 . . . . 5 (((𝐹 ∪ 𝐺) ∈ V ∧ 𝑍 ∈ V) → ((𝐹 ∪ 𝐺) supp 𝑍) = (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})))
1613, 14, 15syl2anc 596 . . . 4 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → ((𝐹 ∪ 𝐺) supp 𝑍) = (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})))
177, 9, 163sstr4d 3968 . . 3 (((𝐹 ∈ V ∧ 𝑍 ∈ V) ∧ 𝜑) → (𝐹 supp 𝑍) ⊆ ((𝐹 ∪ 𝐺) supp 𝑍))
1817ex 418 . 2 ((𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝜑 → (𝐹 supp 𝑍) ⊆ ((𝐹 ∪ 𝐺) supp 𝑍)))
19 supp0prc 8207 . . . 4 (¬ (𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 supp 𝑍) = ∅)
20 0ss 4353 . . . 4 ∅ ⊆ ((𝐹 ∪ 𝐺) supp 𝑍)
2119, 20eqsstrdi 3957 . . 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 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048   ∪ cun 4152  ∅c0 4281  {csn 4588  ◡ccnv 5654   “ cima 5658  (class class class)co 7443   supp csupp 8204
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7775
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 2102  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-rab 3417  df-v 3456  df-sbc 3743  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-br 5107  df-opab 5171  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 6512  df-fun 6560  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-supp 8205
This theorem is used by:  fsuppunbi  9408  gsumzaddlem  20165
  Copyright terms: Public domain W3C validator