Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nelrdva | GIF version |
Description: Deduce negative membership from an implication. (Contributed by Thierry Arnoux, 27-Nov-2017.) |
Ref | Expression |
---|---|
nelrdva.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ 𝐵) |
Ref | Expression |
---|---|
nelrdva | ⊢ (𝜑 → ¬ 𝐵 ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqidd 2041 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 = 𝐵) | |
2 | eleq1 2100 | . . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴)) | |
3 | 2 | anbi2d 437 | . . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝐵 ∈ 𝐴))) |
4 | neeq1 2218 | . . . . . 6 ⊢ (𝑥 = 𝐵 → (𝑥 ≠ 𝐵 ↔ 𝐵 ≠ 𝐵)) | |
5 | 3, 4 | imbi12d 223 | . . . . 5 ⊢ (𝑥 = 𝐵 → (((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ 𝐵) ↔ ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 ≠ 𝐵))) |
6 | nelrdva.1 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ 𝐵) | |
7 | 5, 6 | vtoclg 2613 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 ≠ 𝐵)) |
8 | 7 | anabsi7 515 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 ≠ 𝐵) |
9 | 8 | neneqd 2226 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵 = 𝐵) |
10 | 1, 9 | pm2.65da 587 | 1 ⊢ (𝜑 → ¬ 𝐵 ∈ 𝐴) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 97 = wceq 1243 ∈ wcel 1393 ≠ wne 2204 |
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-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-v 2559 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |