| 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 3899 | . 2 ⊢ (𝐴 = 𝐶 → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐵〉) | |
| 2 | opeq2 3900 | . 2 ⊢ (𝐵 = 𝐷 → 〈𝐶, 𝐵〉 = 〈𝐶, 𝐷〉) | |
| 3 | 1, 2 | sylan9eq 2291 | 1 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 〈cop 3708 |
| 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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-un 3224 df-sn 3711 df-pr 3712 df-op 3714 |
| This theorem is referenced by: opeq12i 3904 opeq12d 3907 cbvopab 4197 opth 4372 copsex2t 4380 copsex2g 4381 relop 4925 funopg 5406 fsn 5871 fnressn 5892 cbvoprab12 6152 eqopi 6396 f1o2ndf1 6454 tposoprab 6541 brecop 6889 th3q 6904 ecovcom 6906 ecovicom 6907 ecovass 6908 ecoviass 6909 ecovdi 6910 ecovidi 6911 xpf1o 7134 1qec 7745 enq0sym 7789 addnq0mo 7804 mulnq0mo 7805 addnnnq0 7806 mulnnnq0 7807 distrnq0 7816 mulcomnq0 7817 addassnq0 7819 addsrmo 8100 mulsrmo 8101 addsrpr 8102 mulsrpr 8103 axcnre 8238 fsumcnv 12182 fprodcnv 12370 eucalgval2 12809 |
| Copyright terms: Public domain | W3C validator |