Theorem dmecd 39242

Description: Equality of the coset of 𝐵 and the coset of 𝐶 implies equivalence of domain elementhood (equivalence is not necessary as opposed to ereldm 8771). (Contributed by Peter Mazsa, 9-Oct-2018.)

Hypotheses

Ref	Expression
dmecd.1	⊢ (𝜑 → dom 𝑅 = 𝐴)
dmecd.2	⊢ (𝜑 → [𝐵]𝑅 = [𝐶]𝑅)

Assertion

Ref	Expression
dmecd	⊢ (𝜑 → (𝐵 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))

Proof of Theorem dmecd

Step	Hyp	Ref	Expression
1		dmecd.2	. . . 4 ⊢ (𝜑 → [𝐵]𝑅 = [𝐶]𝑅)
2	1	neeq1d 3015	. . 3 ⊢ (𝜑 → ([𝐵]𝑅 ≠ ∅ ↔ [𝐶]𝑅 ≠ ∅))
3		ecdmn0 8770	. . 3 ⊢ (𝐵 ∈ dom 𝑅 ↔ [𝐵]𝑅 ≠ ∅)
4		ecdmn0 8770	. . 3 ⊢ (𝐶 ∈ dom 𝑅 ↔ [𝐶]𝑅 ≠ ∅)
5	2, 3, 4	3bitr4g 317	. 2 ⊢ (𝜑 → (𝐵 ∈ dom 𝑅 ↔ 𝐶 ∈ dom 𝑅))
6		dmecd.1	. . 3 ⊢ (𝜑 → dom 𝑅 = 𝐴)
7	6	eleq2d 2847	. 2 ⊢ (𝜑 → (𝐵 ∈ dom 𝑅 ↔ 𝐵 ∈ 𝐴))
8	6	eleq2d 2847	. 2 ⊢ (𝜑 → (𝐶 ∈ dom 𝑅 ↔ 𝐶 ∈ 𝐴))
9	5, 7, 8	3bitr3d 312	1 ⊢ (𝜑 → (𝐵 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  ∅c0 4279  dom cdm 5651  [cec 8715

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 8719

This theorem is used by:  dmec2d  39243