| 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 6211 | . 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 2145 Vcvv 3450 {cpr 4586 〈cop 4590 dom cdm 5655 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 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 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-dm 5665 |
| This theorem is used by: dmtpop 6214 funtp 6590 fpr 7151 fnprb 7207 hashfun 14502 umgr2v2evd2 29987 ex-dm 30919 |
| Copyright terms: Public domain | W3C validator |