MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  entr4i Unicode version

Theorem entr4i 6934
Description: A chained equinumerosity inference. (Contributed by NM, 25-Sep-2004.)
Hypotheses
Ref Expression
entr4i.1  |-  A  ~~  B
entr4i.2  |-  C  ~~  B
Assertion
Ref Expression
entr4i  |-  A  ~~  C

Proof of Theorem entr4i
StepHypRef Expression
1 entr4i.1 . 2  |-  A  ~~  B
2 entr4i.2 . . 3  |-  C  ~~  B
32ensymi 6927 . 2  |-  B  ~~  C
41, 3entri 6931 1  |-  A  ~~  C
Colors of variables: wff set class
Syntax hints:   class class class wbr 4039    ~~ cen 6876
This theorem is referenced by:  fodomfi  7151  xpnnen  12503  rpnnen  12521  rexpen  12522  cnso  12541
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-er 6676  df-en 6880
  Copyright terms: Public domain W3C validator