MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  erex Structured version   Visualization version   GIF version

Theorem erex 8735
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 (𝑅 Er 𝐴 → (𝐴 ∈ 𝑉 → 𝑅 ∈ V))

Proof of Theorem erex
StepHypRef Expression
1 erssxp 8734 . . 3 (𝑅 Er 𝐴 → 𝑅 ⊆ (𝐴 × 𝐴))
2 sqxpexg 7767 . . 3 (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V)
3 ssexg 5281 . . 3 ((𝑅 ⊆ (𝐴 × 𝐴) ∧ (𝐴 × 𝐴) ∈ V) → 𝑅 ∈ V)
41, 2, 3syl2an 608 . 2 ((𝑅 Er 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝑅 ∈ V)
54ex 418 1 (𝑅 Er 𝐴 → (𝐴 ∈ 𝑉 → 𝑅 ∈ V))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145  Vcvv 3451   ⊆ wss 3899   × cxp 5649   Er wer 8707
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pow 5327  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-dm 5661  df-rn 5662  df-er 8710
This theorem is used by:  erexb  8736  qliftlem  8812  qshash  15987  qusaddvallem  17716  qusaddflem  17717  qusaddval  17718  qusaddf  17719  qusmulval  17720  qusmulf  17721  qusmgm  18857  qusmnd  18968  qusgrp2  19261  efgrelexlemb  19957  efgcpbllemb  19962  frgpuplem  19979  qusrng  20395  qusring2  20557  vitalilem2  25923  vitalilem3  25924  tgjustr  28929
  Copyright terms: Public domain W3C validator