| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nelrdva | Structured version Visualization version 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 2770 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 = 𝐵) | |
| 2 | eleq1 2857 | . . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴)) | |
| 3 | 2 | anbi2d 641 | . . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝐵 ∈ 𝐴))) |
| 4 | neeq1 3026 | . . . . . 6 ⊢ (𝑥 = 𝐵 → (𝑥 ≠ 𝐵 ↔ 𝐵 ≠ 𝐵)) | |
| 5 | 3, 4 | imbi12d 347 | . . . . 5 ⊢ (𝑥 = 𝐵 → (((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ 𝐵) ↔ ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 ≠ 𝐵))) |
| 6 | nelrdva.1 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ 𝐵) | |
| 7 | 5, 6 | vtoclg 3531 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 ≠ 𝐵)) |
| 8 | 7 | anabsi7 683 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → 𝐵 ≠ 𝐵) |
| 9 | 8 | neneqd 2969 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵 = 𝐵) |
| 10 | 1, 9 | pm2.65da 828 | 1 ⊢ (𝜑 → ¬ 𝐵 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1570 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 |
| This theorem is referenced by: ustfilxp 24339 metustfbas 24683 drngmxidl 33704 dflringlem2 33730 fourierdlem72 46818 |
| Copyright terms: Public domain | W3C validator |