Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > eqrdav | GIF version |
Description: Deduce equality of classes from an equivalence of membership that depends on the membership variable. (Contributed by NM, 7-Nov-2008.) |
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 132 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)) |
4 | 3 | impancom 247 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐵)) |
5 | 1, 4 | mpd 13 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐵) |
6 | eqrdav.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐶) | |
7 | 2 | exbiri 364 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐶 → (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐴))) |
8 | 7 | com23 72 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐴))) |
9 | 8 | imp 115 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐴)) |
10 | 6, 9 | mpd 13 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐴) |
11 | 5, 10 | impbida 528 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
12 | 11 | eqrdv 2038 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 ↔ wb 98 = wceq 1243 ∈ wcel 1393 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-5 1336 ax-gen 1338 ax-17 1419 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-cleq 2033 |
This theorem is referenced by: fzdifsuc 8943 |
Copyright terms: Public domain | W3C validator |