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

Theorem ltsval 28009
Description: The value of the surreal less-than relation. (Contributed by Scott Fenton, 14-Jun-2011.)
Assertion
Ref Expression
ltsval ((𝐴 ∈ No ∧ 𝐵 ∈ No) → (𝐴 <s 𝐵 ↔ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥))))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦

Proof of Theorem ltsval
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2848 . . . . 5 (𝑓 = 𝐴 → (𝑓 ∈ No ↔ 𝐴 ∈ No))
21anbi1d 643 . . . 4 (𝑓 = 𝐴 → ((𝑓 ∈ No ∧ 𝑔 ∈ No) ↔ (𝐴 ∈ No ∧ 𝑔 ∈ No)))
3 fveq1 6884 . . . . . . . 8 (𝑓 = 𝐴 → (𝑓‘𝑦) = (𝐴‘𝑦))
43eqeq1d 2762 . . . . . . 7 (𝑓 = 𝐴 → ((𝑓‘𝑦) = (𝑔‘𝑦) ↔ (𝐴‘𝑦) = (𝑔‘𝑦)))
54ralbidv 3185 . . . . . 6 (𝑓 = 𝐴 → (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑔‘𝑦) ↔ ∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦)))
6 fveq1 6884 . . . . . . 7 (𝑓 = 𝐴 → (𝑓‘𝑥) = (𝐴‘𝑥))
76breq1d 5112 . . . . . 6 (𝑓 = 𝐴 → ((𝑓‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥) ↔ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥)))
85, 7anbi12d 644 . . . . 5 (𝑓 = 𝐴 → ((∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑔‘𝑦) ∧ (𝑓‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥)) ↔ (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥))))
98rexbidv 3186 . . . 4 (𝑓 = 𝐴 → (∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑔‘𝑦) ∧ (𝑓‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥)) ↔ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥))))
102, 9anbi12d 644 . . 3 (𝑓 = 𝐴 → (((𝑓 ∈ No ∧ 𝑔 ∈ No) ∧ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑔‘𝑦) ∧ (𝑓‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥))) ↔ ((𝐴 ∈ No ∧ 𝑔 ∈ No) ∧ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥)))))
11 eleq1 2848 . . . . 5 (𝑔 = 𝐵 → (𝑔 ∈ No ↔ 𝐵 ∈ No))
1211anbi2d 642 . . . 4 (𝑔 = 𝐵 → ((𝐴 ∈ No ∧ 𝑔 ∈ No) ↔ (𝐴 ∈ No ∧ 𝐵 ∈ No)))
13 fveq1 6884 . . . . . . . 8 (𝑔 = 𝐵 → (𝑔‘𝑦) = (𝐵‘𝑦))
1413eqeq2d 2771 . . . . . . 7 (𝑔 = 𝐵 → ((𝐴‘𝑦) = (𝑔‘𝑦) ↔ (𝐴‘𝑦) = (𝐵‘𝑦)))
1514ralbidv 3185 . . . . . 6 (𝑔 = 𝐵 → (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ↔ ∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦)))
16 fveq1 6884 . . . . . . 7 (𝑔 = 𝐵 → (𝑔‘𝑥) = (𝐵‘𝑥))
1716breq2d 5114 . . . . . 6 (𝑔 = 𝐵 → ((𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥) ↔ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥)))
1815, 17anbi12d 644 . . . . 5 (𝑔 = 𝐵 → ((∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥)) ↔ (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥))))
1918rexbidv 3186 . . . 4 (𝑔 = 𝐵 → (∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥)) ↔ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥))))
2012, 19anbi12d 644 . . 3 (𝑔 = 𝐵 → (((𝐴 ∈ No ∧ 𝑔 ∈ No) ∧ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥))) ↔ ((𝐴 ∈ No ∧ 𝐵 ∈ No) ∧ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥)))))
21 df-lts 28006 . . 3 <s = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ No ∧ 𝑔 ∈ No) ∧ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑔‘𝑦) ∧ (𝑓‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥)))}
2210, 20, 21brabg 5513 . 2 ((𝐴 ∈ No ∧ 𝐵 ∈ No) → (𝐴 <s 𝐵 ↔ ((𝐴 ∈ No ∧ 𝐵 ∈ No) ∧ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥)))))
2322bianabs 551 1 ((𝐴 ∈ No ∧ 𝐵 ∈ No) → (𝐴 <s 𝐵 ↔ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  ∅c0 4278  {ctp 4588  ⟨cop 4834   class class class wbr 5102  Oncon0 6362  ‘cfv 6538  1oc1o 8472  2oc2o 8473  Nocsur 28002   <s clts 28003
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-iota 6494  df-fv 6546  df-lts 28006
This theorem is used by:  ltsval2  28018  ltsres  28024  nolesgn2o  28033  nogesgn1o  28035  nodense  28054  nolt02o  28057  nogt01o  28058  nosupbnd2lem1  28077  noinfbnd2lem1  28092
  Copyright terms: Public domain W3C validator