| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > suppun2 | Structured version Visualization version GIF version | ||
| Description: The support of a union is the union of the supports. (Contributed by Thierry Arnoux, 5-Oct-2025.) |
| Ref | Expression |
|---|---|
| suppun2.1 | ⊢ (𝜑 → 𝐹 ∈ 𝑉) |
| suppun2.2 | ⊢ (𝜑 → 𝐺 ∈ 𝑊) |
| suppun2.3 | ⊢ (𝜑 → 𝑍 ∈ 𝑋) |
| Ref | Expression |
|---|---|
| suppun2 | ⊢ (𝜑 → ((𝐹 ∪ 𝐺) supp 𝑍) = ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvun 6115 | . . . 4 ⊢ ◡(𝐹 ∪ 𝐺) = (◡𝐹 ∪ ◡𝐺) | |
| 2 | 1 | imaeq1i 6028 | . . 3 ⊢ (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 ∪ ◡𝐺) “ (V ∖ {𝑍})) |
| 3 | imaundir 6123 | . . 3 ⊢ ((◡𝐹 ∪ ◡𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍}))) | |
| 4 | 2, 3 | eqtri 2752 | . 2 ⊢ (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍}))) |
| 5 | suppun2.1 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
| 6 | suppun2.2 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
| 7 | 5, 6 | unexd 7730 | . . 3 ⊢ (𝜑 → (𝐹 ∪ 𝐺) ∈ V) |
| 8 | suppun2.3 | . . 3 ⊢ (𝜑 → 𝑍 ∈ 𝑋) | |
| 9 | suppimacnv 8153 | . . 3 ⊢ (((𝐹 ∪ 𝐺) ∈ V ∧ 𝑍 ∈ 𝑋) → ((𝐹 ∪ 𝐺) supp 𝑍) = (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍}))) | |
| 10 | 7, 8, 9 | syl2anc 584 | . 2 ⊢ (𝜑 → ((𝐹 ∪ 𝐺) supp 𝑍) = (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍}))) |
| 11 | suppimacnv 8153 | . . . 4 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑋) → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍}))) | |
| 12 | 5, 8, 11 | syl2anc 584 | . . 3 ⊢ (𝜑 → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍}))) |
| 13 | suppimacnv 8153 | . . . 4 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑍 ∈ 𝑋) → (𝐺 supp 𝑍) = (◡𝐺 “ (V ∖ {𝑍}))) | |
| 14 | 6, 8, 13 | syl2anc 584 | . . 3 ⊢ (𝜑 → (𝐺 supp 𝑍) = (◡𝐺 “ (V ∖ {𝑍}))) |
| 15 | 12, 14 | uneq12d 4132 | . 2 ⊢ (𝜑 → ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍})))) |
| 16 | 4, 10, 15 | 3eqtr4a 2790 | 1 ⊢ (𝜑 → ((𝐹 ∪ 𝐺) supp 𝑍) = ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 Vcvv 3447 ∖ cdif 3911 ∪ cun 3912 {csn 4589 ◡ccnv 5637 “ cima 5641 (class class class)co 7387 supp csupp 8139 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-sbc 3754 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fv 6519 df-ov 7390 df-oprab 7391 df-mpo 7392 df-supp 8140 |
| This theorem is referenced by: elrgspnlem4 33196 |
| Copyright terms: Public domain | W3C validator |