![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > dmpropg | GIF version |
Description: The domain of an unordered pair of ordered pairs. (Contributed by Mario Carneiro, 26-Apr-2015.) |
Ref | Expression |
---|---|
dmpropg | ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = {𝐴, 𝐶}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dmsnopg 5118 | . . 3 ⊢ (𝐵 ∈ 𝑉 → dom {〈𝐴, 𝐵〉} = {𝐴}) | |
2 | dmsnopg 5118 | . . 3 ⊢ (𝐷 ∈ 𝑊 → dom {〈𝐶, 𝐷〉} = {𝐶}) | |
3 | uneq12 3299 | . . 3 ⊢ ((dom {〈𝐴, 𝐵〉} = {𝐴} ∧ dom {〈𝐶, 𝐷〉} = {𝐶}) → (dom {〈𝐴, 𝐵〉} ∪ dom {〈𝐶, 𝐷〉}) = ({𝐴} ∪ {𝐶})) | |
4 | 1, 2, 3 | syl2an 289 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (dom {〈𝐴, 𝐵〉} ∪ dom {〈𝐶, 𝐷〉}) = ({𝐴} ∪ {𝐶})) |
5 | df-pr 3614 | . . . 4 ⊢ {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = ({〈𝐴, 𝐵〉} ∪ {〈𝐶, 𝐷〉}) | |
6 | 5 | dmeqi 4846 | . . 3 ⊢ dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = dom ({〈𝐴, 𝐵〉} ∪ {〈𝐶, 𝐷〉}) |
7 | dmun 4852 | . . 3 ⊢ dom ({〈𝐴, 𝐵〉} ∪ {〈𝐶, 𝐷〉}) = (dom {〈𝐴, 𝐵〉} ∪ dom {〈𝐶, 𝐷〉}) | |
8 | 6, 7 | eqtri 2210 | . 2 ⊢ dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = (dom {〈𝐴, 𝐵〉} ∪ dom {〈𝐶, 𝐷〉}) |
9 | df-pr 3614 | . 2 ⊢ {𝐴, 𝐶} = ({𝐴} ∪ {𝐶}) | |
10 | 4, 8, 9 | 3eqtr4g 2247 | 1 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = {𝐴, 𝐶}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2160 ∪ cun 3142 {csn 3607 {cpr 3608 〈cop 3610 dom cdm 4644 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2163 ax-ext 2171 ax-sep 4136 ax-pow 4192 ax-pr 4227 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-v 2754 df-un 3148 df-in 3150 df-ss 3157 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-br 4019 df-dm 4654 |
This theorem is referenced by: dmprop 5121 funtpg 5286 fnprg 5290 |
Copyright terms: Public domain | W3C validator |