![]() |
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 2178 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 = 𝐵) | |
2 | eleq1 2240 | . . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴)) | |
3 | 2 | anbi2d 464 | . . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝐵 ∈ 𝐴))) |
4 | neeq1 2360 | . . . . . 6 ⊢ (𝑥 = 𝐵 → (𝑥 ≠ 𝐵 ↔ 𝐵 ≠ 𝐵)) | |
5 | 3, 4 | imbi12d 234 | . . . . 5 ⊢ (𝑥 = 𝐵 → (((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ 𝐵) ↔ ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 ≠ 𝐵))) |
6 | nelrdva.1 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ 𝐵) | |
7 | 5, 6 | vtoclg 2799 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 ≠ 𝐵)) |
8 | 7 | anabsi7 581 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 ≠ 𝐵) |
9 | 8 | neneqd 2368 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵 = 𝐵) |
10 | 1, 9 | pm2.65da 661 | 1 ⊢ (𝜑 → ¬ 𝐵 ∈ 𝐴) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1353 ∈ wcel 2148 ≠ wne 2347 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-v 2741 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |