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

Theorem nocvxmin 27913
Description: Given a nonempty convex class of surreals, there is a unique birthday-minimal element of that class. Lemma 0 of [Alling] p. 185. (Contributed by Scott Fenton, 30-Jun-2011.)
Assertion
Ref Expression
nocvxmin ((𝐴 ≠ ∅ ∧ 𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → ∃!𝑤𝐴 ( bday 𝑤) = ( bday 𝐴))
Distinct variable group:   𝑤,𝐴,𝑥,𝑦,𝑧

Proof of Theorem nocvxmin
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 nobdaymin 27911 . . . 4 ((𝐴 No 𝐴 ≠ ∅) → ∃𝑤𝐴 ( bday 𝑤) = ( bday 𝐴))
21ancoms 463 . . 3 ((𝐴 ≠ ∅ ∧ 𝐴 No ) → ∃𝑤𝐴 ( bday 𝑤) = ( bday 𝐴))
323adant3 1148 . 2 ((𝐴 ≠ ∅ ∧ 𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → ∃𝑤𝐴 ( bday 𝑤) = ( bday 𝐴))
4 ssel 3939 . . . . . . . . 9 (𝐴 No → (𝑤𝐴𝑤 No ))
5 ssel 3939 . . . . . . . . 9 (𝐴 No → (𝑡𝐴𝑡 No ))
64, 5anim12d 620 . . . . . . . 8 (𝐴 No → ((𝑤𝐴𝑡𝐴) → (𝑤 No 𝑡 No )))
76imp 411 . . . . . . 7 ((𝐴 No ∧ (𝑤𝐴𝑡𝐴)) → (𝑤 No 𝑡 No ))
87ad2ant2r 759 . . . . . 6 (((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) ∧ ((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)))) → (𝑤 No 𝑡 No ))
9 nocvxminlem 27912 . . . . . . 7 ((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → (((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴))) → ¬ 𝑤 <s 𝑡))
109imp 411 . . . . . 6 (((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) ∧ ((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)))) → ¬ 𝑤 <s 𝑡)
11 an2anr 647 . . . . . . . 8 (((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴))) ↔ ((𝑡𝐴𝑤𝐴) ∧ (( bday 𝑡) = ( bday 𝐴) ∧ ( bday 𝑤) = ( bday 𝐴))))
12 nocvxminlem 27912 . . . . . . . 8 ((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → (((𝑡𝐴𝑤𝐴) ∧ (( bday 𝑡) = ( bday 𝐴) ∧ ( bday 𝑤) = ( bday 𝐴))) → ¬ 𝑡 <s 𝑤))
1311, 12biimtrid 245 . . . . . . 7 ((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → (((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴))) → ¬ 𝑡 <s 𝑤))
1413imp 411 . . . . . 6 (((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) ∧ ((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)))) → ¬ 𝑡 <s 𝑤)
15 ltstrieq2 27879 . . . . . . 7 ((𝑤 No 𝑡 No ) → (𝑤 = 𝑡 ↔ (¬ 𝑤 <s 𝑡 ∧ ¬ 𝑡 <s 𝑤)))
1615biimpar 482 . . . . . 6 (((𝑤 No 𝑡 No ) ∧ (¬ 𝑤 <s 𝑡 ∧ ¬ 𝑡 <s 𝑤)) → 𝑤 = 𝑡)
178, 10, 14, 16syl12anc 849 . . . . 5 (((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) ∧ ((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)))) → 𝑤 = 𝑡)
1817exp32 425 . . . 4 ((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → ((𝑤𝐴𝑡𝐴) → ((( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)) → 𝑤 = 𝑡)))
1918ralrimivv 3212 . . 3 ((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → ∀𝑤𝐴𝑡𝐴 ((( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)) → 𝑤 = 𝑡))
20193adant1 1146 . 2 ((𝐴 ≠ ∅ ∧ 𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → ∀𝑤𝐴𝑡𝐴 ((( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)) → 𝑤 = 𝑡))
21 fveqeq2 6891 . . 3 (𝑤 = 𝑡 → (( bday 𝑤) = ( bday 𝐴) ↔ ( bday 𝑡) = ( bday 𝐴)))
2221reu4 3703 . 2 (∃!𝑤𝐴 ( bday 𝑤) = ( bday 𝐴) ↔ (∃𝑤𝐴 ( bday 𝑤) = ( bday 𝐴) ∧ ∀𝑤𝐴𝑡𝐴 ((( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)) → 𝑤 = 𝑡)))
233, 20, 22sylanbrc 594 1 ((𝐴 ≠ ∅ ∧ 𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → ∃!𝑤𝐴 ( bday 𝑤) = ( bday 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  w3a 1101   = wceq 1567  wcel 2149  wne 2964  wral 3085  wrex 3095  ∃!wreu 3374  wss 3913  c0 4294   cint 4916   class class class wbr 5113  cima 5665  cfv 6537   No csur 27769   <s clts 27770   bday cbday 27771
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-uni 4877  df-int 4917  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-1o 8452  df-2o 8453  df-no 27772  df-lts 27773  df-bday 27774
This theorem is referenced by:  conway  27937
  Copyright terms: Public domain W3C validator