| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nelpr1 | Structured version Visualization version GIF version | ||
| Description: If a class is not an element of an unordered pair, it is not the first listed element. (Contributed by Glauco Siliprandi, 3-Mar-2021.) |
| Ref | Expression |
|---|---|
| nelpr1.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| nelpr1.n | ⊢ (𝜑 → ¬ 𝐴 ∈ {𝐵, 𝐶}) |
| Ref | Expression |
|---|---|
| nelpr1 | ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nelpr1.n | . . 3 ⊢ (𝜑 → ¬ 𝐴 ∈ {𝐵, 𝐶}) | |
| 2 | animorrl 994 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐴 = 𝐵 ∨ 𝐴 = 𝐶)) | |
| 3 | nelpr1.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 4 | elprg 4606 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))) | |
| 5 | 3, 4 | syl 17 | . . . . 5 ⊢ (𝜑 → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))) |
| 6 | 5 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))) |
| 7 | 2, 6 | mpbird 259 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 ∈ {𝐵, 𝐶}) |
| 8 | 1, 7 | mtand 825 | . 2 ⊢ (𝜑 → ¬ 𝐴 = 𝐵) |
| 9 | 8 | neqned 2965 | 1 ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∨ wo 858 = wceq 1561 ∈ wcel 2143 ≠ wne 2958 {cpr 4585 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1564 df-ex 1801 df-sb 2092 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-v 3457 df-un 3910 df-sn 4584 df-pr 4586 |
| This theorem is referenced by: cyc3genpmlem 33337 ovnsubadd2lem 47210 |
| Copyright terms: Public domain | W3C validator |