ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  prneimg Structured version   GIF version

Theorem prneimg 3519
Description: Two pairs are not equal if at least one element of the first pair is not contained in the second pair. (Contributed by Alexander van der Vekens, 13-Aug-2017.)
Assertion
Ref Expression
prneimg (((A 𝑈 B 𝑉) (𝐶 𝑋 𝐷 𝑌)) → (((A𝐶 A𝐷) (B𝐶 B𝐷)) → {A, B} ≠ {𝐶, 𝐷}))

Proof of Theorem prneimg
StepHypRef Expression
1 preq12bg 3518 . . . . 5 (((A 𝑈 B 𝑉) (𝐶 𝑋 𝐷 𝑌)) → ({A, B} = {𝐶, 𝐷} ↔ ((A = 𝐶 B = 𝐷) (A = 𝐷 B = 𝐶))))
2 orddi 721 . . . . . 6 (((A = 𝐶 B = 𝐷) (A = 𝐷 B = 𝐶)) ↔ (((A = 𝐶 A = 𝐷) (A = 𝐶 B = 𝐶)) ((B = 𝐷 A = 𝐷) (B = 𝐷 B = 𝐶))))
3 simpll 469 . . . . . . 7 ((((A = 𝐶 A = 𝐷) (A = 𝐶 B = 𝐶)) ((B = 𝐷 A = 𝐷) (B = 𝐷 B = 𝐶))) → (A = 𝐶 A = 𝐷))
4 pm1.4 633 . . . . . . . 8 ((B = 𝐷 B = 𝐶) → (B = 𝐶 B = 𝐷))
54ad2antll 464 . . . . . . 7 ((((A = 𝐶 A = 𝐷) (A = 𝐶 B = 𝐶)) ((B = 𝐷 A = 𝐷) (B = 𝐷 B = 𝐶))) → (B = 𝐶 B = 𝐷))
63, 5jca 290 . . . . . 6 ((((A = 𝐶 A = 𝐷) (A = 𝐶 B = 𝐶)) ((B = 𝐷 A = 𝐷) (B = 𝐷 B = 𝐶))) → ((A = 𝐶 A = 𝐷) (B = 𝐶 B = 𝐷)))
72, 6sylbi 114 . . . . 5 (((A = 𝐶 B = 𝐷) (A = 𝐷 B = 𝐶)) → ((A = 𝐶 A = 𝐷) (B = 𝐶 B = 𝐷)))
81, 7syl6bi 152 . . . 4 (((A 𝑈 B 𝑉) (𝐶 𝑋 𝐷 𝑌)) → ({A, B} = {𝐶, 𝐷} → ((A = 𝐶 A = 𝐷) (B = 𝐶 B = 𝐷))))
9 oranim 800 . . . . . 6 ((A = 𝐶 A = 𝐷) → ¬ (¬ A = 𝐶 ¬ A = 𝐷))
10 df-ne 2188 . . . . . . 7 (A𝐶 ↔ ¬ A = 𝐶)
11 df-ne 2188 . . . . . . 7 (A𝐷 ↔ ¬ A = 𝐷)
1210, 11anbi12i 436 . . . . . 6 ((A𝐶 A𝐷) ↔ (¬ A = 𝐶 ¬ A = 𝐷))
139, 12sylnibr 589 . . . . 5 ((A = 𝐶 A = 𝐷) → ¬ (A𝐶 A𝐷))
14 oranim 800 . . . . . 6 ((B = 𝐶 B = 𝐷) → ¬ (¬ B = 𝐶 ¬ B = 𝐷))
15 df-ne 2188 . . . . . . 7 (B𝐶 ↔ ¬ B = 𝐶)
16 df-ne 2188 . . . . . . 7 (B𝐷 ↔ ¬ B = 𝐷)
1715, 16anbi12i 436 . . . . . 6 ((B𝐶 B𝐷) ↔ (¬ B = 𝐶 ¬ B = 𝐷))
1814, 17sylnibr 589 . . . . 5 ((B = 𝐶 B = 𝐷) → ¬ (B𝐶 B𝐷))
1913, 18anim12i 321 . . . 4 (((A = 𝐶 A = 𝐷) (B = 𝐶 B = 𝐷)) → (¬ (A𝐶 A𝐷) ¬ (B𝐶 B𝐷)))
208, 19syl6 29 . . 3 (((A 𝑈 B 𝑉) (𝐶 𝑋 𝐷 𝑌)) → ({A, B} = {𝐶, 𝐷} → (¬ (A𝐶 A𝐷) ¬ (B𝐶 B𝐷))))
21 pm4.56 799 . . 3 ((¬ (A𝐶 A𝐷) ¬ (B𝐶 B𝐷)) ↔ ¬ ((A𝐶 A𝐷) (B𝐶 B𝐷)))
2220, 21syl6ib 150 . 2 (((A 𝑈 B 𝑉) (𝐶 𝑋 𝐷 𝑌)) → ({A, B} = {𝐶, 𝐷} → ¬ ((A𝐶 A𝐷) (B𝐶 B𝐷))))
2322necon2ad 2240 1 (((A 𝑈 B 𝑉) (𝐶 𝑋 𝐷 𝑌)) → (((A𝐶 A𝐷) (B𝐶 B𝐷)) → {A, B} ≠ {𝐶, 𝐷}))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4   wa 97   wo 616   = wceq 1228   wcel 1374  wne 2186  {cpr 3351
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 532  ax-in2 533  ax-io 617  ax-5 1316  ax-7 1317  ax-gen 1318  ax-ie1 1363  ax-ie2 1364  ax-8 1376  ax-10 1377  ax-11 1378  ax-i12 1379  ax-bnd 1380  ax-4 1381  ax-17 1400  ax-i9 1404  ax-ial 1409  ax-i5r 1410  ax-ext 2004
This theorem depends on definitions:  df-bi 110  df-3an 875  df-tru 1231  df-nf 1330  df-sb 1628  df-clab 2009  df-cleq 2015  df-clel 2018  df-nfc 2149  df-ne 2188  df-v 2537  df-un 2899  df-sn 3356  df-pr 3357
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator