Theorem dmecd 39019

Description: Equality of the coset of 𝐵 and the coset of 𝐶 implies equivalence of domain elementhood (equivalence is not necessary as opposed to ereldm 8754). (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 3019	. . 3 ⊢ (𝜑 → ([𝐵]𝑅 ≠ ∅ ↔ [𝐶]𝑅 ≠ ∅))
3		ecdmn0 8753	. . 3 ⊢ (𝐵 ∈ dom 𝑅 ↔ [𝐵]𝑅 ≠ ∅)
4		ecdmn0 8753	. . 3 ⊢ (𝐶 ∈ dom 𝑅 ↔ [𝐶]𝑅 ≠ ∅)
5	2, 3, 4	3bitr4g 317	. 2 ⊢ (𝜑 → (𝐵 ∈ dom 𝑅 ↔ 𝐶 ∈ dom 𝑅))
6		dmecd.1	. . 3 ⊢ (𝜑 → dom 𝑅 = 𝐴)
7	6	eleq2d 2851	. 2 ⊢ (𝜑 → (𝐵 ∈ dom 𝑅 ↔ 𝐵 ∈ 𝐴))
8	6	eleq2d 2851	. 2 ⊢ (𝜑 → (𝐶 ∈ dom 𝑅 ↔ 𝐶 ∈ 𝐴))
9	5, 7, 8	3bitr3d 312	1 ⊢ (𝜑 → (𝐵 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2146   ≠ wne 2960  ∅c0 4286  dom cdm 5663  [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 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406

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 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-xp 5669  df-cnv 5671  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ec 8702

This theorem is used by:  dmec2d  39020