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

Theorem ltsval 28034
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 2852 . . . . 5 (𝑓 = 𝐴 → (𝑓 ∈ No ↔ 𝐴 ∈ No))
21anbi1d 643 . . . 4 (𝑓 = 𝐴 → ((𝑓 ∈ No ∧ 𝑔 ∈ No) ↔ (𝐴 ∈ No ∧ 𝑔 ∈ No)))
3 fveq1 6907 . . . . . . . 8 (𝑓 = 𝐴 → (𝑓‘𝑦) = (𝐴‘𝑦))
43eqeq1d 2765 . . . . . . 7 (𝑓 = 𝐴 → ((𝑓‘𝑦) = (𝑔‘𝑦) ↔ (𝐴‘𝑦) = (𝑔‘𝑦)))
54ralbidv 3189 . . . . . 6 (𝑓 = 𝐴 → (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑔‘𝑦) ↔ ∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦)))
6 fveq1 6907 . . . . . . 7 (𝑓 = 𝐴 → (𝑓‘𝑥) = (𝐴‘𝑥))
76breq1d 5116 . . . . . 6 (𝑓 = 𝐴 → ((𝑓‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥) ↔ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥)))
85, 7anbi12d 644 . . . . 5 (𝑓 = 𝐴 → ((∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑔‘𝑦) ∧ (𝑓‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥)) ↔ (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥))))
98rexbidv 3190 . . . 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 2852 . . . . 5 (𝑔 = 𝐵 → (𝑔 ∈ No ↔ 𝐵 ∈ No))
1211anbi2d 642 . . . 4 (𝑔 = 𝐵 → ((𝐴 ∈ No ∧ 𝑔 ∈ No) ↔ (𝐴 ∈ No ∧ 𝐵 ∈ No)))
13 fveq1 6907 . . . . . . . 8 (𝑔 = 𝐵 → (𝑔‘𝑦) = (𝐵‘𝑦))
1413eqeq2d 2774 . . . . . . 7 (𝑔 = 𝐵 → ((𝐴‘𝑦) = (𝑔‘𝑦) ↔ (𝐴‘𝑦) = (𝐵‘𝑦)))
1514ralbidv 3189 . . . . . 6 (𝑔 = 𝐵 → (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ↔ ∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦)))
16 fveq1 6907 . . . . . . 7 (𝑔 = 𝐵 → (𝑔‘𝑥) = (𝐵‘𝑥))
1716breq2d 5118 . . . . . 6 (𝑔 = 𝐵 → ((𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥) ↔ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥)))
1815, 17anbi12d 644 . . . . 5 (𝑔 = 𝐵 → ((∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝑔‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥)) ↔ (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥))))
1918rexbidv 3190 . . . 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 28031 . . 3 <s = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ No ∧ 𝑔 ∈ No) ∧ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑔‘𝑦) ∧ (𝑓‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔‘𝑥)))}
2210, 20, 21brabg 5518 . 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 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  ∅c0 4281  {ctp 4592  ⟨cop 4838   class class class wbr 5106  Oncon0 6380  ‘cfv 6558  1oc1o 8497  2oc2o 8498  Nocsur 28027   <s clts 28028
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-iota 6512  df-fv 6566  df-lts 28031
This theorem is used by:  ltsval2  28043  ltsres  28049  nolesgn2o  28058  nogesgn1o  28060  nodense  28079  nolt02o  28082  nogt01o  28083  nosupbnd2lem1  28102  noinfbnd2lem1  28117
  Copyright terms: Public domain W3C validator