| 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 6215 | . 2 ⊢ ((𝐵 ∈ V ∧ 𝐷 ∈ V) → dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = {𝐴, 𝐶}) | |
| 4 | 1, 2, 3 | mp2an 704 | 1 ⊢ dom {〈𝐴, 𝐵〉, 〈𝐶, 𝐷〉} = {𝐴, 𝐶} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2142 Vcvv 3454 {cpr 4590 〈cop 4594 dom cdm 5660 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5256 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-br 5109 df-dm 5670 |
| This theorem is used by: dmtpop 6218 funtp 6593 fpr 7151 fnprb 7206 hashfun 14481 umgr2v2evd2 29888 ex-dm 30801 |
| Copyright terms: Public domain | W3C validator |