| 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 2205 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 = 𝐵) | |
| 2 | eleq1 2267 | . . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴)) | |
| 3 | 2 | anbi2d 464 | . . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝐵 ∈ 𝐴))) |
| 4 | neeq1 2388 | . . . . . 6 ⊢ (𝑥 = 𝐵 → (𝑥 ≠ 𝐵 ↔ 𝐵 ≠ 𝐵)) | |
| 5 | 3, 4 | imbi12d 234 | . . . . 5 ⊢ (𝑥 = 𝐵 → (((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ 𝐵) ↔ ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 ≠ 𝐵))) |
| 6 | nelrdva.1 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ 𝐵) | |
| 7 | 5, 6 | vtoclg 2832 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 ≠ 𝐵)) |
| 8 | 7 | anabsi7 581 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 ≠ 𝐵) |
| 9 | 8 | neneqd 2396 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵 = 𝐵) |
| 10 | 1, 9 | pm2.65da 662 | 1 ⊢ (𝜑 → ¬ 𝐵 ∈ 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1372 ∈ wcel 2175 ≠ wne 2375 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-ext 2186 |
| This theorem depends on definitions: df-bi 117 df-tru 1375 df-nf 1483 df-sb 1785 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-v 2773 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |