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

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

Proof of Theorem sltval
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2816 . . . . 5 (𝑓 = 𝐴 → (𝑓 No 𝐴 No ))
21anbi1d 631 . . . 4 (𝑓 = 𝐴 → ((𝑓 No 𝑔 No ) ↔ (𝐴 No 𝑔 No )))
3 fveq1 6857 . . . . . . . 8 (𝑓 = 𝐴 → (𝑓𝑦) = (𝐴𝑦))
43eqeq1d 2731 . . . . . . 7 (𝑓 = 𝐴 → ((𝑓𝑦) = (𝑔𝑦) ↔ (𝐴𝑦) = (𝑔𝑦)))
54ralbidv 3156 . . . . . 6 (𝑓 = 𝐴 → (∀𝑦𝑥 (𝑓𝑦) = (𝑔𝑦) ↔ ∀𝑦𝑥 (𝐴𝑦) = (𝑔𝑦)))
6 fveq1 6857 . . . . . . 7 (𝑓 = 𝐴 → (𝑓𝑥) = (𝐴𝑥))
76breq1d 5117 . . . . . 6 (𝑓 = 𝐴 → ((𝑓𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔𝑥) ↔ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔𝑥)))
85, 7anbi12d 632 . . . . 5 (𝑓 = 𝐴 → ((∀𝑦𝑥 (𝑓𝑦) = (𝑔𝑦) ∧ (𝑓𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔𝑥)) ↔ (∀𝑦𝑥 (𝐴𝑦) = (𝑔𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔𝑥))))
98rexbidv 3157 . . . 4 (𝑓 = 𝐴 → (∃𝑥 ∈ On (∀𝑦𝑥 (𝑓𝑦) = (𝑔𝑦) ∧ (𝑓𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔𝑥)) ↔ ∃𝑥 ∈ On (∀𝑦𝑥 (𝐴𝑦) = (𝑔𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔𝑥))))
102, 9anbi12d 632 . . 3 (𝑓 = 𝐴 → (((𝑓 No 𝑔 No ) ∧ ∃𝑥 ∈ On (∀𝑦𝑥 (𝑓𝑦) = (𝑔𝑦) ∧ (𝑓𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔𝑥))) ↔ ((𝐴 No 𝑔 No ) ∧ ∃𝑥 ∈ On (∀𝑦𝑥 (𝐴𝑦) = (𝑔𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔𝑥)))))
11 eleq1 2816 . . . . 5 (𝑔 = 𝐵 → (𝑔 No 𝐵 No ))
1211anbi2d 630 . . . 4 (𝑔 = 𝐵 → ((𝐴 No 𝑔 No ) ↔ (𝐴 No 𝐵 No )))
13 fveq1 6857 . . . . . . . 8 (𝑔 = 𝐵 → (𝑔𝑦) = (𝐵𝑦))
1413eqeq2d 2740 . . . . . . 7 (𝑔 = 𝐵 → ((𝐴𝑦) = (𝑔𝑦) ↔ (𝐴𝑦) = (𝐵𝑦)))
1514ralbidv 3156 . . . . . 6 (𝑔 = 𝐵 → (∀𝑦𝑥 (𝐴𝑦) = (𝑔𝑦) ↔ ∀𝑦𝑥 (𝐴𝑦) = (𝐵𝑦)))
16 fveq1 6857 . . . . . . 7 (𝑔 = 𝐵 → (𝑔𝑥) = (𝐵𝑥))
1716breq2d 5119 . . . . . 6 (𝑔 = 𝐵 → ((𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔𝑥) ↔ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑥)))
1815, 17anbi12d 632 . . . . 5 (𝑔 = 𝐵 → ((∀𝑦𝑥 (𝐴𝑦) = (𝑔𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔𝑥)) ↔ (∀𝑦𝑥 (𝐴𝑦) = (𝐵𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑥))))
1918rexbidv 3157 . . . 4 (𝑔 = 𝐵 → (∃𝑥 ∈ On (∀𝑦𝑥 (𝐴𝑦) = (𝑔𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔𝑥)) ↔ ∃𝑥 ∈ On (∀𝑦𝑥 (𝐴𝑦) = (𝐵𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑥))))
2012, 19anbi12d 632 . . 3 (𝑔 = 𝐵 → (((𝐴 No 𝑔 No ) ∧ ∃𝑥 ∈ On (∀𝑦𝑥 (𝐴𝑦) = (𝑔𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔𝑥))) ↔ ((𝐴 No 𝐵 No ) ∧ ∃𝑥 ∈ On (∀𝑦𝑥 (𝐴𝑦) = (𝐵𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑥)))))
21 df-slt 27555 . . 3 <s = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 No 𝑔 No ) ∧ ∃𝑥 ∈ On (∀𝑦𝑥 (𝑓𝑦) = (𝑔𝑦) ∧ (𝑓𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝑔𝑥)))}
2210, 20, 21brabg 5499 . 2 ((𝐴 No 𝐵 No ) → (𝐴 <s 𝐵 ↔ ((𝐴 No 𝐵 No ) ∧ ∃𝑥 ∈ On (∀𝑦𝑥 (𝐴𝑦) = (𝐵𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑥)))))
2322bianabs 541 1 ((𝐴 No 𝐵 No ) → (𝐴 <s 𝐵 ↔ ∃𝑥 ∈ On (∀𝑦𝑥 (𝐴𝑦) = (𝐵𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wral 3044  wrex 3053  c0 4296  {ctp 4593  cop 4595   class class class wbr 5107  Oncon0 6332  cfv 6511  1oc1o 8427  2oc2o 8428   No csur 27551   <s cslt 27552
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-iota 6464  df-fv 6519  df-slt 27555
This theorem is referenced by:  sltval2  27568  sltres  27574  nolesgn2o  27583  nogesgn1o  27585  nodense  27604  nolt02o  27607  nogt01o  27608  nosupbnd2lem1  27627  noinfbnd2lem1  27642
  Copyright terms: Public domain W3C validator