Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  suppun2 Structured version   Visualization version   GIF version

Theorem suppun2 33277
Description: The support of a union is the union of the supports. (Contributed by Thierry Arnoux, 5-Oct-2025.)
Hypotheses
Ref Expression
suppun2.1 (𝜑 → 𝐹 ∈ 𝑉)
suppun2.2 (𝜑 → 𝐺 ∈ 𝑊)
suppun2.3 (𝜑 → 𝑍 ∈ 𝑋)
Assertion
Ref Expression
suppun2 (𝜑 → ((𝐹 ∪ 𝐺) supp 𝑍) = ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)))

Proof of Theorem suppun2
StepHypRef Expression
1 cnvun 6133 . . . 4 ◡(𝐹 ∪ 𝐺) = (◡𝐹 ∪ ◡𝐺)
21imaeq1i 6049 . . 3 (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 ∪ ◡𝐺) “ (V ∖ {𝑍}))
3 imaundir 6142 . . 3 ((◡𝐹 ∪ ◡𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍})))
42, 3eqtri 2784 . 2 (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍})))
5 suppun2.1 . . . 4 (𝜑 → 𝐹 ∈ 𝑉)
6 suppun2.2 . . . 4 (𝜑 → 𝐺 ∈ 𝑊)
75, 6unexd 7768 . . 3 (𝜑 → (𝐹 ∪ 𝐺) ∈ V)
8 suppun2.3 . . 3 (𝜑 → 𝑍 ∈ 𝑋)
9 suppimacnv 8191 . . 3 (((𝐹 ∪ 𝐺) ∈ V ∧ 𝑍 ∈ 𝑋) → ((𝐹 ∪ 𝐺) supp 𝑍) = (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})))
107, 8, 9syl2anc 596 . 2 (𝜑 → ((𝐹 ∪ 𝐺) supp 𝑍) = (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})))
11 suppimacnv 8191 . . . 4 ((𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑋) → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍})))
125, 8, 11syl2anc 596 . . 3 (𝜑 → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍})))
13 suppimacnv 8191 . . . 4 ((𝐺 ∈ 𝑊 ∧ 𝑍 ∈ 𝑋) → (𝐺 supp 𝑍) = (◡𝐺 “ (V ∖ {𝑍})))
146, 8, 13syl2anc 596 . . 3 (𝜑 → (𝐺 supp 𝑍) = (◡𝐺 “ (V ∖ {𝑍})))
1512, 14uneq12d 4116 . 2 (𝜑 → ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍}))))
164, 10, 153eqtr4a 2822 1 (𝜑 → ((𝐹 ∪ 𝐺) supp 𝑍) = ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∖ cdif 3896   ∪ cun 3897  {csn 4584  ◡ccnv 5650   “ cima 5654  (class class class)co 7420   supp csupp 8177
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-sep 5249  ax-pr 5391  ax-un 7751
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-rab 3414  df-v 3453  df-sbc 3740  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-br 5104  df-opab 5168  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 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-supp 8178
This theorem is used by:  elrgspnlem4  33806  extvfvcl  34168  esplyind  34207
  Copyright terms: Public domain W3C validator