Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > preq12d | Unicode version |
Description: Equality deduction for unordered pairs. (Contributed by NM, 19-Oct-2012.) |
Ref | Expression |
---|---|
preq1d.1 | |
preq12d.2 |
Ref | Expression |
---|---|
preq12d |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | preq1d.1 | . 2 | |
2 | preq12d.2 | . 2 | |
3 | preq12 3597 | . 2 | |
4 | 1, 2, 3 | syl2anc 408 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wceq 1331 cpr 3523 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-v 2683 df-un 3070 df-sn 3528 df-pr 3529 |
This theorem is referenced by: opeq1 3700 opeq2 3701 xrminrecl 11035 xrminadd 11037 xmetxp 12665 xmetxpbl 12666 txmetcnp 12676 |
Copyright terms: Public domain | W3C validator |