Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > unixp | Structured version Visualization version GIF version |
Description: The double class union of a nonempty Cartesian product is the union of it members. (Contributed by NM, 17-Sep-2006.) |
Ref | Expression |
---|---|
unixp | ⊢ ((𝐴 × 𝐵) ≠ ∅ → ∪ ∪ (𝐴 × 𝐵) = (𝐴 ∪ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | relxp 5576 | . . 3 ⊢ Rel (𝐴 × 𝐵) | |
2 | relfld 6129 | . . 3 ⊢ (Rel (𝐴 × 𝐵) → ∪ ∪ (𝐴 × 𝐵) = (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵))) | |
3 | 1, 2 | ax-mp 5 | . 2 ⊢ ∪ ∪ (𝐴 × 𝐵) = (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) |
4 | xpeq2 5579 | . . . . 5 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = (𝐴 × ∅)) | |
5 | xp0 6018 | . . . . 5 ⊢ (𝐴 × ∅) = ∅ | |
6 | 4, 5 | syl6eq 2875 | . . . 4 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = ∅) |
7 | 6 | necon3i 3051 | . . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → 𝐵 ≠ ∅) |
8 | xpeq1 5572 | . . . . 5 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = (∅ × 𝐵)) | |
9 | 0xp 5652 | . . . . 5 ⊢ (∅ × 𝐵) = ∅ | |
10 | 8, 9 | syl6eq 2875 | . . . 4 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = ∅) |
11 | 10 | necon3i 3051 | . . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → 𝐴 ≠ ∅) |
12 | dmxp 5802 | . . . 4 ⊢ (𝐵 ≠ ∅ → dom (𝐴 × 𝐵) = 𝐴) | |
13 | rnxp 6030 | . . . 4 ⊢ (𝐴 ≠ ∅ → ran (𝐴 × 𝐵) = 𝐵) | |
14 | uneq12 4137 | . . . 4 ⊢ ((dom (𝐴 × 𝐵) = 𝐴 ∧ ran (𝐴 × 𝐵) = 𝐵) → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴 ∪ 𝐵)) | |
15 | 12, 13, 14 | syl2an 597 | . . 3 ⊢ ((𝐵 ≠ ∅ ∧ 𝐴 ≠ ∅) → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴 ∪ 𝐵)) |
16 | 7, 11, 15 | syl2anc 586 | . 2 ⊢ ((𝐴 × 𝐵) ≠ ∅ → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴 ∪ 𝐵)) |
17 | 3, 16 | syl5eq 2871 | 1 ⊢ ((𝐴 × 𝐵) ≠ ∅ → ∪ ∪ (𝐴 × 𝐵) = (𝐴 ∪ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1536 ≠ wne 3019 ∪ cun 3937 ∅c0 4294 ∪ cuni 4841 × cxp 5556 dom cdm 5558 ran crn 5559 Rel wrel 5563 |
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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-br 5070 df-opab 5132 df-xp 5564 df-rel 5565 df-cnv 5566 df-dm 5568 df-rn 5569 |
This theorem is referenced by: unixpid 6138 rankxpl 9307 rankxplim2 9312 rankxplim3 9313 rankxpsuc 9314 |
Copyright terms: Public domain | W3C validator |