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

Theorem nosep1o 27533
Description: If the value of a surreal at a separator is 1o then the surreal is lesser. (Contributed by Scott Fenton, 7-Dec-2021.)
Assertion
Ref Expression
nosep1o (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → 𝐴 <s 𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem nosep1o
StepHypRef Expression
1 simpr 484 . . 3 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o)
2 nosepne 27532 . . . . . . . . . . . 12 ((𝐴 No 𝐵 No 𝐴𝐵) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
32adantr 480 . . . . . . . . . . 11 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
41, 3eqnetrrd 3001 . . . . . . . . . 10 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → 1o ≠ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
54necomd 2988 . . . . . . . . 9 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ≠ 1o)
65neneqd 2937 . . . . . . . 8 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → ¬ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o)
7 simpl2 1189 . . . . . . . . 9 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → 𝐵 No )
8 nofv 27509 . . . . . . . . 9 (𝐵 No → ((𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∨ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∨ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o))
97, 8syl 17 . . . . . . . 8 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → ((𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∨ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∨ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o))
10 3orel2 1480 . . . . . . . 8 (¬ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o → (((𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∨ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o ∨ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) → ((𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∨ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
116, 9, 10sylc 65 . . . . . . 7 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → ((𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∨ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o))
12 eqid 2724 . . . . . . 7 1o = 1o
1311, 12jctil 519 . . . . . 6 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → (1o = 1o ∧ ((𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∨ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
14 andi 1004 . . . . . 6 ((1o = 1o ∧ ((𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅ ∨ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) ↔ ((1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ (1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
1513, 14sylib 217 . . . . 5 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → ((1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ (1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
16 3mix1 1327 . . . . . 6 ((1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) → ((1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ (1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) ∨ (1o = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
17 3mix2 1328 . . . . . 6 ((1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) → ((1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ (1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) ∨ (1o = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
1816, 17jaoi 854 . . . . 5 (((1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ (1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)) → ((1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ (1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) ∨ (1o = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
1915, 18syl 17 . . . 4 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → ((1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ (1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) ∨ (1o = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
20 1oex 8472 . . . . 5 1o ∈ V
21 fvex 6895 . . . . 5 (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ∈ V
2220, 21brtp 5514 . . . 4 (1o{⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) ↔ ((1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = ∅) ∨ (1o = 1o ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o) ∨ (1o = ∅ ∧ (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 2o)))
2319, 22sylibr 233 . . 3 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → 1o{⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
241, 23eqbrtrd 5161 . 2 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}))
25 simpl1 1188 . . 3 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → 𝐴 No )
26 sltval2 27508 . . 3 ((𝐴 No 𝐵 No ) → (𝐴 <s 𝐵 ↔ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
2725, 7, 26syl2anc 583 . 2 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → (𝐴 <s 𝐵 ↔ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)})))
2824, 27mpbird 257 1 (((𝐴 No 𝐵 No 𝐴𝐵) ∧ (𝐴 {𝑥 ∈ On ∣ (𝐴𝑥) ≠ (𝐵𝑥)}) = 1o) → 𝐴 <s 𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395  wo 844  w3o 1083  w3a 1084   = wceq 1533  wcel 2098  wne 2932  {crab 3424  c0 4315  {ctp 4625  cop 4627   cint 4941   class class class wbr 5139  Oncon0 6355  cfv 6534  1oc1o 8455  2oc2o 8456   No csur 27492   <s cslt 27493
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2695  ax-rep 5276  ax-sep 5290  ax-nul 5297  ax-pr 5418
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2526  df-eu 2555  df-clab 2702  df-cleq 2716  df-clel 2802  df-nfc 2877  df-ne 2933  df-ral 3054  df-rex 3063  df-reu 3369  df-rab 3425  df-v 3468  df-sbc 3771  df-csb 3887  df-dif 3944  df-un 3946  df-in 3948  df-ss 3958  df-pss 3960  df-nul 4316  df-if 4522  df-pw 4597  df-sn 4622  df-pr 4624  df-tp 4626  df-op 4628  df-uni 4901  df-int 4942  df-iun 4990  df-br 5140  df-opab 5202  df-mpt 5223  df-tr 5257  df-id 5565  df-eprel 5571  df-po 5579  df-so 5580  df-fr 5622  df-we 5624  df-xp 5673  df-rel 5674  df-cnv 5675  df-co 5676  df-dm 5677  df-rn 5678  df-res 5679  df-ima 5680  df-ord 6358  df-on 6359  df-suc 6361  df-iota 6486  df-fun 6536  df-fn 6537  df-f 6538  df-f1 6539  df-fo 6540  df-f1o 6541  df-fv 6542  df-1o 8462  df-2o 8463  df-no 27495  df-slt 27496
This theorem is referenced by:  noetasuplem4  27588
  Copyright terms: Public domain W3C validator