Users' Mathboxes Mathbox for Alan Sare < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ax6e2ndeqALT Structured version   Visualization version   GIF version

Theorem ax6e2ndeqALT 38685
Description: "At least two sets exist" expressed in the form of dtru 4822 is logically equivalent to the same expressed in a form similar to ax6e 2249 if dtru 4822 is false implies 𝑢 = 𝑣. Proof derived by completeusersproof.c from User's Proof in VirtualDeductionProofs.txt. The User's Proof in html format is displayed in ax6e2ndeqVD 38663. (Contributed by Alan Sare, 11-Sep-2016.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
ax6e2ndeqALT ((¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣) ↔ ∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣))
Distinct variable groups:   𝑥,𝑢   𝑦,𝑢   𝑥,𝑣   𝑦,𝑣

Proof of Theorem ax6e2ndeqALT
StepHypRef Expression
1 ax6e2nd 38291 . . 3 (¬ ∀𝑥 𝑥 = 𝑦 → ∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣))
2 ax6e2eq 38290 . . . 4 (∀𝑥 𝑥 = 𝑦 → (𝑢 = 𝑣 → ∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣)))
31a1d 25 . . . 4 (¬ ∀𝑥 𝑥 = 𝑦 → (𝑢 = 𝑣 → ∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣)))
4 exmid 431 . . . 4 (∀𝑥 𝑥 = 𝑦 ∨ ¬ ∀𝑥 𝑥 = 𝑦)
5 jao 534 . . . . 5 ((∀𝑥 𝑥 = 𝑦 → (𝑢 = 𝑣 → ∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣))) → ((¬ ∀𝑥 𝑥 = 𝑦 → (𝑢 = 𝑣 → ∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣))) → ((∀𝑥 𝑥 = 𝑦 ∨ ¬ ∀𝑥 𝑥 = 𝑦) → (𝑢 = 𝑣 → ∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣)))))
653imp 1254 . . . 4 (((∀𝑥 𝑥 = 𝑦 → (𝑢 = 𝑣 → ∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣))) ∧ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑢 = 𝑣 → ∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣))) ∧ (∀𝑥 𝑥 = 𝑦 ∨ ¬ ∀𝑥 𝑥 = 𝑦)) → (𝑢 = 𝑣 → ∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣)))
72, 3, 4, 6mp3an 1421 . . 3 (𝑢 = 𝑣 → ∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣))
81, 7jaoi 394 . 2 ((¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣) → ∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣))
9 hbnae 2316 . . . . . . . . 9 (¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑦 ¬ ∀𝑥 𝑥 = 𝑦)
109eximi 1759 . . . . . . . 8 (∃𝑦 ¬ ∀𝑥 𝑥 = 𝑦 → ∃𝑦𝑦 ¬ ∀𝑥 𝑥 = 𝑦)
11 nfa1 2025 . . . . . . . . 9 𝑦𝑦 ¬ ∀𝑥 𝑥 = 𝑦
121119.9 2070 . . . . . . . 8 (∃𝑦𝑦 ¬ ∀𝑥 𝑥 = 𝑦 ↔ ∀𝑦 ¬ ∀𝑥 𝑥 = 𝑦)
1310, 12sylib 208 . . . . . . 7 (∃𝑦 ¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑦 ¬ ∀𝑥 𝑥 = 𝑦)
14 sp 2051 . . . . . . 7 (∀𝑦 ¬ ∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑥 𝑥 = 𝑦)
1513, 14syl 17 . . . . . 6 (∃𝑦 ¬ ∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑥 𝑥 = 𝑦)
16 excom 2039 . . . . . . 7 (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) ↔ ∃𝑦𝑥(𝑥 = 𝑢𝑦 = 𝑣))
17 nfa1 2025 . . . . . . . . . . . 12 𝑥𝑥 𝑥 = 𝑦
1817nfn 1781 . . . . . . . . . . 11 𝑥 ¬ ∀𝑥 𝑥 = 𝑦
191819.9 2070 . . . . . . . . . 10 (∃𝑥 ¬ ∀𝑥 𝑥 = 𝑦 ↔ ¬ ∀𝑥 𝑥 = 𝑦)
20 id 22 . . . . . . . . . . . . . . . 16 (𝑢𝑣𝑢𝑣)
21 simpr 477 . . . . . . . . . . . . . . . . 17 ((𝑢𝑣 ∧ (𝑥 = 𝑢𝑦 = 𝑣)) → (𝑥 = 𝑢𝑦 = 𝑣))
22 simpl 473 . . . . . . . . . . . . . . . . 17 ((𝑥 = 𝑢𝑦 = 𝑣) → 𝑥 = 𝑢)
2321, 22syl 17 . . . . . . . . . . . . . . . 16 ((𝑢𝑣 ∧ (𝑥 = 𝑢𝑦 = 𝑣)) → 𝑥 = 𝑢)
24 pm13.181 2872 . . . . . . . . . . . . . . . . 17 ((𝑥 = 𝑢𝑢𝑣) → 𝑥𝑣)
2524ancoms 469 . . . . . . . . . . . . . . . 16 ((𝑢𝑣𝑥 = 𝑢) → 𝑥𝑣)
2620, 23, 25syl2an2r 875 . . . . . . . . . . . . . . 15 ((𝑢𝑣 ∧ (𝑥 = 𝑢𝑦 = 𝑣)) → 𝑥𝑣)
27 simpr 477 . . . . . . . . . . . . . . . 16 ((𝑥 = 𝑢𝑦 = 𝑣) → 𝑦 = 𝑣)
2821, 27syl 17 . . . . . . . . . . . . . . 15 ((𝑢𝑣 ∧ (𝑥 = 𝑢𝑦 = 𝑣)) → 𝑦 = 𝑣)
29 neeq2 2853 . . . . . . . . . . . . . . . 16 (𝑦 = 𝑣 → (𝑥𝑦𝑥𝑣))
3029biimparc 504 . . . . . . . . . . . . . . 15 ((𝑥𝑣𝑦 = 𝑣) → 𝑥𝑦)
3126, 28, 30syl2anc 692 . . . . . . . . . . . . . 14 ((𝑢𝑣 ∧ (𝑥 = 𝑢𝑦 = 𝑣)) → 𝑥𝑦)
32 df-ne 2791 . . . . . . . . . . . . . . . 16 (𝑥𝑦 ↔ ¬ 𝑥 = 𝑦)
3332bicomi 214 . . . . . . . . . . . . . . 15 𝑥 = 𝑦𝑥𝑦)
34 sp 2051 . . . . . . . . . . . . . . . 16 (∀𝑥 𝑥 = 𝑦𝑥 = 𝑦)
3534con3i 150 . . . . . . . . . . . . . . 15 𝑥 = 𝑦 → ¬ ∀𝑥 𝑥 = 𝑦)
3633, 35sylbir 225 . . . . . . . . . . . . . 14 (𝑥𝑦 → ¬ ∀𝑥 𝑥 = 𝑦)
3731, 36syl 17 . . . . . . . . . . . . 13 ((𝑢𝑣 ∧ (𝑥 = 𝑢𝑦 = 𝑣)) → ¬ ∀𝑥 𝑥 = 𝑦)
3837ex 450 . . . . . . . . . . . 12 (𝑢𝑣 → ((𝑥 = 𝑢𝑦 = 𝑣) → ¬ ∀𝑥 𝑥 = 𝑦))
3938alrimiv 1852 . . . . . . . . . . 11 (𝑢𝑣 → ∀𝑥((𝑥 = 𝑢𝑦 = 𝑣) → ¬ ∀𝑥 𝑥 = 𝑦))
40 exim 1758 . . . . . . . . . . 11 (∀𝑥((𝑥 = 𝑢𝑦 = 𝑣) → ¬ ∀𝑥 𝑥 = 𝑦) → (∃𝑥(𝑥 = 𝑢𝑦 = 𝑣) → ∃𝑥 ¬ ∀𝑥 𝑥 = 𝑦))
4139, 40syl 17 . . . . . . . . . 10 (𝑢𝑣 → (∃𝑥(𝑥 = 𝑢𝑦 = 𝑣) → ∃𝑥 ¬ ∀𝑥 𝑥 = 𝑦))
42 imbi2 338 . . . . . . . . . . 11 ((∃𝑥 ¬ ∀𝑥 𝑥 = 𝑦 ↔ ¬ ∀𝑥 𝑥 = 𝑦) → ((∃𝑥(𝑥 = 𝑢𝑦 = 𝑣) → ∃𝑥 ¬ ∀𝑥 𝑥 = 𝑦) ↔ (∃𝑥(𝑥 = 𝑢𝑦 = 𝑣) → ¬ ∀𝑥 𝑥 = 𝑦)))
4342biimpa 501 . . . . . . . . . 10 (((∃𝑥 ¬ ∀𝑥 𝑥 = 𝑦 ↔ ¬ ∀𝑥 𝑥 = 𝑦) ∧ (∃𝑥(𝑥 = 𝑢𝑦 = 𝑣) → ∃𝑥 ¬ ∀𝑥 𝑥 = 𝑦)) → (∃𝑥(𝑥 = 𝑢𝑦 = 𝑣) → ¬ ∀𝑥 𝑥 = 𝑦))
4419, 41, 43sylancr 694 . . . . . . . . 9 (𝑢𝑣 → (∃𝑥(𝑥 = 𝑢𝑦 = 𝑣) → ¬ ∀𝑥 𝑥 = 𝑦))
4544alrimiv 1852 . . . . . . . 8 (𝑢𝑣 → ∀𝑦(∃𝑥(𝑥 = 𝑢𝑦 = 𝑣) → ¬ ∀𝑥 𝑥 = 𝑦))
46 exim 1758 . . . . . . . 8 (∀𝑦(∃𝑥(𝑥 = 𝑢𝑦 = 𝑣) → ¬ ∀𝑥 𝑥 = 𝑦) → (∃𝑦𝑥(𝑥 = 𝑢𝑦 = 𝑣) → ∃𝑦 ¬ ∀𝑥 𝑥 = 𝑦))
4745, 46syl 17 . . . . . . 7 (𝑢𝑣 → (∃𝑦𝑥(𝑥 = 𝑢𝑦 = 𝑣) → ∃𝑦 ¬ ∀𝑥 𝑥 = 𝑦))
48 imbi1 337 . . . . . . . 8 ((∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) ↔ ∃𝑦𝑥(𝑥 = 𝑢𝑦 = 𝑣)) → ((∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → ∃𝑦 ¬ ∀𝑥 𝑥 = 𝑦) ↔ (∃𝑦𝑥(𝑥 = 𝑢𝑦 = 𝑣) → ∃𝑦 ¬ ∀𝑥 𝑥 = 𝑦)))
4948biimpar 502 . . . . . . 7 (((∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) ↔ ∃𝑦𝑥(𝑥 = 𝑢𝑦 = 𝑣)) ∧ (∃𝑦𝑥(𝑥 = 𝑢𝑦 = 𝑣) → ∃𝑦 ¬ ∀𝑥 𝑥 = 𝑦)) → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → ∃𝑦 ¬ ∀𝑥 𝑥 = 𝑦))
5016, 47, 49sylancr 694 . . . . . 6 (𝑢𝑣 → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → ∃𝑦 ¬ ∀𝑥 𝑥 = 𝑦))
51 pm3.34 609 . . . . . 6 (((∃𝑦 ¬ ∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑥 𝑥 = 𝑦) ∧ (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → ∃𝑦 ¬ ∀𝑥 𝑥 = 𝑦)) → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → ¬ ∀𝑥 𝑥 = 𝑦))
5215, 50, 51sylancr 694 . . . . 5 (𝑢𝑣 → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → ¬ ∀𝑥 𝑥 = 𝑦))
53 orc 400 . . . . . 6 (¬ ∀𝑥 𝑥 = 𝑦 → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣))
5453imim2i 16 . . . . 5 ((∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → ¬ ∀𝑥 𝑥 = 𝑦) → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣)))
5552, 54syl 17 . . . 4 (𝑢𝑣 → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣)))
5655idiALT 38200 . . 3 (𝑢𝑣 → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣)))
57 id 22 . . . . . 6 (𝑢 = 𝑣𝑢 = 𝑣)
58 ax-1 6 . . . . . 6 (𝑢 = 𝑣 → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → 𝑢 = 𝑣))
5957, 58syl 17 . . . . 5 (𝑢 = 𝑣 → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → 𝑢 = 𝑣))
60 olc 399 . . . . . 6 (𝑢 = 𝑣 → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣))
6160imim2i 16 . . . . 5 ((∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → 𝑢 = 𝑣) → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣)))
6259, 61syl 17 . . . 4 (𝑢 = 𝑣 → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣)))
6362idiALT 38200 . . 3 (𝑢 = 𝑣 → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣)))
64 exmidne 2800 . . 3 (𝑢 = 𝑣𝑢𝑣)
65 jao 534 . . . 4 ((𝑢 = 𝑣 → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣))) → ((𝑢𝑣 → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣))) → ((𝑢 = 𝑣𝑢𝑣) → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣)))))
66653imp21 1274 . . 3 (((𝑢𝑣 → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣))) ∧ (𝑢 = 𝑣 → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣))) ∧ (𝑢 = 𝑣𝑢𝑣)) → (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣)))
6756, 63, 64, 66mp3an 1421 . 2 (∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣) → (¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣))
688, 67impbii 199 1 ((¬ ∀𝑥 𝑥 = 𝑦𝑢 = 𝑣) ↔ ∃𝑥𝑦(𝑥 = 𝑢𝑦 = 𝑣))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wo 383  wa 384  wal 1478   = wceq 1480  wex 1701  wne 2790
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-clab 2608  df-cleq 2614  df-clel 2617  df-ne 2791  df-v 3191
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator