| 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 6151 | . . . 4 ⊢ ◡(𝐹 ∪ 𝐺) = (◡𝐹 ∪ ◡𝐺) | |
| 2 | 1 | imaeq1i 6067 | . . 3 ⊢ (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 ∪ ◡𝐺) “ (V ∖ {𝑍})) |
| 3 | imaundir 6160 | . . 3 ⊢ ((◡𝐹 ∪ ◡𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍}))) | |
| 4 | 2, 3 | eqtri 2786 | . 2 ⊢ (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍}))) |
| 5 | suppun2.1 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
| 6 | suppun2.2 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
| 7 | 5, 6 | unexd 7800 | . . 3 ⊢ (𝜑 → (𝐹 ∪ 𝐺) ∈ V) |
| 8 | suppun2.3 | . . 3 ⊢ (𝜑 → 𝑍 ∈ 𝑋) | |
| 9 | suppimacnv 8229 | . . 3 ⊢ (((𝐹 ∪ 𝐺) ∈ V ∧ 𝑍 ∈ 𝑋) → ((𝐹 ∪ 𝐺) supp 𝑍) = (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍}))) | |
| 10 | 7, 8, 9 | syl2anc 596 | . 2 ⊢ (𝜑 → ((𝐹 ∪ 𝐺) supp 𝑍) = (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍}))) |
| 11 | suppimacnv 8229 | . . . 4 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑋) → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍}))) | |
| 12 | 5, 8, 11 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍}))) |
| 13 | suppimacnv 8229 | . . . 4 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑍 ∈ 𝑋) → (𝐺 supp 𝑍) = (◡𝐺 “ (V ∖ {𝑍}))) | |
| 14 | 6, 8, 13 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝐺 supp 𝑍) = (◡𝐺 “ (V ∖ {𝑍}))) |
| 15 | 12, 14 | uneq12d 4171 | . 2 ⊢ (𝜑 → ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍})))) |
| 16 | 4, 10, 15 | 3eqtr4a 2824 | 1 ⊢ (𝜑 → ((𝐹 ∪ 𝐺) supp 𝑍) = ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ∖ cdif 4048 ∪ cun 4152 {csn 4588 ◡ccnv 5657 “ cima 5661 (class class class)co 7451 supp csupp 8214 |
| 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 5255 ax-pr 5398 ax-un 7783 |
| 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 4841 df-uni 4873 df-br 5109 df-opab 5174 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-supp 8215 |
| This theorem is used by: elrgspnlem4 33905 extvfvcl 34279 esplyind 34318 |
| Copyright terms: Public domain | W3C validator |