Theorem cuteq1 27805

Description: Condition for a surreal cut to equal one. (Contributed by Scott Fenton, 12-Mar-2025.)

Hypotheses

Ref	Expression
cuteq1.1	⊢ (𝜑 → 0s ∈ 𝐴)
cuteq1.2	⊢ (𝜑 → 𝐴 <<s { 1s })
cuteq1.3	⊢ (𝜑 → { 1s } <<s 𝐵)

Assertion

Ref	Expression
cuteq1	⊢ (𝜑 → (𝐴 |s 𝐵) = 1s )

Proof of Theorem cuteq1

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cuteq1.2	. 2 ⊢ (𝜑 → 𝐴 <<s { 1s })
2		cuteq1.3	. 2 ⊢ (𝜑 → { 1s } <<s 𝐵)
3		bday1s 27802	. . . . . 6 ⊢ ( bday ‘ 1s ) = 1o
4		df-1o 8395	. . . . . 6 ⊢ 1o = suc ∅
5	3, 4	eqtri 2757	. . . . 5 ⊢ ( bday ‘ 1s ) = suc ∅
6		ssltsep 27757	. . . . . . . . . . . . . 14 ⊢ (𝐴 <<s { 0s } → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ { 0s }𝑥 <s 𝑦)
7		dfral2 3085	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑦 ∈ { 0s }𝑥 <s 𝑦 ↔ ¬ ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦)
8	7	ralbii 3080	. . . . . . . . . . . . . . 15 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ { 0s }𝑥 <s 𝑦 ↔ ∀𝑥 ∈ 𝐴 ¬ ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦)
9		ralnex 3060	. . . . . . . . . . . . . . 15 ⊢ (∀𝑥 ∈ 𝐴 ¬ ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦 ↔ ¬ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦)
10	8, 9	bitri 275	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ { 0s }𝑥 <s 𝑦 ↔ ¬ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦)
11	6, 10	sylib 218	. . . . . . . . . . . . 13 ⊢ (𝐴 <<s { 0s } → ¬ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦)
12		cuteq1.1	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 0s ∈ 𝐴)
13		0sno 27797	. . . . . . . . . . . . . . . 16 ⊢ 0s ∈ No
14		sltirr 27712	. . . . . . . . . . . . . . . 16 ⊢ ( 0s ∈ No → ¬ 0s <s 0s )
15	13, 14	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ ¬ 0s <s 0s
16		breq1 5099	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 0s → (𝑥 <s 0s ↔ 0s <s 0s ))
17	16	notbid 318	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 0s → (¬ 𝑥 <s 0s ↔ ¬ 0s <s 0s ))
18	17	rspcev 3574	. . . . . . . . . . . . . . 15 ⊢ (( 0s ∈ 𝐴 ∧ ¬ 0s <s 0s ) → ∃𝑥 ∈ 𝐴 ¬ 𝑥 <s 0s )
19	12, 15, 18	sylancl 586	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 ¬ 𝑥 <s 0s )
20	13	elexi 3461	. . . . . . . . . . . . . . . 16 ⊢ 0s ∈ V
21		breq2 5100	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 0s → (𝑥 <s 𝑦 ↔ 𝑥 <s 0s ))
22	21	notbid 318	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 0s → (¬ 𝑥 <s 𝑦 ↔ ¬ 𝑥 <s 0s ))
23	20, 22	rexsn 4637	. . . . . . . . . . . . . . 15 ⊢ (∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦 ↔ ¬ 𝑥 <s 0s )
24	23	rexbii 3081	. . . . . . . . . . . . . 14 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦 ↔ ∃𝑥 ∈ 𝐴 ¬ 𝑥 <s 0s )
25	19, 24	sylibr 234	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦)
26	11, 25	nsyl3 138	. . . . . . . . . . . 12 ⊢ (𝜑 → ¬ 𝐴 <<s { 0s })
27	26	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ No ) → ¬ 𝐴 <<s { 0s })
28		sneq 4588	. . . . . . . . . . . . 13 ⊢ (𝑥 = 0s → {𝑥} = { 0s })
29	28	breq2d 5108	. . . . . . . . . . . 12 ⊢ (𝑥 = 0s → (𝐴 <<s {𝑥} ↔ 𝐴 <<s { 0s }))
30	29	notbid 318	. . . . . . . . . . 11 ⊢ (𝑥 = 0s → (¬ 𝐴 <<s {𝑥} ↔ ¬ 𝐴 <<s { 0s }))
31	27, 30	syl5ibrcom 247	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ No ) → (𝑥 = 0s → ¬ 𝐴 <<s {𝑥}))
32	31	necon2ad 2945	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ No ) → (𝐴 <<s {𝑥} → 𝑥 ≠ 0s ))
33	32	adantrd 491	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ No ) → ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) → 𝑥 ≠ 0s ))
34	33	impr 454	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))) → 𝑥 ≠ 0s )
35		bday0b 27801	. . . . . . . . 9 ⊢ (𝑥 ∈ No → (( bday ‘𝑥) = ∅ ↔ 𝑥 = 0s ))
36	35	ad2antrl 728	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))) → (( bday ‘𝑥) = ∅ ↔ 𝑥 = 0s ))
37	36	necon3bid 2974	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))) → (( bday ‘𝑥) ≠ ∅ ↔ 𝑥 ≠ 0s ))
38	34, 37	mpbird 257	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))) → ( bday ‘𝑥) ≠ ∅)
39		bdayelon 27742	. . . . . . . . 9 ⊢ ( bday ‘𝑥) ∈ On
40	39	onordi 6428	. . . . . . . 8 ⊢ Ord ( bday ‘𝑥)
41		ord0eln0 6371	. . . . . . . 8 ⊢ (Ord ( bday ‘𝑥) → (∅ ∈ ( bday ‘𝑥) ↔ ( bday ‘𝑥) ≠ ∅))
42	40, 41	ax-mp 5	. . . . . . 7 ⊢ (∅ ∈ ( bday ‘𝑥) ↔ ( bday ‘𝑥) ≠ ∅)
43		0elon 6370	. . . . . . . 8 ⊢ ∅ ∈ On
44	43, 39	onsucssi 7781	. . . . . . 7 ⊢ (∅ ∈ ( bday ‘𝑥) ↔ suc ∅ ⊆ ( bday ‘𝑥))
45	42, 44	bitr3i 277	. . . . . 6 ⊢ (( bday ‘𝑥) ≠ ∅ ↔ suc ∅ ⊆ ( bday ‘𝑥))
46	38, 45	sylib 218	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))) → suc ∅ ⊆ ( bday ‘𝑥))
47	5, 46	eqsstrid 3970	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))) → ( bday ‘ 1s ) ⊆ ( bday ‘𝑥))
48	47	expr 456	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ No ) → ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) → ( bday ‘ 1s ) ⊆ ( bday ‘𝑥)))
49	48	ralrimiva 3126	. 2 ⊢ (𝜑 → ∀𝑥 ∈ No ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) → ( bday ‘ 1s ) ⊆ ( bday ‘𝑥)))
50		1sno 27798	. . . . . . 7 ⊢ 1s ∈ No
51	50	elexi 3461	. . . . . 6 ⊢ 1s ∈ V
52	51	snnz 4731	. . . . 5 ⊢ { 1s } ≠ ∅
53		sslttr 27775	. . . . 5 ⊢ ((𝐴 <<s { 1s } ∧ { 1s } <<s 𝐵 ∧ { 1s } ≠ ∅) → 𝐴 <<s 𝐵)
54	52, 53	mp3an3 1452	. . . 4 ⊢ ((𝐴 <<s { 1s } ∧ { 1s } <<s 𝐵) → 𝐴 <<s 𝐵)
55	1, 2, 54	syl2anc 584	. . 3 ⊢ (𝜑 → 𝐴 <<s 𝐵)
56		eqscut2 27774	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 1s ∈ No ) → ((𝐴 |s 𝐵) = 1s ↔ (𝐴 <<s { 1s } ∧ { 1s } <<s 𝐵 ∧ ∀𝑥 ∈ No ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) → ( bday ‘ 1s ) ⊆ ( bday ‘𝑥)))))
57	55, 50, 56	sylancl 586	. 2 ⊢ (𝜑 → ((𝐴 |s 𝐵) = 1s ↔ (𝐴 <<s { 1s } ∧ { 1s } <<s 𝐵 ∧ ∀𝑥 ∈ No ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) → ( bday ‘ 1s ) ⊆ ( bday ‘𝑥)))))
58	1, 2, 49, 57	mpbir3and 1343	1 ⊢ (𝜑 → (𝐴 |s 𝐵) = 1s )

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   ≠ wne 2930  ∀wral 3049  ∃wrex 3058   ⊆ wss 3899  ∅c0 4283  {csn 4578   class class class wbr 5096  Ord word 6314  suc csuc 6317  ‘cfv 6490  (class class class)co 7356  1_oc1o 8388   No csur 27605   <s cslt 27606   bday cbday 27607   <<s csslt 27747   |s cscut 27749   0_s c0s 27793   1_s c1s 27794

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-tp 4583  df-op 4585  df-uni 4862  df-int 4901  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-ord 6318  df-on 6319  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1o 8395  df-2o 8396  df-no 27608  df-slt 27609  df-bday 27610  df-sslt 27748  df-scut 27750  df-0s 27795  df-1s 27796

This theorem is referenced by:  precsexlem11  28185