Theorem ecdmn0 8753

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 3474	. 2 ⊢ (𝐴 ∈ dom 𝑅 → 𝐴 ∈ V)
2		n0 4303	. . 3 ⊢ ([𝐴]𝑅 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ [𝐴]𝑅)
3		ecexr 8705	. . . 4 ⊢ (𝑥 ∈ [𝐴]𝑅 → 𝐴 ∈ V)
4	3	exlimiv 1963	. . 3 ⊢ (∃𝑥 𝑥 ∈ [𝐴]𝑅 → 𝐴 ∈ V)
5	2, 4	sylbi 220	. 2 ⊢ ([𝐴]𝑅 ≠ ∅ → 𝐴 ∈ V)
6		vex 3457	. . . . 5 ⊢ 𝑥 ∈ V
7		elecg 8745	. . . . 5 ⊢ ((𝑥 ∈ V ∧ 𝐴 ∈ V) → (𝑥 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝑥))
8	6, 7	mpan 703	. . . 4 ⊢ (𝐴 ∈ V → (𝑥 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝑥))
9	8	exbidv 1954	. . 3 ⊢ (𝐴 ∈ V → (∃𝑥 𝑥 ∈ [𝐴]𝑅 ↔ ∃𝑥 𝐴𝑅𝑥))
10	2	a1i 11	. . 3 ⊢ (𝐴 ∈ V → ([𝐴]𝑅 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ [𝐴]𝑅))
11		eldmg 5886	. . 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 2957  Vcvv 3453  ∅c0 4282   class class class wbr 5107  dom cdm 5659  [cec 8698

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 2734  ax-sep 5255  ax-pr 5402

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 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-xp 5665  df-cnv 5667  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ec 8702

This theorem is used by:  ereldm  8754  elqsn0  8788  ecelqsdm  8789  eceqoveq  8826  divsfval  17639  sylow1lem5  19735  vitalilem2  25843  vitalilem3  25844  dfdm6  39063  dmecd  39066  n0elqs  39088  disjimeceqim  39560