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

Theorem brslts 28178
Description: Binary relation form of the surreal set less-than relation. (Contributed by Scott Fenton, 8-Dec-2021.)
Assertion
Ref Expression
brslts (𝐴 <<s 𝐵 ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ (𝐴 ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦

Proof of Theorem brslts
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-slts 28174 . . 3 <<s = {⟨𝑎, 𝑏⟩ ∣ (𝑎 ⊆ No ∧ 𝑏 ⊆ No ∧ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 𝑥 <s 𝑦)}
21bropaex12 5747 . 2 (𝐴 <<s 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
3 sseq1 3938 . . . 4 (𝑎 = 𝐴 → (𝑎 ⊆ No ↔ 𝐴 ⊆ No))
4 raleq 3320 . . . 4 (𝑎 = 𝐴 → (∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 𝑥 <s 𝑦 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑏 𝑥 <s 𝑦))
53, 43anbi13d 1467 . . 3 (𝑎 = 𝐴 → ((𝑎 ⊆ No ∧ 𝑏 ⊆ No ∧ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 𝑥 <s 𝑦) ↔ (𝐴 ⊆ No ∧ 𝑏 ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑏 𝑥 <s 𝑦)))
6 sseq1 3938 . . . 4 (𝑏 = 𝐵 → (𝑏 ⊆ No ↔ 𝐵 ⊆ No))
7 raleq 3320 . . . . 5 (𝑏 = 𝐵 → (∀𝑦 ∈ 𝑏 𝑥 <s 𝑦 ↔ ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦))
87ralbidv 3189 . . . 4 (𝑏 = 𝐵 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑏 𝑥 <s 𝑦 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦))
96, 83anbi23d 1468 . . 3 (𝑏 = 𝐵 → ((𝐴 ⊆ No ∧ 𝑏 ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑏 𝑥 <s 𝑦) ↔ (𝐴 ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)))
105, 9, 1brabg 5518 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 <<s 𝐵 ↔ (𝐴 ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)))
112, 10biadanii 834 1 (𝐴 <<s 𝐵 ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ (𝐴 ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   class class class wbr 5106  Nocsur 28027   <s clts 28028   <<s cslts 28173
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-br 5107  df-opab 5171  df-xp 5661  df-slts 28174
This theorem is used by:  sltsex1  28179  sltsex2  28180  sltsss1  28181  sltsss2  28182  sltssep  28183  sltsd  28184  sltssnb  28185  ssslts1  28189  ssslts2  28190  conway  28195  etaslts  28209  lesrec  28215  cofcutr  28340
  Copyright terms: Public domain W3C validator