| 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 6235 | . 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 1570 ∈ wcel 2147 Vcvv 3454 {cpr 4590 〈cop 4840 dom cdm 5658 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-br 5109 df-dm 5668 |
| This theorem is used by: dmtpop 6238 funtp 6627 fpr 7190 fnprb 7245 hashfun 14623 cnfldfunALT 21745 umgr2v2evd2 30165 ex-dm 31097 |
| Copyright terms: Public domain | W3C validator |