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

Theorem refref 22121
Description: Reflexivity of refinement. (Contributed by Jeff Hankins, 18-Jan-2010.)
Assertion
Ref Expression
refref (𝐴𝑉𝐴Ref𝐴)

Proof of Theorem refref
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2821 . . 3 𝐴 = 𝐴
2 ssid 3989 . . . . 5 𝑥𝑥
3 sseq2 3993 . . . . . 6 (𝑦 = 𝑥 → (𝑥𝑦𝑥𝑥))
43rspcev 3623 . . . . 5 ((𝑥𝐴𝑥𝑥) → ∃𝑦𝐴 𝑥𝑦)
52, 4mpan2 689 . . . 4 (𝑥𝐴 → ∃𝑦𝐴 𝑥𝑦)
65rgen 3148 . . 3 𝑥𝐴𝑦𝐴 𝑥𝑦
71, 6pm3.2i 473 . 2 ( 𝐴 = 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 𝑥𝑦)
81, 1isref 22117 . 2 (𝐴𝑉 → (𝐴Ref𝐴 ↔ ( 𝐴 = 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 𝑥𝑦)))
97, 8mpbiri 260 1 (𝐴𝑉𝐴Ref𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1537  wcel 2114  wral 3138  wrex 3139  wss 3936   cuni 4838   class class class wbr 5066  Refcref 22110
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-xp 5561  df-rel 5562  df-ref 22113
This theorem is referenced by:  locfinref  31105
  Copyright terms: Public domain W3C validator