![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > elprn1 | Structured version Visualization version GIF version |
Description: A member of an unordered pair that is not the "first", must be the "second". (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
Ref | Expression |
---|---|
elprn1 | ⊢ ((𝐴 ∈ {𝐵, 𝐶} ∧ 𝐴 ≠ 𝐵) → 𝐴 = 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | neneq 2993 | . . 3 ⊢ (𝐴 ≠ 𝐵 → ¬ 𝐴 = 𝐵) | |
2 | 1 | adantl 485 | . 2 ⊢ ((𝐴 ∈ {𝐵, 𝐶} ∧ 𝐴 ≠ 𝐵) → ¬ 𝐴 = 𝐵) |
3 | elpri 4547 | . . . 4 ⊢ (𝐴 ∈ {𝐵, 𝐶} → (𝐴 = 𝐵 ∨ 𝐴 = 𝐶)) | |
4 | 3 | adantr 484 | . . 3 ⊢ ((𝐴 ∈ {𝐵, 𝐶} ∧ 𝐴 ≠ 𝐵) → (𝐴 = 𝐵 ∨ 𝐴 = 𝐶)) |
5 | 4 | ord 861 | . 2 ⊢ ((𝐴 ∈ {𝐵, 𝐶} ∧ 𝐴 ≠ 𝐵) → (¬ 𝐴 = 𝐵 → 𝐴 = 𝐶)) |
6 | 2, 5 | mpd 15 | 1 ⊢ ((𝐴 ∈ {𝐵, 𝐶} ∧ 𝐴 ≠ 𝐵) → 𝐴 = 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∨ wo 844 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 {cpr 4527 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-tru 1541 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-ne 2988 df-v 3443 df-un 3886 df-sn 4526 df-pr 4528 |
This theorem is referenced by: fourierdlem70 42818 fourierdlem71 42819 fouriersw 42873 prsal 42960 sge0pr 43033 |
Copyright terms: Public domain | W3C validator |