| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opthg2 | Structured version Visualization version GIF version | ||
| Description: Ordered pair theorem. (Contributed by NM, 14-Oct-2005.) (Revised by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| opthg2 | ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opthg 5417 | . 2 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (〈𝐶, 𝐷〉 = 〈𝐴, 𝐵〉 ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))) | |
| 2 | eqcom 2746 | . 2 ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ 〈𝐶, 𝐷〉 = 〈𝐴, 𝐵〉) | |
| 3 | eqcom 2746 | . . 3 ⊢ (𝐴 = 𝐶 ↔ 𝐶 = 𝐴) | |
| 4 | eqcom 2746 | . . 3 ⊢ (𝐵 = 𝐷 ↔ 𝐷 = 𝐵) | |
| 5 | 3, 4 | anbi12i 634 | . 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)) |
| 6 | 1, 2, 5 | 3bitr4g 315 | 1 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 〈cop 4561 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 ax-sep 5218 ax-pr 5362 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 |
| This theorem is referenced by: opth2 5420 brsnop 5464 fliftel 7253 symg2bas 19359 projf1o 45643 gpgedgiov 48556 |
| Copyright terms: Public domain | W3C validator |