Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > opcom | Structured version Visualization version GIF version |
Description: An ordered pair commutes iff its members are equal. (Contributed by NM, 28-May-2009.) |
Ref | Expression |
---|---|
opcom.1 | ⊢ 𝐴 ∈ V |
opcom.2 | ⊢ 𝐵 ∈ V |
Ref | Expression |
---|---|
opcom | ⊢ (〈𝐴, 𝐵〉 = 〈𝐵, 𝐴〉 ↔ 𝐴 = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opcom.1 | . . 3 ⊢ 𝐴 ∈ V | |
2 | opcom.2 | . . 3 ⊢ 𝐵 ∈ V | |
3 | 1, 2 | opth 5393 | . 2 ⊢ (〈𝐴, 𝐵〉 = 〈𝐵, 𝐴〉 ↔ (𝐴 = 𝐵 ∧ 𝐵 = 𝐴)) |
4 | eqcom 2746 | . . 3 ⊢ (𝐵 = 𝐴 ↔ 𝐴 = 𝐵) | |
5 | 4 | anbi2i 622 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = 𝐴) ↔ (𝐴 = 𝐵 ∧ 𝐴 = 𝐵)) |
6 | anidm 564 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐴 = 𝐵) ↔ 𝐴 = 𝐵) | |
7 | 3, 5, 6 | 3bitri 296 | 1 ⊢ (〈𝐴, 𝐵〉 = 〈𝐵, 𝐴〉 ↔ 𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 395 = wceq 1541 ∈ wcel 2109 Vcvv 3430 〈cop 4572 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-ext 2710 ax-sep 5226 ax-nul 5233 ax-pr 5355 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-sb 2071 df-clab 2717 df-cleq 2731 df-clel 2817 df-rab 3074 df-v 3432 df-dif 3894 df-un 3896 df-nul 4262 df-if 4465 df-sn 4567 df-pr 4569 df-op 4573 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |