| 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 6110 | . . . 4 ⊢ ◡(𝐹 ∪ 𝐺) = (◡𝐹 ∪ ◡𝐺) | |
| 2 | 1 | imaeq1i 6026 | . . 3 ⊢ (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 ∪ ◡𝐺) “ (V ∖ {𝑍})) |
| 3 | imaundir 6118 | . . 3 ⊢ ((◡𝐹 ∪ ◡𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍}))) | |
| 4 | 2, 3 | eqtri 2760 | . 2 ⊢ (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍}))) |
| 5 | suppun2.1 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
| 6 | suppun2.2 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
| 7 | 5, 6 | unexd 7711 | . . 3 ⊢ (𝜑 → (𝐹 ∪ 𝐺) ∈ V) |
| 8 | suppun2.3 | . . 3 ⊢ (𝜑 → 𝑍 ∈ 𝑋) | |
| 9 | suppimacnv 8128 | . . 3 ⊢ (((𝐹 ∪ 𝐺) ∈ V ∧ 𝑍 ∈ 𝑋) → ((𝐹 ∪ 𝐺) supp 𝑍) = (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍}))) | |
| 10 | 7, 8, 9 | syl2anc 585 | . 2 ⊢ (𝜑 → ((𝐹 ∪ 𝐺) supp 𝑍) = (◡(𝐹 ∪ 𝐺) “ (V ∖ {𝑍}))) |
| 11 | suppimacnv 8128 | . . . 4 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝑍 ∈ 𝑋) → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍}))) | |
| 12 | 5, 8, 11 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝐹 supp 𝑍) = (◡𝐹 “ (V ∖ {𝑍}))) |
| 13 | suppimacnv 8128 | . . . 4 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑍 ∈ 𝑋) → (𝐺 supp 𝑍) = (◡𝐺 “ (V ∖ {𝑍}))) | |
| 14 | 6, 8, 13 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝐺 supp 𝑍) = (◡𝐺 “ (V ∖ {𝑍}))) |
| 15 | 12, 14 | uneq12d 4123 | . 2 ⊢ (𝜑 → ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍)) = ((◡𝐹 “ (V ∖ {𝑍})) ∪ (◡𝐺 “ (V ∖ {𝑍})))) |
| 16 | 4, 10, 15 | 3eqtr4a 2798 | 1 ⊢ (𝜑 → ((𝐹 ∪ 𝐺) supp 𝑍) = ((𝐹 supp 𝑍) ∪ (𝐺 supp 𝑍))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 Vcvv 3442 ∖ cdif 3900 ∪ cun 3901 {csn 4582 ◡ccnv 5633 “ cima 5637 (class class class)co 7370 supp csupp 8114 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5245 ax-pr 5381 ax-un 7692 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-id 5529 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-iota 6458 df-fun 6504 df-fv 6510 df-ov 7373 df-oprab 7374 df-mpo 7375 df-supp 8115 |
| This theorem is referenced by: elrgspnlem4 33345 extvfvcl 33719 esplyind 33758 |
| Copyright terms: Public domain | W3C validator |