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

Theorem nocvxmin 27848
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 27846 . . . 4 ((𝐴 No 𝐴 ≠ ∅) → ∃𝑤𝐴 ( bday 𝑤) = ( bday 𝐴))
21ancoms 462 . . 3 ((𝐴 ≠ ∅ ∧ 𝐴 No ) → ∃𝑤𝐴 ( bday 𝑤) = ( bday 𝐴))
323adant3 1145 . 2 ((𝐴 ≠ ∅ ∧ 𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → ∃𝑤𝐴 ( bday 𝑤) = ( bday 𝐴))
4 ssel 3930 . . . . . . . . 9 (𝐴 No → (𝑤𝐴𝑤 No ))
5 ssel 3930 . . . . . . . . 9 (𝐴 No → (𝑡𝐴𝑡 No ))
64, 5anim12d 618 . . . . . . . 8 (𝐴 No → ((𝑤𝐴𝑡𝐴) → (𝑤 No 𝑡 No )))
76imp 410 . . . . . . 7 ((𝐴 No ∧ (𝑤𝐴𝑡𝐴)) → (𝑤 No 𝑡 No ))
87ad2ant2r 757 . . . . . 6 (((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) ∧ ((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)))) → (𝑤 No 𝑡 No ))
9 nocvxminlem 27847 . . . . . . 7 ((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → (((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴))) → ¬ 𝑤 <s 𝑡))
109imp 410 . . . . . 6 (((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) ∧ ((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)))) → ¬ 𝑤 <s 𝑡)
11 an2anr 645 . . . . . . . 8 (((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴))) ↔ ((𝑡𝐴𝑤𝐴) ∧ (( bday 𝑡) = ( bday 𝐴) ∧ ( bday 𝑤) = ( bday 𝐴))))
12 nocvxminlem 27847 . . . . . . . 8 ((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → (((𝑡𝐴𝑤𝐴) ∧ (( bday 𝑡) = ( bday 𝐴) ∧ ( bday 𝑤) = ( bday 𝐴))) → ¬ 𝑡 <s 𝑤))
1311, 12biimtrid 244 . . . . . . 7 ((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → (((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴))) → ¬ 𝑡 <s 𝑤))
1413imp 410 . . . . . 6 (((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) ∧ ((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)))) → ¬ 𝑡 <s 𝑤)
15 ltstrieq2 27814 . . . . . . 7 ((𝑤 No 𝑡 No ) → (𝑤 = 𝑡 ↔ (¬ 𝑤 <s 𝑡 ∧ ¬ 𝑡 <s 𝑤)))
1615biimpar 481 . . . . . 6 (((𝑤 No 𝑡 No ) ∧ (¬ 𝑤 <s 𝑡 ∧ ¬ 𝑡 <s 𝑤)) → 𝑤 = 𝑡)
178, 10, 14, 16syl12anc 847 . . . . 5 (((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) ∧ ((𝑤𝐴𝑡𝐴) ∧ (( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)))) → 𝑤 = 𝑡)
1817exp32 424 . . . 4 ((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → ((𝑤𝐴𝑡𝐴) → ((( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)) → 𝑤 = 𝑡)))
1918ralrimivv 3203 . . 3 ((𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → ∀𝑤𝐴𝑡𝐴 ((( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)) → 𝑤 = 𝑡))
20193adant1 1143 . 2 ((𝐴 ≠ ∅ ∧ 𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → ∀𝑤𝐴𝑡𝐴 ((( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)) → 𝑤 = 𝑡))
21 fveqeq2 6876 . . 3 (𝑤 = 𝑡 → (( bday 𝑤) = ( bday 𝐴) ↔ ( bday 𝑡) = ( bday 𝐴)))
2221reu4 3694 . 2 (∃!𝑤𝐴 ( bday 𝑤) = ( bday 𝐴) ↔ (∃𝑤𝐴 ( bday 𝑤) = ( bday 𝐴) ∧ ∀𝑤𝐴𝑡𝐴 ((( bday 𝑤) = ( bday 𝐴) ∧ ( bday 𝑡) = ( bday 𝐴)) → 𝑤 = 𝑡)))
233, 20, 22sylanbrc 592 1 ((𝐴 ≠ ∅ ∧ 𝐴 No ∧ ∀𝑥𝐴𝑦𝐴𝑧 No ((𝑥 <s 𝑧𝑧 <s 𝑦) → 𝑧𝐴)) → ∃!𝑤𝐴 ( bday 𝑤) = ( bday 𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399  w3a 1098   = wceq 1560  wcel 2142  wne 2957  wral 3076  wrex 3086  ∃!wreu 3365  wss 3904  c0 4285   cint 4905   class class class wbr 5100  cima 5650  cfv 6521   No csur 27704   <s clts 27705   bday cbday 27706
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-int 4906  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-ord 6349  df-on 6350  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-fo 6527  df-fv 6529  df-1o 8437  df-2o 8438  df-no 27707  df-lts 27708  df-bday 27709
This theorem is referenced by:  conway  27872
  Copyright terms: Public domain W3C validator