Theorem negsproplem1 28291

Description: Lemma for surreal negation. We prove a pair of properties of surreal negation simultaneously. First, we instantiate some quantifiers. (Contributed by Scott Fenton, 2-Feb-2025.)

Hypotheses

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

Assertion

Ref	Expression
negsproplem1	⊢ (𝜑 → (( -us ‘𝑋) ∈ No ∧ (𝑋 <s 𝑌 → ( -us ‘𝑌) <s ( -us ‘𝑋))))

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

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝑌(𝑥)

Proof of Theorem negsproplem1

Step	Hyp	Ref	Expression
1		negsproplem1.1	. . 3 ⊢ (𝜑 → 𝑋 ∈ No )
2		negsproplem1.2	. . 3 ⊢ (𝜑 → 𝑌 ∈ No )
3	1, 2	jca 521	. 2 ⊢ (𝜑 → (𝑋 ∈ No ∧ 𝑌 ∈ No ))
4		negsproplem.1	. 2 ⊢ (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No ((( bday ‘𝑥) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) → (( -us ‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑥)))))
5		negsproplem1.3	. 2 ⊢ (𝜑 → (( bday ‘𝑋) ∪ ( bday ‘𝑌)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)))
6		fveq2 6882	. . . . . 6 ⊢ (𝑥 = 𝑋 → ( bday ‘𝑥) = ( bday ‘𝑋))
7	6	uneq1d 4117	. . . . 5 ⊢ (𝑥 = 𝑋 → (( bday ‘𝑥) ∪ ( bday ‘𝑦)) = (( bday ‘𝑋) ∪ ( bday ‘𝑦)))
8	7	eleq1d 2847	. . . 4 ⊢ (𝑥 = 𝑋 → ((( bday ‘𝑥) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) ↔ (( bday ‘𝑋) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵))))
9		fveq2 6882	. . . . . 6 ⊢ (𝑥 = 𝑋 → ( -us ‘𝑥) = ( -us ‘𝑋))
10	9	eleq1d 2847	. . . . 5 ⊢ (𝑥 = 𝑋 → (( -us ‘𝑥) ∈ No ↔ ( -us ‘𝑋) ∈ No ))
11		breq1 5110	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 <s 𝑦 ↔ 𝑋 <s 𝑦))
12	9	breq2d 5119	. . . . . 6 ⊢ (𝑥 = 𝑋 → (( -us ‘𝑦) <s ( -us ‘𝑥) ↔ ( -us ‘𝑦) <s ( -us ‘𝑋)))
13	11, 12	imbi12d 347	. . . . 5 ⊢ (𝑥 = 𝑋 → ((𝑥 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑥)) ↔ (𝑋 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑋))))
14	10, 13	anbi12d 644	. . . 4 ⊢ (𝑥 = 𝑋 → ((( -us ‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑥))) ↔ (( -us ‘𝑋) ∈ No ∧ (𝑋 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑋)))))
15	8, 14	imbi12d 347	. . 3 ⊢ (𝑥 = 𝑋 → (((( bday ‘𝑥) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) → (( -us ‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑥)))) ↔ ((( bday ‘𝑋) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) → (( -us ‘𝑋) ∈ No ∧ (𝑋 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑋))))))
16		fveq2 6882	. . . . . 6 ⊢ (𝑦 = 𝑌 → ( bday ‘𝑦) = ( bday ‘𝑌))
17	16	uneq2d 4118	. . . . 5 ⊢ (𝑦 = 𝑌 → (( bday ‘𝑋) ∪ ( bday ‘𝑦)) = (( bday ‘𝑋) ∪ ( bday ‘𝑌)))
18	17	eleq1d 2847	. . . 4 ⊢ (𝑦 = 𝑌 → ((( bday ‘𝑋) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) ↔ (( bday ‘𝑋) ∪ ( bday ‘𝑌)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵))))
19		breq2 5111	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑋 <s 𝑦 ↔ 𝑋 <s 𝑌))
20		fveq2 6882	. . . . . . 7 ⊢ (𝑦 = 𝑌 → ( -us ‘𝑦) = ( -us ‘𝑌))
21	20	breq1d 5117	. . . . . 6 ⊢ (𝑦 = 𝑌 → (( -us ‘𝑦) <s ( -us ‘𝑋) ↔ ( -us ‘𝑌) <s ( -us ‘𝑋)))
22	19, 21	imbi12d 347	. . . . 5 ⊢ (𝑦 = 𝑌 → ((𝑋 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑋)) ↔ (𝑋 <s 𝑌 → ( -us ‘𝑌) <s ( -us ‘𝑋))))
23	22	anbi2d 642	. . . 4 ⊢ (𝑦 = 𝑌 → ((( -us ‘𝑋) ∈ No ∧ (𝑋 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑋))) ↔ (( -us ‘𝑋) ∈ No ∧ (𝑋 <s 𝑌 → ( -us ‘𝑌) <s ( -us ‘𝑋)))))
24	18, 23	imbi12d 347	. . 3 ⊢ (𝑦 = 𝑌 → (((( bday ‘𝑋) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) → (( -us ‘𝑋) ∈ No ∧ (𝑋 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑋)))) ↔ ((( bday ‘𝑋) ∪ ( bday ‘𝑌)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) → (( -us ‘𝑋) ∈ No ∧ (𝑋 <s 𝑌 → ( -us ‘𝑌) <s ( -us ‘𝑋))))))
25	15, 24	rspc2v 3590	. 2 ⊢ ((𝑋 ∈ No ∧ 𝑌 ∈ No ) → (∀𝑥 ∈ No ∀𝑦 ∈ No ((( bday ‘𝑥) ∪ ( bday ‘𝑦)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) → (( -us ‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -us ‘𝑦) <s ( -us ‘𝑥)))) → ((( bday ‘𝑋) ∪ ( bday ‘𝑌)) ∈ (( bday ‘𝐴) ∪ ( bday ‘𝐵)) → (( -us ‘𝑋) ∈ No ∧ (𝑋 <s 𝑌 → ( -us ‘𝑌) <s ( -us ‘𝑋))))))
26	3, 4, 5, 25	syl3c 67	1 ⊢ (𝜑 → (( -us ‘𝑋) ∈ No ∧ (𝑋 <s 𝑌 → ( -us ‘𝑌) <s ( -us ‘𝑋))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078   ∪ cun 3900   class class class wbr 5107  ‘cfv 6537   No csur 27874   <s clts 27875   bday cbday 27876   -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-ext 2734

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 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-iota 6493  df-fv 6545

This theorem is used by:  negsproplem2  28292  negsproplem6  28296