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

Theorem relsnop 5666
 Description: A singleton of an ordered pair is a relation. (Contributed by NM, 17-May-1998.) (Revised by Mario Carneiro, 26-Apr-2015.)
Hypotheses
Ref Expression
relsn.1 𝐴 ∈ V
relsnop.2 𝐵 ∈ V
Assertion
Ref Expression
relsnop Rel {⟨𝐴, 𝐵⟩}

Proof of Theorem relsnop
StepHypRef Expression
1 relsn.1 . 2 𝐴 ∈ V
2 relsnop.2 . 2 𝐵 ∈ V
3 relsnopg 5664 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → Rel {⟨𝐴, 𝐵⟩})
41, 2, 3mp2an 691 1 Rel {⟨𝐴, 𝐵⟩}
 Colors of variables: wff setvar class Syntax hints:   ∈ wcel 2115  Vcvv 3481  {csn 4551  ⟨cop 4557  Rel wrel 5548 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-sep 5190  ax-nul 5197  ax-pr 5318 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ral 3138  df-rex 3139  df-v 3483  df-dif 3923  df-un 3925  df-in 3927  df-ss 3937  df-nul 4278  df-if 4452  df-sn 4552  df-pr 4554  df-op 4558  df-opab 5116  df-xp 5549  df-rel 5550 This theorem is referenced by:  fsn  6889  imasaddfnlem  16804  ex-res  28232
 Copyright terms: Public domain W3C validator