| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > opeq12 | GIF version | ||
| Description: Equality theorem for ordered pairs. (Contributed by NM, 28-May-1995.) |
| Ref | Expression |
|---|---|
| opeq12 | ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opeq1 3867 | . 2 ⊢ (𝐴 = 𝐶 → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐵〉) | |
| 2 | opeq2 3868 | . 2 ⊢ (𝐵 = 𝐷 → 〈𝐶, 𝐵〉 = 〈𝐶, 𝐷〉) | |
| 3 | 1, 2 | sylan9eq 2284 | 1 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 〈cop 3676 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-v 2805 df-un 3205 df-sn 3679 df-pr 3680 df-op 3682 |
| This theorem is referenced by: opeq12i 3872 opeq12d 3875 cbvopab 4165 opth 4335 copsex2t 4343 copsex2g 4344 relop 4886 funopg 5367 fsn 5827 fnressn 5848 cbvoprab12 6105 eqopi 6344 f1o2ndf1 6402 tposoprab 6489 brecop 6837 th3q 6852 ecovcom 6854 ecovicom 6855 ecovass 6856 ecoviass 6857 ecovdi 6858 ecovidi 6859 xpf1o 7073 1qec 7651 enq0sym 7695 addnq0mo 7710 mulnq0mo 7711 addnnnq0 7712 mulnnnq0 7713 distrnq0 7722 mulcomnq0 7723 addassnq0 7725 addsrmo 8006 mulsrmo 8007 addsrpr 8008 mulsrpr 8009 axcnre 8144 fsumcnv 12061 fprodcnv 12249 eucalgval2 12688 |
| Copyright terms: Public domain | W3C validator |