Theorem relsn2 6213

Description: A singleton is a relation iff it has a nonempty domain. (Contributed by NM, 25-Sep-2013.) Make hypothesis an antecedent. (Revised by BJ, 12-Feb-2022.)

Assertion

Ref	Expression
relsn2	⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ dom {𝐴} ≠ ∅))

Proof of Theorem relsn2

Step	Hyp	Ref	Expression
1		relsng 5788	. 2 ⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ 𝐴 ∈ (V × V)))
2		dmsnn0 6208	. 2 ⊢ (𝐴 ∈ (V × V) ↔ dom {𝐴} ≠ ∅)
3	1, 2	bitrdi 290	1 ⊢ (𝐴 ∈ 𝑉 → (Rel {𝐴} ↔ dom {𝐴} ≠ ∅))

Syntax hints:   → wi 4   ↔ wb 209   ∈ wcel 2141   ≠ wne 2956  Vcvv 3453  ∅c0 4285  {csn 4588   × cxp 5659  dom cdm 5661  Rel wrel 5666

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5256  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-sb 2095  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-rab 3415  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-xp 5667  df-rel 5668  df-dm 5671

This theorem is referenced by: (None)