Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > preqr2g | Unicode version |
Description: Reverse equality lemma for unordered pairs. If two unordered pairs have the same second element, the second elements are equal. Closed form of preqr2 3732. (Contributed by Jim Kingdon, 21-Sep-2018.) |
Ref | Expression |
---|---|
preqr2g |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prcom 3635 | . . 3 | |
2 | prcom 3635 | . . 3 | |
3 | 1, 2 | eqeq12i 2171 | . 2 |
4 | preqr1g 3729 | . 2 | |
5 | 3, 4 | syl5bi 151 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wceq 1335 wcel 2128 cvv 2712 cpr 3561 |
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 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2139 |
This theorem depends on definitions: df-bi 116 df-tru 1338 df-nf 1441 df-sb 1743 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-v 2714 df-un 3106 df-sn 3566 df-pr 3567 |
This theorem is referenced by: opth 4197 |
Copyright terms: Public domain | W3C validator |