Theorem ecdmn0 8754

Description: A representative of a nonempty equivalence class belongs to the domain of the equivalence relation. (Contributed by NM, 15-Feb-1996.) (Revised by Mario Carneiro, 9-Jul-2014.)

Assertion

Ref	Expression
ecdmn0	⊢ (𝐴 ∈ dom 𝑅 ↔ [𝐴]𝑅 ≠ ∅)

Proof of Theorem ecdmn0

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3472	. 2 ⊢ (𝐴 ∈ dom 𝑅 → 𝐴 ∈ V)
2		n0 4300	. . 3 ⊢ ([𝐴]𝑅 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ [𝐴]𝑅)
3		ecexr 8706	. . . 4 ⊢ (𝑥 ∈ [𝐴]𝑅 → 𝐴 ∈ V)
4	3	exlimiv 1963	. . 3 ⊢ (∃𝑥 𝑥 ∈ [𝐴]𝑅 → 𝐴 ∈ V)
5	2, 4	sylbi 220	. 2 ⊢ ([𝐴]𝑅 ≠ ∅ → 𝐴 ∈ V)
6		vex 3455	. . . . 5 ⊢ 𝑥 ∈ V
7		elecg 8746	. . . . 5 ⊢ ((𝑥 ∈ V ∧ 𝐴 ∈ V) → (𝑥 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝑥))
8	6, 7	mpan 703	. . . 4 ⊢ (𝐴 ∈ V → (𝑥 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝑥))
9	8	exbidv 1954	. . 3 ⊢ (𝐴 ∈ V → (∃𝑥 𝑥 ∈ [𝐴]𝑅 ↔ ∃𝑥 𝐴𝑅𝑥))
10	2	a1i 11	. . 3 ⊢ (𝐴 ∈ V → ([𝐴]𝑅 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ [𝐴]𝑅))
11		eldmg 5880	. . 3 ⊢ (𝐴 ∈ V → (𝐴 ∈ dom 𝑅 ↔ ∃𝑥 𝐴𝑅𝑥))
12	9, 10, 11	3bitr4rd 315	. 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ dom 𝑅 ↔ [𝐴]𝑅 ≠ ∅))
13	1, 5, 12	pm5.21nii 381	1 ⊢ (𝐴 ∈ dom 𝑅 ↔ [𝐴]𝑅 ≠ ∅)

This proof depends on syntax axioms:   ↔ wb 209  ∃wex 1812   ∈ wcel 2145   ≠ wne 2956  Vcvv 3451  ∅c0 4279   class class class wbr 5103  dom cdm 5651  [cec 8699

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ec 8703

This theorem is used by:  ereldm  8755  elqsn0  8789  ecelqsdm  8790  eceqoveq  8827  divsfval  17699  sylow1lem5  19796  vitalilem2  25910  vitalilem3  25911  dfdm6  39207  dmecd  39210  n0elqs  39232  disjimeceqim  39704