![]() |
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 5018 | . . 3 ⊢ (𝐵 ∈ 𝑉 → dom {〈𝐴, 𝐵〉} = {𝐴}) | |
2 | dmsnopg 5018 | . . 3 ⊢ (𝐷 ∈ 𝑊 → dom {〈𝐶, 𝐷〉} = {𝐶}) | |
3 | uneq12 3230 | . . 3 ⊢ ((dom {〈𝐴, 𝐵〉} = {𝐴} ∧ dom {〈𝐶, 𝐷〉} = {𝐶}) → (dom {〈𝐴, 𝐵〉} ∪ dom {〈𝐶, 𝐷〉}) = ({𝐴} ∪ {𝐶})) | |
4 | 1, 2, 3 | syl2an 287 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (dom {〈𝐴, 𝐵〉} ∪ dom {〈𝐶, 𝐷〉}) = ({𝐴} ∪ {𝐶})) |
5 | df-pr 3539 | . . . 4 ⊢ {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = ({〈𝐴, 𝐵〉} ∪ {〈𝐶, 𝐷〉}) | |
6 | 5 | dmeqi 4748 | . . 3 ⊢ dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = dom ({〈𝐴, 𝐵〉} ∪ {〈𝐶, 𝐷〉}) |
7 | dmun 4754 | . . 3 ⊢ dom ({〈𝐴, 𝐵〉} ∪ {〈𝐶, 𝐷〉}) = (dom {〈𝐴, 𝐵〉} ∪ dom {〈𝐶, 𝐷〉}) | |
8 | 6, 7 | eqtri 2161 | . 2 ⊢ dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = (dom {〈𝐴, 𝐵〉} ∪ dom {〈𝐶, 𝐷〉}) |
9 | df-pr 3539 | . 2 ⊢ {𝐴, 𝐶} = ({𝐴} ∪ {𝐶}) | |
10 | 4, 8, 9 | 3eqtr4g 2198 | 1 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = {𝐴, 𝐶}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1332 ∈ wcel 1481 ∪ cun 3074 {csn 3532 {cpr 3533 〈cop 3535 dom cdm 4547 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 ax-pr 4139 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-v 2691 df-un 3080 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-br 3938 df-dm 4557 |
This theorem is referenced by: dmprop 5021 funtpg 5182 fnprg 5186 |
Copyright terms: Public domain | W3C validator |