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

Theorem erex 6446
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 6445 . . 3  |-  ( R  Er  A  ->  R  C_  ( A  X.  A
) )
2 xpexg 4648 . . . 4  |-  ( ( A  e.  V  /\  A  e.  V )  ->  ( A  X.  A
)  e.  _V )
32anidms 394 . . 3  |-  ( A  e.  V  ->  ( A  X.  A )  e. 
_V )
4 ssexg 4062 . . 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 1480   _Vcvv 2681    C_ wss 3066    X. cxp 4532    Er wer 6419
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-xp 4540  df-rel 4541  df-cnv 4542  df-dm 4544  df-rn 4545  df-er 6422
This theorem is referenced by:  erexb  6447  qliftlem  6500
  Copyright terms: Public domain W3C validator