Theorem eqssi 3171

Description: Infer equality from two subclass relationships. Compare Theorem 4 of [Suppes] p. 22. (Contributed by NM, 9-Sep-1993.)

Hypotheses

Ref	Expression
eqssi.1	|- A C_ B
eqssi.2	|- B C_ A

Assertion

Ref	Expression
eqssi	|- A = B

Proof of Theorem eqssi

Step	Hyp	Ref	Expression
1		eqssi.1	. 2 |- A C_ B
2		eqssi.2	. 2 |- B C_ A
3		eqss 3170	. 2 |- ( A = B <-> ( A C_ B /\ B C_ A ) )
4	1, 2, 3	mpbir2an 942	1 |- A = B

Syntax hints:   = wceq 1353   C_ wss 3129

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-11 1506  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-in 3135  df-ss 3142

This theorem is referenced by:  inv1  3459  unv  3460  undifabs  3499  intab  3873  intid  4224  find  4598  limom  4613  dmv  4843  0ima  4988  rnxpid  5063  dftpos4  6263  axaddf  7866  axmulf  7867  dfuzi  9362  unirnioo  9972  txuni2  13692  dvef  14124  reeff1o  14130