![]() |
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 4609 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} ≠ {𝐷}) | |
2 | 1 | adantr 474 | . 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) ∧ ¬ 𝐶 ∈ V) → {𝐴, 𝐵} ≠ {𝐷}) |
3 | prprc1 4518 | . . . 4 ⊢ (¬ 𝐶 ∈ V → {𝐶, 𝐷} = {𝐷}) | |
4 | 3 | neeq2d 3059 | . . 3 ⊢ (¬ 𝐶 ∈ V → ({𝐴, 𝐵} ≠ {𝐶, 𝐷} ↔ {𝐴, 𝐵} ≠ {𝐷})) |
5 | 4 | adantl 475 | . 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) ∧ ¬ 𝐶 ∈ V) → ({𝐴, 𝐵} ≠ {𝐶, 𝐷} ↔ {𝐴, 𝐵} ≠ {𝐷})) |
6 | 2, 5 | mpbird 249 | 1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ≠ 𝐵) ∧ ¬ 𝐶 ∈ V) → {𝐴, 𝐵} ≠ {𝐶, 𝐷}) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 198 ∧ wa 386 ∧ w3a 1113 ∈ wcel 2166 ≠ wne 2999 Vcvv 3414 {csn 4397 {cpr 4399 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1896 ax-4 1910 ax-5 2011 ax-6 2077 ax-7 2114 ax-9 2175 ax-10 2194 ax-11 2209 ax-12 2222 ax-13 2391 ax-ext 2803 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 881 df-3an 1115 df-tru 1662 df-ex 1881 df-nf 1885 df-sb 2070 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ne 3000 df-v 3416 df-dif 3801 df-un 3803 df-nul 4145 df-sn 4398 df-pr 4400 |
This theorem is referenced by: preq12nebg 4613 opthprneg 4615 |
Copyright terms: Public domain | W3C validator |