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

Theorem erex 6461
Description: An equivalence relation is a set if its domain is a set. (Contributed by Rodolfo Medina, 15-Oct-2010.) (Proof shortened by Mario Carneiro, 12-Aug-2015.)
Assertion
Ref Expression
erex  |-  ( R  Er  A  ->  ( A  e.  V  ->  R  e.  _V ) )

Proof of Theorem erex
StepHypRef Expression
1 erssxp 6460 . . 3  |-  ( R  Er  A  ->  R  C_  ( A  X.  A
) )
2 xpexg 4661 . . . 4  |-  ( ( A  e.  V  /\  A  e.  V )  ->  ( A  X.  A
)  e.  _V )
32anidms 395 . . 3  |-  ( A  e.  V  ->  ( A  X.  A )  e. 
_V )
4 ssexg 4075 . . 3  |-  ( ( R  C_  ( A  X.  A )  /\  ( A  X.  A )  e. 
_V )  ->  R  e.  _V )
51, 3, 4syl2an 287 . 2  |-  ( ( R  Er  A  /\  A  e.  V )  ->  R  e.  _V )
65ex 114 1  |-  ( R  Er  A  ->  ( A  e.  V  ->  R  e.  _V ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 1481   _Vcvv 2689    C_ wss 3076    X. cxp 4545    Er wer 6434
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 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-xp 4553  df-rel 4554  df-cnv 4555  df-dm 4557  df-rn 4558  df-er 6437
This theorem is referenced by:  erexb  6462  qliftlem  6515
  Copyright terms: Public domain W3C validator