| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dmprop | Structured version Visualization version GIF version | ||
| Description: The domain of an unordered pair of ordered pairs. (Contributed by NM, 13-Sep-2011.) |
| Ref | Expression |
|---|---|
| dmsnop.1 | ⊢ 𝐵 ∈ V |
| dmprop.1 | ⊢ 𝐷 ∈ V |
| Ref | Expression |
|---|---|
| dmprop | ⊢ dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = {𝐴, 𝐶} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dmsnop.1 | . 2 ⊢ 𝐵 ∈ V | |
| 2 | dmprop.1 | . 2 ⊢ 𝐷 ∈ V | |
| 3 | dmpropg 6216 | . 2 ⊢ ((𝐵 ∈ V ∧ 𝐷 ∈ V) → dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = {𝐴, 𝐶}) | |
| 4 | 1, 2, 3 | mp2an 705 | 1 ⊢ dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = {𝐴, 𝐶} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2144 Vcvv 3450 {cpr 4586 〈cop 4834 dom cdm 5650 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-br 5103 df-dm 5660 |
| This theorem is used by: dmtpop 6219 funtp 6598 fpr 7159 fnprb 7215 hashfun 14586 umgr2v2evd2 30114 ex-dm 31046 |
| Copyright terms: Public domain | W3C validator |