Theorem eldmcnv 39022

Description: Elementhood in a domain of a converse. (Contributed by Peter Mazsa, 25-May-2018.)

Assertion

Ref	Expression
eldmcnv	⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ dom ◡𝑅 ↔ ∃𝑢 𝑢𝑅𝐴))

Distinct variable groups:   𝑢,𝐴   𝑢,𝑅   𝑢,𝑉

Proof of Theorem eldmcnv

Step	Hyp	Ref	Expression
1		eldmg 5887	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ dom ◡𝑅 ↔ ∃𝑢 𝐴◡𝑅𝑢))
2		brcnvg 5864	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ V) → (𝐴◡𝑅𝑢 ↔ 𝑢𝑅𝐴))
3	2	elvd 3460	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴◡𝑅𝑢 ↔ 𝑢𝑅𝐴))
4	3	exbidv 1950	. 2 ⊢ (𝐴 ∈ 𝑉 → (∃𝑢 𝐴◡𝑅𝑢 ↔ ∃𝑢 𝑢𝑅𝐴))
5	1, 4	bitrd 282	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ dom ◡𝑅 ↔ ∃𝑢 𝑢𝑅𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∃wex 1808   ∈ wcel 2142  Vcvv 3454   class class class wbr 5108  ^◡ccnv 5659  dom cdm 5660

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3416  df-v 3456  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-cnv 5668  df-dm 5670

This theorem is used by:  eldmcoss  39225