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 4792 | . . 3 ⊢ (𝐵 ∈ 𝑉 → dom {〈𝐴, 𝐵〉} = {𝐴}) | |
2 | dmsnopg 4792 | . . 3 ⊢ (𝐷 ∈ 𝑊 → dom {〈𝐶, 𝐷〉} = {𝐶}) | |
3 | uneq12 3092 | . . 3 ⊢ ((dom {〈𝐴, 𝐵〉} = {𝐴} ∧ dom {〈𝐶, 𝐷〉} = {𝐶}) → (dom {〈𝐴, 𝐵〉} ∪ dom {〈𝐶, 𝐷〉}) = ({𝐴} ∪ {𝐶})) | |
4 | 1, 2, 3 | syl2an 273 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (dom {〈𝐴, 𝐵〉} ∪ dom {〈𝐶, 𝐷〉}) = ({𝐴} ∪ {𝐶})) |
5 | df-pr 3382 | . . . 4 ⊢ {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = ({〈𝐴, 𝐵〉} ∪ {〈𝐶, 𝐷〉}) | |
6 | 5 | dmeqi 4536 | . . 3 ⊢ dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = dom ({〈𝐴, 𝐵〉} ∪ {〈𝐶, 𝐷〉}) |
7 | dmun 4542 | . . 3 ⊢ dom ({〈𝐴, 𝐵〉} ∪ {〈𝐶, 𝐷〉}) = (dom {〈𝐴, 𝐵〉} ∪ dom {〈𝐶, 𝐷〉}) | |
8 | 6, 7 | eqtri 2060 | . 2 ⊢ dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = (dom {〈𝐴, 𝐵〉} ∪ dom {〈𝐶, 𝐷〉}) |
9 | df-pr 3382 | . 2 ⊢ {𝐴, 𝐶} = ({𝐴} ∪ {𝐶}) | |
10 | 4, 8, 9 | 3eqtr4g 2097 | 1 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = {𝐴, 𝐶}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 = wceq 1243 ∈ wcel 1393 ∪ cun 2915 {csn 3375 {cpr 3376 〈cop 3378 dom cdm 4345 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-sep 3875 ax-pow 3927 ax-pr 3944 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-v 2559 df-un 2922 df-in 2924 df-ss 2931 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-br 3765 df-dm 4355 |
This theorem is referenced by: dmprop 4795 funtpg 4950 fnprg 4954 |
Copyright terms: Public domain | W3C validator |