| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opth2 | Structured version Visualization version GIF version | ||
| Description: Ordered pair theorem. (Contributed by NM, 21-Sep-2014.) |
| Ref | Expression |
|---|---|
| opth2.1 | ⊢ 𝐶 ∈ V |
| opth2.2 | ⊢ 𝐷 ∈ V |
| Ref | Expression |
|---|---|
| opth2 | ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opth2.1 | . 2 ⊢ 𝐶 ∈ V | |
| 2 | opth2.2 | . 2 ⊢ 𝐷 ∈ V | |
| 3 | opthg2 5444 | . 2 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) | |
| 4 | 1, 2, 3 | mp2an 702 | 1 ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 Vcvv 3453 〈cop 4585 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-sep 5243 ax-pr 5387 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 |
| This theorem is referenced by: eqvinop 5452 opelxp 5679 fsn 7112 opiota 8035 canthwe 10603 ltresr 11092 mat1dimelbas 22519 fmucndlem 24338 hgt750lemb 34911 diblsmopel 41756 cdlemn7 41788 dihordlem7 41799 xihopellsmN 41839 dihopellsm 41840 dihpN 41921 cofidvala 49698 cofidval 49701 |
| Copyright terms: Public domain | W3C validator |