![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > prneprprc | Structured version Visualization version GIF version |
Description: A proper unordered pair is not an improper unordered pair. (Contributed by AV, 13-Jun-2022.) |
Ref | Expression |
---|---|
prneprprc | ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) ∧ ¬ 𝐶 ∈ V) → {𝐴, 𝐵} ≠ {𝐶, 𝐷}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prnesn 4868 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} ≠ {𝐷}) | |
2 | 1 | adantr 479 | . 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) ∧ ¬ 𝐶 ∈ V) → {𝐴, 𝐵} ≠ {𝐷}) |
3 | prprc1 4774 | . . . 4 ⊢ (¬ 𝐶 ∈ V → {𝐶, 𝐷} = {𝐷}) | |
4 | 3 | neeq2d 2991 | . . 3 ⊢ (¬ 𝐶 ∈ V → ({𝐴, 𝐵} ≠ {𝐶, 𝐷} ↔ {𝐴, 𝐵} ≠ {𝐷})) |
5 | 4 | adantl 480 | . 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) ∧ ¬ 𝐶 ∈ V) → ({𝐴, 𝐵} ≠ {𝐶, 𝐷} ↔ {𝐴, 𝐵} ≠ {𝐷})) |
6 | 2, 5 | mpbird 256 | 1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) ∧ ¬ 𝐶 ∈ V) → {𝐴, 𝐵} ≠ {𝐶, 𝐷}) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 ∈ wcel 2099 ≠ wne 2930 Vcvv 3462 {csn 4633 {cpr 4635 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-ext 2697 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-sb 2061 df-clab 2704 df-cleq 2718 df-clel 2803 df-ne 2931 df-v 3464 df-dif 3950 df-un 3952 df-nul 4326 df-sn 4634 df-pr 4636 |
This theorem is referenced by: preq12nebg 4871 opthprneg 4873 |
Copyright terms: Public domain | W3C validator |