Theorem eqrdav 2164

Description: Deduce equality of classes from an equivalence of membership that depends on the membership variable. (Contributed by NM, 7-Nov-2008.)

Hypotheses

Ref	Expression
eqrdav.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐶)
eqrdav.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐶)
eqrdav.3	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))

Assertion

Ref	Expression
eqrdav	⊢ (𝜑 → 𝐴 = 𝐵)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜑,𝑥

Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem eqrdav

Step	Hyp	Ref	Expression
1		eqrdav.1	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐶)
2		eqrdav.3	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
3	2	biimpd 143	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
4	3	impancom 258	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐵))
5	1, 4	mpd 13	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐵)
6		eqrdav.2	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐶)
7	2	exbiri 380	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐶 → (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐴)))
8	7	com23 78	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐴)))
9	8	imp 123	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐴))
10	6, 9	mpd 13	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐴)
11	5, 10	impbida 586	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
12	11	eqrdv 2163	1 ⊢ (𝜑 → 𝐴 = 𝐵)

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1343   ∈ wcel 2136

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1435  ax-gen 1437  ax-17 1514  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-cleq 2158

This theorem is referenced by:  supminfex  9535  fzdifsuc  10016