Theorem eldmcnv 38346

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 5909	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ dom ◡𝑅 ↔ ∃𝑢 𝐴◡𝑅𝑢))
2		brcnvg 5890	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑢 ∈ V) → (𝐴◡𝑅𝑢 ↔ 𝑢𝑅𝐴))
3	2	elvd 3486	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴◡𝑅𝑢 ↔ 𝑢𝑅𝐴))
4	3	exbidv 1921	. 2 ⊢ (𝐴 ∈ 𝑉 → (∃𝑢 𝐴◡𝑅𝑢 ↔ ∃𝑢 𝑢𝑅𝐴))
5	1, 4	bitrd 279	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ dom ◡𝑅 ↔ ∃𝑢 𝑢𝑅𝐴))

Syntax hints:   → wi 4   ↔ wb 206  ∃wex 1779   ∈ wcel 2108  Vcvv 3480   class class class wbr 5143  ^◡ccnv 5684  dom cdm 5685

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-br 5144  df-opab 5206  df-cnv 5693  df-dm 5695

This theorem is referenced by:  eldmcoss  38459