| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pr2ne | Structured version Visualization version GIF version | ||
| Description: If an unordered pair has two elements, then they are different. (Contributed by FL, 14-Feb-2010.) Avoid ax-pow 5304, ax-un 7684. (Revised by BTernaryTau, 30-Dec-2024.) |
| Ref | Expression |
|---|---|
| pr2ne | ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ({𝐴, 𝐵} ≈ 2o ↔ 𝐴 ≠ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snnen2o 9150 | . . . 4 ⊢ ¬ {𝐴} ≈ 2o | |
| 2 | dfsn2 4581 | . . . . . 6 ⊢ {𝐴} = {𝐴, 𝐴} | |
| 3 | preq2 4679 | . . . . . 6 ⊢ (𝐴 = 𝐵 → {𝐴, 𝐴} = {𝐴, 𝐵}) | |
| 4 | 2, 3 | eqtr2id 2785 | . . . . 5 ⊢ (𝐴 = 𝐵 → {𝐴, 𝐵} = {𝐴}) |
| 5 | 4 | breq1d 5096 | . . . 4 ⊢ (𝐴 = 𝐵 → ({𝐴, 𝐵} ≈ 2o ↔ {𝐴} ≈ 2o)) |
| 6 | 1, 5 | mtbiri 327 | . . 3 ⊢ (𝐴 = 𝐵 → ¬ {𝐴, 𝐵} ≈ 2o) |
| 7 | 6 | necon2ai 2962 | . 2 ⊢ ({𝐴, 𝐵} ≈ 2o → 𝐴 ≠ 𝐵) |
| 8 | enpr2 9921 | . . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷 ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} ≈ 2o) | |
| 9 | 8 | 3expia 1122 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 ≠ 𝐵 → {𝐴, 𝐵} ≈ 2o)) |
| 10 | 7, 9 | impbid2 226 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ({𝐴, 𝐵} ≈ 2o ↔ 𝐴 ≠ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 {csn 4568 {cpr 4570 class class class wbr 5086 2oc2o 8394 ≈ cen 8885 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pr 5372 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-id 5521 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-suc 6325 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-1o 8400 df-2o 8401 df-en 8889 |
| This theorem is referenced by: prdom2 9923 isprm2lem 16645 pmtrrn2 19430 mdetunilem7 22597 trsp2cyc 33203 en2pr 43996 pr2cv 43997 pren2 44002 |
| Copyright terms: Public domain | W3C validator |