Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > tpidm23 | Unicode version |
Description: Unordered triple is just an overlong way to write . (Contributed by David A. Wheeler, 10-May-2015.) |
Ref | Expression |
---|---|
tpidm23 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tprot 3586 | . 2 | |
2 | tpidm12 3592 | . 2 | |
3 | prcom 3569 | . 2 | |
4 | 1, 2, 3 | 3eqtri 2142 | 1 |
Colors of variables: wff set class |
Syntax hints: wceq 1316 cpr 3498 ctp 3499 |
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 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 |
This theorem depends on definitions: df-bi 116 df-3or 948 df-tru 1319 df-nf 1422 df-sb 1721 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-v 2662 df-un 3045 df-sn 3503 df-pr 3504 df-tp 3505 |
This theorem is referenced by: tppreq3 3596 |
Copyright terms: Public domain | W3C validator |