Theorem negsproplem4 28294

Description: Lemma for surreal negation. Show the second half of the inductive hypothesis when 𝐴 is simpler than 𝐵. (Contributed by Scott Fenton, 2-Feb-2025.)

Hypotheses

Ref	Expression
negsproplem.1	⊢ (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No ((( bday ‘𝑥) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) → (( -us ‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑥)))))
negsproplem4.1	⊢ (𝜑 → 𝐴 ∈ No )
negsproplem4.2	⊢ (𝜑 → 𝐵 ∈ No )
negsproplem4.3	⊢ (𝜑 → 𝐴 <s 𝐵)
negsproplem4.4	⊢ (𝜑 → ( bday ‘𝐴) ∈ ( bday ‘𝐵))

Assertion

Ref	Expression
negsproplem4	⊢ (𝜑 → ( -us ‘𝐵) <s ( -us ‘𝐴))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem negsproplem4

Step	Hyp	Ref	Expression
1		negsproplem.1	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No ((( bday ‘𝑥) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) → (( -us ‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑥)))))
2		uncom 4108	. . . . . . . 8 ⊢ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) = (( bday ‘𝐵) ∪ ( bday ‘𝐴))
3	2	eleq2i 2854	. . . . . . 7 ⊢ ((( bday ‘𝑥) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) ↔ (( bday ‘𝑥) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐵) ∪ ( bday ‘𝐴)))
4	3	imbi1i 352	. . . . . 6 ⊢ (((( bday ‘𝑥) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) → (( -us ‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑥)))) ↔ ((( bday ‘𝑥) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐵) ∪ ( bday ‘𝐴)) → (( -us ‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑥)))))
5	4	2ralbii 3139	. . . . 5 ⊢ (∀𝑥 ∈ No ∀𝑦 ∈ No ((( bday ‘𝑥) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) → (( -us ‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑥)))) ↔ ∀𝑥 ∈ No ∀𝑦 ∈ No ((( bday ‘𝑥) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐵) ∪ ( bday ‘𝐴)) → (( -us ‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑥)))))
6	1, 5	sylib 221	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No ((( bday ‘𝑥) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐵) ∪ ( bday ‘𝐴)) → (( -us ‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑥)))))
7		negsproplem4.2	. . . 4 ⊢ (𝜑 → 𝐵 ∈ No )
8	6, 7	negsproplem3 28293	. . 3 ⊢ (𝜑 → (( -us ‘𝐵) ∈ No ∧ ( -us “ ( R ‘𝐵)) <<s {( -us ‘𝐵)} ∧ {( -us ‘𝐵)} <<s ( -us “ ( L ‘𝐵))))
9	8	simp3d 1162	. 2 ⊢ (𝜑 → {( -us ‘𝐵)} <<s ( -us “ ( L ‘𝐵)))
10		fvex 6895	. . . 4 ⊢ ( -us ‘𝐵) ∈ V
11	10	snid 4626	. . 3 ⊢ ( -us ‘𝐵) ∈ {( -us ‘𝐵)}
12	11	a1i 11	. 2 ⊢ (𝜑 → ( -us ‘𝐵) ∈ {( -us ‘𝐵)})
13		negsfn 28286	. . 3 ⊢ -us Fn No
14		leftssno 28136	. . 3 ⊢ ( L ‘𝐵) ⊆ No
15		negsproplem4.4	. . . . 5 ⊢ (𝜑 → ( bday ‘𝐴) ∈ ( bday ‘𝐵))
16		bdayon 28015	. . . . . 6 ⊢ ( bday ‘𝐵) ∈ On
17		negsproplem4.1	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ No )
18		oldbday 28164	. . . . . 6 ⊢ ((( bday ‘𝐵) ∈ On ∧ 𝐴 ∈ No ) → (𝐴 ∈ ( O ‘( bday ‘𝐵)) ↔ ( bday ‘𝐴) ∈ ( bday ‘𝐵)))
19	16, 17, 18	sylancr 599	. . . . 5 ⊢ (𝜑 → (𝐴 ∈ ( O ‘( bday ‘𝐵)) ↔ ( bday ‘𝐴) ∈ ( bday ‘𝐵)))
20	15, 19	mpbird 260	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ( O ‘( bday ‘𝐵)))
21		negsproplem4.3	. . . 4 ⊢ (𝜑 → 𝐴 <s 𝐵)
22		elleft 28114	. . . 4 ⊢ (𝐴 ∈ ( L ‘𝐵) ↔ (𝐴 ∈ ( O ‘( bday ‘𝐵)) ∧ 𝐴 <s 𝐵))
23	20, 21, 22	sylanbrc 595	. . 3 ⊢ (𝜑 → 𝐴 ∈ ( L ‘𝐵))
24		fnfvima 7235	. . 3 ⊢ (( -us Fn No ∧ ( L ‘𝐵) ⊆ No ∧ 𝐴 ∈ ( L ‘𝐵)) → ( -us ‘𝐴) ∈ ( -us “ ( L ‘𝐵)))
25	13, 14, 23, 24	mp3an12i 1494	. 2 ⊢ (𝜑 → ( -us ‘𝐴) ∈ ( -us “ ( L ‘𝐵)))
26	9, 12, 25	sltssepcd 28035	1 ⊢ (𝜑 → ( -us ‘𝐵) <s ( -us ‘𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145  ∀wral 3078   ∪ cun 3900   ⊆ wss 3902  {csn 4587   class class class wbr 5107   “ cima 5662  Oncon0 6361   Fn wfn 6532  ‘cfv 6537   No csur 27874   <s clts 27875   bday cbday 27876   <<s cslts 28020   O cold 28086   L cleft 28088   R cright 28089   -u_s cnegs 28282

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-1o 8458  df-2o 8459  df-no 27877  df-lts 27878  df-bday 27879  df-slts 28021  df-cuts 28023  df-0s 28070  df-made 28090  df-old 28091  df-left 28093  df-right 28094  df-norec 28201  df-negs 28284

This theorem is used by:  negsproplem7  28297