| 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 3885 | . 2 ⊢ (𝐴 = 𝐶 → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐵〉) | |
| 2 | opeq2 3886 | . 2 ⊢ (𝐵 = 𝐷 → 〈𝐶, 𝐵〉 = 〈𝐶, 𝐷〉) | |
| 3 | 1, 2 | sylan9eq 2287 | 1 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 〈cop 3694 |
| 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 2216 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-v 2817 df-un 3217 df-sn 3697 df-pr 3698 df-op 3700 |
| This theorem is referenced by: opeq12i 3890 opeq12d 3893 cbvopab 4183 opth 4355 copsex2t 4363 copsex2g 4364 relop 4907 funopg 5388 fsn 5851 fnressn 5872 cbvoprab12 6129 eqopi 6368 f1o2ndf1 6426 tposoprab 6513 brecop 6861 th3q 6876 ecovcom 6878 ecovicom 6879 ecovass 6880 ecoviass 6881 ecovdi 6882 ecovidi 6883 xpf1o 7099 1qec 7705 enq0sym 7749 addnq0mo 7764 mulnq0mo 7765 addnnnq0 7766 mulnnnq0 7767 distrnq0 7776 mulcomnq0 7777 addassnq0 7779 addsrmo 8060 mulsrmo 8061 addsrpr 8062 mulsrpr 8063 axcnre 8198 fsumcnv 12127 fprodcnv 12315 eucalgval2 12754 |
| Copyright terms: Public domain | W3C validator |