Theorem relsnop 4757

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

Step	Hyp	Ref	Expression
1		relsn.1	. . 3 ⊢ 𝐴 ∈ V
2		relsnop.2	. . 3 ⊢ 𝐵 ∈ V
3	1, 2	opelvv 4701	. 2 ⊢ ⟨𝐴, 𝐵⟩ ∈ (V × V)
4	1, 2	opex 4254	. . 3 ⊢ ⟨𝐴, 𝐵⟩ ∈ V
5	4	relsn 4756	. 2 ⊢ (Rel {⟨𝐴, 𝐵⟩} ↔ ⟨𝐴, 𝐵⟩ ∈ (V × V))
6	3, 5	mpbir 146	1 ⊢ Rel {⟨𝐴, 𝐵⟩}

Syntax hints:   ∈ wcel 2160  Vcvv 2756  {csn 3614  ⟨cop 3617   × cxp 4649  Rel wrel 4656

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2163  ax-ext 2171  ax-sep 4143  ax-pow 4199  ax-pr 4234

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-v 2758  df-un 3152  df-in 3154  df-ss 3161  df-pw 3599  df-sn 3620  df-pr 3621  df-op 3623  df-opab 4087  df-xp 4657  df-rel 4658

This theorem is referenced by:  cnvsn  5136  fsn  5716