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

Theorem negsproplem7 28477
Description: Lemma for surreal negation. Show the second half of the inductive hypothesis unconditionally. (Contributed by Scott Fenton, 3-Feb-2025.)
Hypotheses
Ref Expression
negsproplem.1 (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
negsproplem4.1 (𝜑 → 𝐴 ∈ No)
negsproplem4.2 (𝜑 → 𝐵 ∈ No)
negsproplem4.3 (𝜑 → 𝐴 <s 𝐵)
Assertion
Ref Expression
negsproplem7 (𝜑 → ( -s‘𝐵) <s ( -s‘𝐴))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem negsproplem7
StepHypRef Expression
1 bdayon 28195 . . . 4 (bday‘𝐴) ∈ On
21onordi 6502 . . 3 Ord (bday‘𝐴)
3 bdayon 28195 . . . 4 (bday‘𝐵) ∈ On
43onordi 6502 . . 3 Ord (bday‘𝐵)
5 ordtri3or 6421 . . 3 ((Ord (bday‘𝐴) ∧ Ord (bday‘𝐵)) → ((bday‘𝐴) ∈ (bday‘𝐵) ∨ (bday‘𝐴) = (bday‘𝐵) ∨ (bday‘𝐵) ∈ (bday‘𝐴)))
62, 4, 5mp2an 705 . 2 ((bday‘𝐴) ∈ (bday‘𝐵) ∨ (bday‘𝐴) = (bday‘𝐵) ∨ (bday‘𝐵) ∈ (bday‘𝐴))
7 negsproplem.1 . . . . . 6 (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
87adantr 486 . . . . 5 ((𝜑 ∧ (bday‘𝐴) ∈ (bday‘𝐵)) → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
9 negsproplem4.1 . . . . . 6 (𝜑 → 𝐴 ∈ No)
109adantr 486 . . . . 5 ((𝜑 ∧ (bday‘𝐴) ∈ (bday‘𝐵)) → 𝐴 ∈ No)
11 negsproplem4.2 . . . . . 6 (𝜑 → 𝐵 ∈ No)
1211adantr 486 . . . . 5 ((𝜑 ∧ (bday‘𝐴) ∈ (bday‘𝐵)) → 𝐵 ∈ No)
13 negsproplem4.3 . . . . . 6 (𝜑 → 𝐴 <s 𝐵)
1413adantr 486 . . . . 5 ((𝜑 ∧ (bday‘𝐴) ∈ (bday‘𝐵)) → 𝐴 <s 𝐵)
15 simpr 490 . . . . 5 ((𝜑 ∧ (bday‘𝐴) ∈ (bday‘𝐵)) → (bday‘𝐴) ∈ (bday‘𝐵))
168, 10, 12, 14, 15negsproplem4 28474 . . . 4 ((𝜑 ∧ (bday‘𝐴) ∈ (bday‘𝐵)) → ( -s‘𝐵) <s ( -s‘𝐴))
1716ex 418 . . 3 (𝜑 → ((bday‘𝐴) ∈ (bday‘𝐵) → ( -s‘𝐵) <s ( -s‘𝐴)))
187adantr 486 . . . . 5 ((𝜑 ∧ (bday‘𝐴) = (bday‘𝐵)) → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
199adantr 486 . . . . 5 ((𝜑 ∧ (bday‘𝐴) = (bday‘𝐵)) → 𝐴 ∈ No)
2011adantr 486 . . . . 5 ((𝜑 ∧ (bday‘𝐴) = (bday‘𝐵)) → 𝐵 ∈ No)
2113adantr 486 . . . . 5 ((𝜑 ∧ (bday‘𝐴) = (bday‘𝐵)) → 𝐴 <s 𝐵)
22 simpr 490 . . . . 5 ((𝜑 ∧ (bday‘𝐴) = (bday‘𝐵)) → (bday‘𝐴) = (bday‘𝐵))
2318, 19, 20, 21, 22negsproplem6 28476 . . . 4 ((𝜑 ∧ (bday‘𝐴) = (bday‘𝐵)) → ( -s‘𝐵) <s ( -s‘𝐴))
2423ex 418 . . 3 (𝜑 → ((bday‘𝐴) = (bday‘𝐵) → ( -s‘𝐵) <s ( -s‘𝐴)))
257adantr 486 . . . . 5 ((𝜑 ∧ (bday‘𝐵) ∈ (bday‘𝐴)) → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
269adantr 486 . . . . 5 ((𝜑 ∧ (bday‘𝐵) ∈ (bday‘𝐴)) → 𝐴 ∈ No)
2711adantr 486 . . . . 5 ((𝜑 ∧ (bday‘𝐵) ∈ (bday‘𝐴)) → 𝐵 ∈ No)
2813adantr 486 . . . . 5 ((𝜑 ∧ (bday‘𝐵) ∈ (bday‘𝐴)) → 𝐴 <s 𝐵)
29 simpr 490 . . . . 5 ((𝜑 ∧ (bday‘𝐵) ∈ (bday‘𝐴)) → (bday‘𝐵) ∈ (bday‘𝐴))
3025, 26, 27, 28, 29negsproplem5 28475 . . . 4 ((𝜑 ∧ (bday‘𝐵) ∈ (bday‘𝐴)) → ( -s‘𝐵) <s ( -s‘𝐴))
3130ex 418 . . 3 (𝜑 → ((bday‘𝐵) ∈ (bday‘𝐴) → ( -s‘𝐵) <s ( -s‘𝐴)))
3217, 24, 313jaod 1457 . 2 (𝜑 → (((bday‘𝐴) ∈ (bday‘𝐵) ∨ (bday‘𝐴) = (bday‘𝐵) ∨ (bday‘𝐵) ∈ (bday‘𝐴)) → ( -s‘𝐵) <s ( -s‘𝐴)))
336, 32mpi 21 1 (𝜑 → ( -s‘𝐵) <s ( -s‘𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ w3o 1102   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ∪ cun 4152   class class class wbr 5108  Ord word 6387  ‘cfv 6566  Nocsur 28054   <s clts 28055  bdaycbday 28056   -scnegs 28462
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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-1o 8514  df-2o 8515  df-no 28057  df-lts 28058  df-bday 28059  df-slts 28201  df-cuts 28203  df-0s 28250  df-made 28270  df-old 28271  df-left 28273  df-right 28274  df-norec 28381  df-negs 28464
This theorem is used by:  negsprop  28478
  Copyright terms: Public domain W3C validator