ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  tpidm23 Unicode version

Theorem tpidm23 3462
Description: Unordered triple  { ,  ,  } is just an overlong way to write  { ,  }. (Contributed by David A. Wheeler, 10-May-2015.)
Assertion
Ref Expression
tpidm23  { ,  ,  }  { ,  }

Proof of Theorem tpidm23
StepHypRef Expression
1 tprot 3454 . 2  { ,  ,  }  { ,  ,  }
2 tpidm12 3460 . 2  { ,  ,  }  { ,  }
3 prcom 3437 . 2  { ,  }  { ,  }
41, 2, 33eqtri 2061 1  { ,  ,  }  { ,  }
Colors of variables: wff set class
Syntax hints:   wceq 1242   {cpr 3368   {ctp 3369
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bndl 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019
This theorem depends on definitions:  df-bi 110  df-3or 885  df-tru 1245  df-nf 1347  df-sb 1643  df-clab 2024  df-cleq 2030  df-clel 2033  df-nfc 2164  df-v 2553  df-un 2916  df-sn 3373  df-pr 3374  df-tp 3375
This theorem is referenced by:  tppreq3  3464
  Copyright terms: Public domain W3C validator