Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eqrdav | Structured version Visualization version GIF version |
Description: Deduce equality of classes from an equivalence of membership that depends on the membership variable. (Contributed by NM, 7-Nov-2008.) (Proof shortened by Wolf Lammen, 19-Nov-2019.) |
Ref | Expression |
---|---|
eqrdav.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐶) |
eqrdav.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐶) |
eqrdav.3 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
Ref | Expression |
---|---|
eqrdav | ⊢ (𝜑 → 𝐴 = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqrdav.1 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐶) | |
2 | eqrdav.3 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
3 | 2 | biimpd 228 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)) |
4 | 3 | impancom 452 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐵)) |
5 | 1, 4 | mpd 15 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐵) |
6 | eqrdav.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐶) | |
7 | 2 | biimprd 247 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐴)) |
8 | 7 | impancom 452 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐴)) |
9 | 6, 8 | mpd 15 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐴) |
10 | 5, 9 | impbida 798 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
11 | 10 | eqrdv 2736 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-ex 1783 df-cleq 2730 |
This theorem is referenced by: boxcutc 8729 supminf 12675 f1omvdconj 19054 fmucndlem 23443 lsmsnorb 31579 ballotlemsima 32482 supminfxr 43004 |
Copyright terms: Public domain | W3C validator |