Theorem cuteq1 27324

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 27322	. . . . . 6 ⊢ ( bday ‘ 1s ) = 1o
4		df-1o 8463	. . . . . 6 ⊢ 1o = suc ∅
5	3, 4	eqtri 2761	. . . . 5 ⊢ ( bday ‘ 1s ) = suc ∅
6		ssltsep 27282	. . . . . . . . . . . . . 14 ⊢ (𝐴 <<s { 0s } → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ { 0s }𝑥 <s 𝑦)
7		dfral2 3100	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑦 ∈ { 0s }𝑥 <s 𝑦 ↔ ¬ ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦)
8	7	ralbii 3094	. . . . . . . . . . . . . . 15 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ { 0s }𝑥 <s 𝑦 ↔ ∀𝑥 ∈ 𝐴 ¬ ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦)
9		ralnex 3073	. . . . . . . . . . . . . . 15 ⊢ (∀𝑥 ∈ 𝐴 ¬ ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦 ↔ ¬ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦)
10	8, 9	bitri 275	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ { 0s }𝑥 <s 𝑦 ↔ ¬ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦)
11	6, 10	sylib 217	. . . . . . . . . . . . 13 ⊢ (𝐴 <<s { 0s } → ¬ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦)
12		cuteq1.1	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 0s ∈ 𝐴)
13		0sno 27317	. . . . . . . . . . . . . . . 16 ⊢ 0s ∈ No
14		sltirr 27239	. . . . . . . . . . . . . . . 16 ⊢ ( 0s ∈ No → ¬ 0s <s 0s )
15	13, 14	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ ¬ 0s <s 0s
16		breq1 5151	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 0s → (𝑥 <s 0s ↔ 0s <s 0s ))
17	16	notbid 318	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 0s → (¬ 𝑥 <s 0s ↔ ¬ 0s <s 0s ))
18	17	rspcev 3613	. . . . . . . . . . . . . . 15 ⊢ (( 0s ∈ 𝐴 ∧ ¬ 0s <s 0s ) → ∃𝑥 ∈ 𝐴 ¬ 𝑥 <s 0s )
19	12, 15, 18	sylancl 587	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 ¬ 𝑥 <s 0s )
20	13	elexi 3494	. . . . . . . . . . . . . . . 16 ⊢ 0s ∈ V
21		breq2 5152	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 0s → (𝑥 <s 𝑦 ↔ 𝑥 <s 0s ))
22	21	notbid 318	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 0s → (¬ 𝑥 <s 𝑦 ↔ ¬ 𝑥 <s 0s ))
23	20, 22	rexsn 4686	. . . . . . . . . . . . . . 15 ⊢ (∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦 ↔ ¬ 𝑥 <s 0s )
24	23	rexbii 3095	. . . . . . . . . . . . . 14 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦 ↔ ∃𝑥 ∈ 𝐴 ¬ 𝑥 <s 0s )
25	19, 24	sylibr 233	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ { 0s } ¬ 𝑥 <s 𝑦)
26	11, 25	nsyl3 138	. . . . . . . . . . . 12 ⊢ (𝜑 → ¬ 𝐴 <<s { 0s })
27	26	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ No ) → ¬ 𝐴 <<s { 0s })
28		sneq 4638	. . . . . . . . . . . . 13 ⊢ (𝑥 = 0s → {𝑥} = { 0s })
29	28	breq2d 5160	. . . . . . . . . . . 12 ⊢ (𝑥 = 0s → (𝐴 <<s {𝑥} ↔ 𝐴 <<s { 0s }))
30	29	notbid 318	. . . . . . . . . . 11 ⊢ (𝑥 = 0s → (¬ 𝐴 <<s {𝑥} ↔ ¬ 𝐴 <<s { 0s }))
31	27, 30	syl5ibrcom 246	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ No ) → (𝑥 = 0s → ¬ 𝐴 <<s {𝑥}))
32	31	necon2ad 2956	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ No ) → (𝐴 <<s {𝑥} → 𝑥 ≠ 0s ))
33	32	adantrd 493	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ No ) → ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) → 𝑥 ≠ 0s ))
34	33	impr 456	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))) → 𝑥 ≠ 0s )
35		bday0b 27321	. . . . . . . . 9 ⊢ (𝑥 ∈ No → (( bday ‘𝑥) = ∅ ↔ 𝑥 = 0s ))
36	35	ad2antrl 727	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))) → (( bday ‘𝑥) = ∅ ↔ 𝑥 = 0s ))
37	36	necon3bid 2986	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))) → (( bday ‘𝑥) ≠ ∅ ↔ 𝑥 ≠ 0s ))
38	34, 37	mpbird 257	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))) → ( bday ‘𝑥) ≠ ∅)
39		bdayelon 27268	. . . . . . . . 9 ⊢ ( bday ‘𝑥) ∈ On
40	39	onordi 6473	. . . . . . . 8 ⊢ Ord ( bday ‘𝑥)
41		ord0eln0 6417	. . . . . . . 8 ⊢ (Ord ( bday ‘𝑥) → (∅ ∈ ( bday ‘𝑥) ↔ ( bday ‘𝑥) ≠ ∅))
42	40, 41	ax-mp 5	. . . . . . 7 ⊢ (∅ ∈ ( bday ‘𝑥) ↔ ( bday ‘𝑥) ≠ ∅)
43		0elon 6416	. . . . . . . 8 ⊢ ∅ ∈ On
44	43, 39	onsucssi 7827	. . . . . . 7 ⊢ (∅ ∈ ( bday ‘𝑥) ↔ suc ∅ ⊆ ( bday ‘𝑥))
45	42, 44	bitr3i 277	. . . . . 6 ⊢ (( bday ‘𝑥) ≠ ∅ ↔ suc ∅ ⊆ ( bday ‘𝑥))
46	38, 45	sylib 217	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))) → suc ∅ ⊆ ( bday ‘𝑥))
47	5, 46	eqsstrid 4030	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ No ∧ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵))) → ( bday ‘ 1s ) ⊆ ( bday ‘𝑥))
48	47	expr 458	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ No ) → ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) → ( bday ‘ 1s ) ⊆ ( bday ‘𝑥)))
49	48	ralrimiva 3147	. 2 ⊢ (𝜑 → ∀𝑥 ∈ No ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) → ( bday ‘ 1s ) ⊆ ( bday ‘𝑥)))
50		1sno 27318	. . . . . . 7 ⊢ 1s ∈ No
51	50	elexi 3494	. . . . . 6 ⊢ 1s ∈ V
52	51	snnz 4780	. . . . 5 ⊢ { 1s } ≠ ∅
53		sslttr 27298	. . . . 5 ⊢ ((𝐴 <<s { 1s } ∧ { 1s } <<s 𝐵 ∧ { 1s } ≠ ∅) → 𝐴 <<s 𝐵)
54	52, 53	mp3an3 1451	. . . 4 ⊢ ((𝐴 <<s { 1s } ∧ { 1s } <<s 𝐵) → 𝐴 <<s 𝐵)
55	1, 2, 54	syl2anc 585	. . 3 ⊢ (𝜑 → 𝐴 <<s 𝐵)
56		eqscut2 27297	. . 3 ⊢ ((𝐴 <<s 𝐵 ∧ 1s ∈ No ) → ((𝐴 |s 𝐵) = 1s ↔ (𝐴 <<s { 1s } ∧ { 1s } <<s 𝐵 ∧ ∀𝑥 ∈ No ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) → ( bday ‘ 1s ) ⊆ ( bday ‘𝑥)))))
57	55, 50, 56	sylancl 587	. 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 205   ∧ wa 397   ∧ w3a 1088   = wceq 1542   ∈ wcel 2107   ≠ wne 2941  ∀wral 3062  ∃wrex 3071   ⊆ wss 3948  ∅c0 4322  {csn 4628   class class class wbr 5148  Ord word 6361  suc csuc 6364  ‘cfv 6541  (class class class)co 7406  1_oc1o 8456   No csur 27133   <s cslt 27134   bday cbday 27135   <<s csslt 27272   |s cscut 27274   0_s c0s 27313   1_s c1s 27314

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7722

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-tp 4633  df-op 4635  df-uni 4909  df-int 4951  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-ord 6365  df-on 6366  df-suc 6368  df-iota 6493  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-riota 7362  df-ov 7409  df-oprab 7410  df-mpo 7411  df-1o 8463  df-2o 8464  df-no 27136  df-slt 27137  df-bday 27138  df-sslt 27273  df-scut 27275  df-0s 27315  df-1s 27316

This theorem is referenced by:  precsexlem11  27653