Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > difpr | Unicode version |
Description: Removing two elements as pair of elements corresponds to removing each of the two elements as singletons. (Contributed by Alexander van der Vekens, 13-Jul-2018.) |
Ref | Expression |
---|---|
difpr |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-pr 3577 | . . 3 | |
2 | 1 | difeq2i 3232 | . 2 |
3 | difun1 3377 | . 2 | |
4 | 2, 3 | eqtri 2185 | 1 |
Colors of variables: wff set class |
Syntax hints: wceq 1342 cdif 3108 cun 3109 csn 3570 cpr 3571 |
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-in1 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-ext 2146 |
This theorem depends on definitions: df-bi 116 df-tru 1345 df-nf 1448 df-sb 1750 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ral 2447 df-rab 2451 df-v 2723 df-dif 3113 df-un 3115 df-in 3117 df-pr 3577 |
This theorem is referenced by: hashdifpr 10722 |
Copyright terms: Public domain | W3C validator |