| 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 3883 | . 2 ⊢ (𝐴 = 𝐶 → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐵〉) | |
| 2 | opeq2 3884 | . 2 ⊢ (𝐵 = 𝐷 → 〈𝐶, 𝐵〉 = 〈𝐶, 𝐷〉) | |
| 3 | 1, 2 | sylan9eq 2285 | 1 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 〈cop 3692 |
| 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 2214 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-v 2815 df-un 3215 df-sn 3695 df-pr 3696 df-op 3698 |
| This theorem is referenced by: opeq12i 3888 opeq12d 3891 cbvopab 4181 opth 4353 copsex2t 4361 copsex2g 4362 relop 4905 funopg 5386 fsn 5849 fnressn 5870 cbvoprab12 6127 eqopi 6366 f1o2ndf1 6424 tposoprab 6511 brecop 6859 th3q 6874 ecovcom 6876 ecovicom 6877 ecovass 6878 ecoviass 6879 ecovdi 6880 ecovidi 6881 xpf1o 7097 1qec 7703 enq0sym 7747 addnq0mo 7762 mulnq0mo 7763 addnnnq0 7764 mulnnnq0 7765 distrnq0 7774 mulcomnq0 7775 addassnq0 7777 addsrmo 8058 mulsrmo 8059 addsrpr 8060 mulsrpr 8061 axcnre 8196 fsumcnv 12123 fprodcnv 12311 eucalgval2 12750 |
| Copyright terms: Public domain | W3C validator |