Theorem dmecd 39382

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

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2146   ≠ wne 2958  ∅c0 4280  dom cdm 5654  [cec 8726

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5251  ax-pr 5394

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-br 5106  df-opab 5170  df-xp 5660  df-cnv 5662  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-ec 8730

This theorem is used by:  dmec2d  39383