MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pr2ne Structured version   Visualization version   GIF version

Theorem pr2ne 9505
Description: If an unordered pair has two elements they are different. (Contributed by FL, 14-Feb-2010.)
Assertion
Ref Expression
pr2ne ((𝐴𝐶𝐵𝐷) → ({𝐴, 𝐵} ≈ 2o𝐴𝐵))

Proof of Theorem pr2ne
StepHypRef Expression
1 preq2 4625 . . . . 5 (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴, 𝐴})
21eqcoms 2746 . . . 4 (𝐴 = 𝐵 → {𝐴, 𝐵} = {𝐴, 𝐴})
3 enpr1g 8622 . . . . . . . 8 (𝐴𝐶 → {𝐴, 𝐴} ≈ 1o)
4 entr 8607 . . . . . . . . . . . 12 (({𝐴, 𝐵} ≈ {𝐴, 𝐴} ∧ {𝐴, 𝐴} ≈ 1o) → {𝐴, 𝐵} ≈ 1o)
5 1sdom2 8796 . . . . . . . . . . . . . . 15 1o ≺ 2o
6 sdomnen 8584 . . . . . . . . . . . . . . 15 (1o ≺ 2o → ¬ 1o ≈ 2o)
75, 6ax-mp 5 . . . . . . . . . . . . . 14 ¬ 1o ≈ 2o
8 ensym 8604 . . . . . . . . . . . . . . 15 ({𝐴, 𝐵} ≈ 1o → 1o ≈ {𝐴, 𝐵})
9 entr 8607 . . . . . . . . . . . . . . . 16 ((1o ≈ {𝐴, 𝐵} ∧ {𝐴, 𝐵} ≈ 2o) → 1o ≈ 2o)
109ex 416 . . . . . . . . . . . . . . 15 (1o ≈ {𝐴, 𝐵} → ({𝐴, 𝐵} ≈ 2o → 1o ≈ 2o))
118, 10syl 17 . . . . . . . . . . . . . 14 ({𝐴, 𝐵} ≈ 1o → ({𝐴, 𝐵} ≈ 2o → 1o ≈ 2o))
127, 11mtoi 202 . . . . . . . . . . . . 13 ({𝐴, 𝐵} ≈ 1o → ¬ {𝐴, 𝐵} ≈ 2o)
1312a1d 25 . . . . . . . . . . . 12 ({𝐴, 𝐵} ≈ 1o → ((𝐴𝐶𝐵𝐷) → ¬ {𝐴, 𝐵} ≈ 2o))
144, 13syl 17 . . . . . . . . . . 11 (({𝐴, 𝐵} ≈ {𝐴, 𝐴} ∧ {𝐴, 𝐴} ≈ 1o) → ((𝐴𝐶𝐵𝐷) → ¬ {𝐴, 𝐵} ≈ 2o))
1514ex 416 . . . . . . . . . 10 ({𝐴, 𝐵} ≈ {𝐴, 𝐴} → ({𝐴, 𝐴} ≈ 1o → ((𝐴𝐶𝐵𝐷) → ¬ {𝐴, 𝐵} ≈ 2o)))
16 prex 5299 . . . . . . . . . . 11 {𝐴, 𝐵} ∈ V
17 eqeng 8589 . . . . . . . . . . 11 ({𝐴, 𝐵} ∈ V → ({𝐴, 𝐵} = {𝐴, 𝐴} → {𝐴, 𝐵} ≈ {𝐴, 𝐴}))
1816, 17ax-mp 5 . . . . . . . . . 10 ({𝐴, 𝐵} = {𝐴, 𝐴} → {𝐴, 𝐵} ≈ {𝐴, 𝐴})
1915, 18syl11 33 . . . . . . . . 9 ({𝐴, 𝐴} ≈ 1o → ({𝐴, 𝐵} = {𝐴, 𝐴} → ((𝐴𝐶𝐵𝐷) → ¬ {𝐴, 𝐵} ≈ 2o)))
2019a1dd 50 . . . . . . . 8 ({𝐴, 𝐴} ≈ 1o → ({𝐴, 𝐵} = {𝐴, 𝐴} → (𝐵𝐷 → ((𝐴𝐶𝐵𝐷) → ¬ {𝐴, 𝐵} ≈ 2o))))
213, 20syl 17 . . . . . . 7 (𝐴𝐶 → ({𝐴, 𝐵} = {𝐴, 𝐴} → (𝐵𝐷 → ((𝐴𝐶𝐵𝐷) → ¬ {𝐴, 𝐵} ≈ 2o))))
2221com23 86 . . . . . 6 (𝐴𝐶 → (𝐵𝐷 → ({𝐴, 𝐵} = {𝐴, 𝐴} → ((𝐴𝐶𝐵𝐷) → ¬ {𝐴, 𝐵} ≈ 2o))))
2322imp 410 . . . . 5 ((𝐴𝐶𝐵𝐷) → ({𝐴, 𝐵} = {𝐴, 𝐴} → ((𝐴𝐶𝐵𝐷) → ¬ {𝐴, 𝐵} ≈ 2o)))
2423pm2.43a 54 . . . 4 ((𝐴𝐶𝐵𝐷) → ({𝐴, 𝐵} = {𝐴, 𝐴} → ¬ {𝐴, 𝐵} ≈ 2o))
252, 24syl5 34 . . 3 ((𝐴𝐶𝐵𝐷) → (𝐴 = 𝐵 → ¬ {𝐴, 𝐵} ≈ 2o))
2625necon2ad 2949 . 2 ((𝐴𝐶𝐵𝐷) → ({𝐴, 𝐵} ≈ 2o𝐴𝐵))
27 pr2nelem 9504 . . 3 ((𝐴𝐶𝐵𝐷𝐴𝐵) → {𝐴, 𝐵} ≈ 2o)
28273expia 1122 . 2 ((𝐴𝐶𝐵𝐷) → (𝐴𝐵 → {𝐴, 𝐵} ≈ 2o))
2926, 28impbid 215 1 ((𝐴𝐶𝐵𝐷) → ({𝐴, 𝐵} ≈ 2o𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399   = wceq 1542  wcel 2114  wne 2934  Vcvv 3398  {cpr 4518   class class class wbr 5030  1oc1o 8124  2oc2o 8125  cen 8552  csdm 8554
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2710  ax-sep 5167  ax-nul 5174  ax-pow 5232  ax-pr 5296  ax-un 7479
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2540  df-eu 2570  df-clab 2717  df-cleq 2730  df-clel 2811  df-nfc 2881  df-ne 2935  df-ral 3058  df-rex 3059  df-reu 3060  df-rab 3062  df-v 3400  df-sbc 3681  df-dif 3846  df-un 3848  df-in 3850  df-ss 3860  df-pss 3862  df-nul 4212  df-if 4415  df-pw 4490  df-sn 4517  df-pr 4519  df-tp 4521  df-op 4523  df-uni 4797  df-br 5031  df-opab 5093  df-tr 5137  df-id 5429  df-eprel 5434  df-po 5442  df-so 5443  df-fr 5483  df-we 5485  df-xp 5531  df-rel 5532  df-cnv 5533  df-co 5534  df-dm 5535  df-rn 5536  df-res 5537  df-ima 5538  df-ord 6175  df-on 6176  df-lim 6177  df-suc 6178  df-iota 6297  df-fun 6341  df-fn 6342  df-f 6343  df-f1 6344  df-fo 6345  df-f1o 6346  df-fv 6347  df-om 7600  df-1o 8131  df-2o 8132  df-er 8320  df-en 8556  df-dom 8557  df-sdom 8558
This theorem is referenced by:  prdom2  9506  isprm2lem  16122  pmtrrn2  18706  mdetunilem7  21369  trsp2cyc  30967  en2pr  40699  pr2cv  40700  pren2  40705
  Copyright terms: Public domain W3C validator