| 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 5433 | . 2 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (〈𝐶, 𝐷〉 = 〈𝐴, 𝐵〉 ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))) | |
| 2 | eqcom 2744 | . 2 ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ 〈𝐶, 𝐷〉 = 〈𝐴, 𝐵〉) | |
| 3 | eqcom 2744 | . . 3 ⊢ (𝐴 = 𝐶 ↔ 𝐶 = 𝐴) | |
| 4 | eqcom 2744 | . . 3 ⊢ (𝐵 = 𝐷 ↔ 𝐷 = 𝐵) | |
| 5 | 3, 4 | anbi12i 629 | . 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)) |
| 6 | 1, 2, 5 | 3bitr4g 314 | 1 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 〈cop 4588 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 |
| This theorem is referenced by: opth2 5436 brsnop 5478 fliftel 7265 symg2bas 19334 projf1o 45555 gpgedgiov 48425 |
| Copyright terms: Public domain | W3C validator |