Theorem negsproplem6 28446

Description: Lemma for surreal negation. Show the second half of the inductive hypothesis when 𝐴 is the same age as 𝐵. (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 𝐵)
negsproplem6.4	⊢ (𝜑 → (bday‘𝐴) = (bday‘𝐵))

Assertion

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

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

Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem negsproplem6

Dummy variable 𝑑 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		negsproplem4.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ No)
2		negsproplem4.2	. . 3 ⊢ (𝜑 → 𝐵 ∈ No)
3		negsproplem6.4	. . 3 ⊢ (𝜑 → (bday‘𝐴) = (bday‘𝐵))
4		negsproplem4.3	. . 3 ⊢ (𝜑 → 𝐴 <s 𝐵)
5		nodense 28076	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No) ∧ ((bday‘𝐴) = (bday‘𝐵) ∧ 𝐴 <s 𝐵)) → ∃𝑑 ∈ No ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))
6	1, 2, 3, 4, 5	syl22anc 852	. 2 ⊢ (𝜑 → ∃𝑑 ∈ No ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))
7		negsproplem.1	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
8		uncom 4160	. . . . . . . . . 10 ⊢ ((bday‘𝐴) ∪ (bday‘𝐵)) = ((bday‘𝐵) ∪ (bday‘𝐴))
9	8	eleq2i 2856	. . . . . . . . 9 ⊢ (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) ↔ ((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐵) ∪ (bday‘𝐴)))
10	9	imbi1i 352	. . . . . . . 8 ⊢ ((((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))) ↔ (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐵) ∪ (bday‘𝐴)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
11	10	2ralbii 3141	. . . . . . 7 ⊢ (∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))) ↔ ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐵) ∪ (bday‘𝐴)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
12	7, 11	sylib 221	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐵) ∪ (bday‘𝐴)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
13	12, 2	negsproplem3 28443	. . . . 5 ⊢ (𝜑 → (( -s‘𝐵) ∈ No ∧ ( -s “ (R‘𝐵)) <<s {( -s‘𝐵)} ∧ {( -s‘𝐵)} <<s ( -s “ (L‘𝐵))))
14	13	simp1d 1160	. . . 4 ⊢ (𝜑 → ( -s‘𝐵) ∈ No)
15	14	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → ( -s‘𝐵) ∈ No)
16	7	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
17		simprl 783	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → 𝑑 ∈ No)
18		0no 28222	. . . . . 6 ⊢ 0s ∈ No
19	18	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → 0s ∈ No)
20		bday0 28224	. . . . . . . 8 ⊢ (bday‘ 0s ) = ∅
21	20	uneq2i 4167	. . . . . . 7 ⊢ ((bday‘𝑑) ∪ (bday‘ 0s )) = ((bday‘𝑑) ∪ ∅)
22		un0 4347	. . . . . . 7 ⊢ ((bday‘𝑑) ∪ ∅) = (bday‘𝑑)
23	21, 22	eqtri 2786	. . . . . 6 ⊢ ((bday‘𝑑) ∪ (bday‘ 0s )) = (bday‘𝑑)
24		simprr1 1240	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → (bday‘𝑑) ∈ (bday‘𝐴))
25		elun1 4183	. . . . . . 7 ⊢ ((bday‘𝑑) ∈ (bday‘𝐴) → (bday‘𝑑) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)))
26	24, 25	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → (bday‘𝑑) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)))
27	23, 26	eqeltrid 2868	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → ((bday‘𝑑) ∪ (bday‘ 0s )) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)))
28	16, 17, 19, 27	negsproplem1 28441	. . . 4 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → (( -s‘𝑑) ∈ No ∧ (𝑑 <s 0s → ( -s‘ 0s ) <s ( -s‘𝑑))))
29	28	simpld 500	. . 3 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → ( -s‘𝑑) ∈ No)
30	7, 1	negsproplem3 28443	. . . . 5 ⊢ (𝜑 → (( -s‘𝐴) ∈ No ∧ ( -s “ (R‘𝐴)) <<s {( -s‘𝐴)} ∧ {( -s‘𝐴)} <<s ( -s “ (L‘𝐴))))
31	30	simp1d 1160	. . . 4 ⊢ (𝜑 → ( -s‘𝐴) ∈ No)
32	31	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → ( -s‘𝐴) ∈ No)
33	13	simp3d 1162	. . . . 5 ⊢ (𝜑 → {( -s‘𝐵)} <<s ( -s “ (L‘𝐵)))
34	33	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → {( -s‘𝐵)} <<s ( -s “ (L‘𝐵)))
35		fvex 6918	. . . . . 6 ⊢ ( -s‘𝐵) ∈ V
36	35	snid 4623	. . . . 5 ⊢ ( -s‘𝐵) ∈ {( -s‘𝐵)}
37	36	a1i 11	. . . 4 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → ( -s‘𝐵) ∈ {( -s‘𝐵)})
38		negsfn 28436	. . . . 5 ⊢ -s Fn No
39		leftssno 28286	. . . . 5 ⊢ (L‘𝐵) ⊆ No
40		bdayon 28165	. . . . . . . . 9 ⊢ (bday‘𝐴) ∈ On
41		oldbday 28314	. . . . . . . . 9 ⊢ (((bday‘𝐴) ∈ On ∧ 𝑑 ∈ No) → (𝑑 ∈ (O‘(bday‘𝐴)) ↔ (bday‘𝑑) ∈ (bday‘𝐴)))
42	40, 17, 41	sylancr 599	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → (𝑑 ∈ (O‘(bday‘𝐴)) ↔ (bday‘𝑑) ∈ (bday‘𝐴)))
43	24, 42	mpbird 260	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → 𝑑 ∈ (O‘(bday‘𝐴)))
44	3	fveq2d 6909	. . . . . . . 8 ⊢ (𝜑 → (O‘(bday‘𝐴)) = (O‘(bday‘𝐵)))
45	44	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → (O‘(bday‘𝐴)) = (O‘(bday‘𝐵)))
46	43, 45	eleqtrd 2866	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → 𝑑 ∈ (O‘(bday‘𝐵)))
47		simprr3 1242	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → 𝑑 <s 𝐵)
48		elleft 28264	. . . . . 6 ⊢ (𝑑 ∈ (L‘𝐵) ↔ (𝑑 ∈ (O‘(bday‘𝐵)) ∧ 𝑑 <s 𝐵))
49	46, 47, 48	sylanbrc 595	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → 𝑑 ∈ (L‘𝐵))
50		fnfvima 7259	. . . . 5 ⊢ (( -s Fn No ∧ (L‘𝐵) ⊆ No ∧ 𝑑 ∈ (L‘𝐵)) → ( -s‘𝑑) ∈ ( -s “ (L‘𝐵)))
51	38, 39, 49, 50	mp3an12i 1495	. . . 4 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → ( -s‘𝑑) ∈ ( -s “ (L‘𝐵)))
52	34, 37, 51	sltssepcd 28185	. . 3 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → ( -s‘𝐵) <s ( -s‘𝑑))
53	30	simp2d 1161	. . . . 5 ⊢ (𝜑 → ( -s “ (R‘𝐴)) <<s {( -s‘𝐴)})
54	53	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → ( -s “ (R‘𝐴)) <<s {( -s‘𝐴)})
55		rightssno 28287	. . . . 5 ⊢ (R‘𝐴) ⊆ No
56		simprr2 1241	. . . . . 6 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → 𝐴 <s 𝑑)
57		elright 28265	. . . . . 6 ⊢ (𝑑 ∈ (R‘𝐴) ↔ (𝑑 ∈ (O‘(bday‘𝐴)) ∧ 𝐴 <s 𝑑))
58	43, 56, 57	sylanbrc 595	. . . . 5 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → 𝑑 ∈ (R‘𝐴))
59		fnfvima 7259	. . . . 5 ⊢ (( -s Fn No ∧ (R‘𝐴) ⊆ No ∧ 𝑑 ∈ (R‘𝐴)) → ( -s‘𝑑) ∈ ( -s “ (R‘𝐴)))
60	38, 55, 58, 59	mp3an12i 1495	. . . 4 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → ( -s‘𝑑) ∈ ( -s “ (R‘𝐴)))
61		fvex 6918	. . . . . 6 ⊢ ( -s‘𝐴) ∈ V
62	61	snid 4623	. . . . 5 ⊢ ( -s‘𝐴) ∈ {( -s‘𝐴)}
63	62	a1i 11	. . . 4 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → ( -s‘𝐴) ∈ {( -s‘𝐴)})
64	54, 60, 63	sltssepcd 28185	. . 3 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → ( -s‘𝑑) <s ( -s‘𝐴))
65	15, 29, 32, 52, 64	ltstrd 28147	. 2 ⊢ ((𝜑 ∧ (𝑑 ∈ No ∧ ((bday‘𝑑) ∈ (bday‘𝐴) ∧ 𝐴 <s 𝑑 ∧ 𝑑 <s 𝐵))) → ( -s‘𝐵) <s ( -s‘𝐴))
66	6, 65	rexlimddv 3173	1 ⊢ (𝜑 → ( -s‘𝐵) <s ( -s‘𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   ∪ cun 4152  ∅c0 4281  {csn 4588   class class class wbr 5106   “ cima 5658  Oncon0 6377   Fn wfn 6550  ‘cfv 6555  Nocsur 28024   <s clts 28025  bdaycbday 28026   <<s cslts 28170   0_s c0s 28218  Ocold 28236  Lcleft 28238  Rcright 28239   -_scnegs 28432

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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

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 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-1o 8501  df-2o 8502  df-no 28027  df-lts 28028  df-bday 28029  df-slts 28171  df-cuts 28173  df-0s 28220  df-made 28240  df-old 28241  df-left 28243  df-right 28244  df-norec 28351  df-negs 28434

This theorem is used by:  negsproplem7  28447