Theorem negsunif 28434

Description: Uniformity property for surreal negation. If 𝐿 and 𝑅 are any cut that represents 𝐴, then they may be used instead of ( L ‘𝐴) and ( R ‘𝐴) in the definition of negation. (Contributed by Scott Fenton, 14-Feb-2025.)

Hypotheses

Ref	Expression
negsunif.1	⊢ (𝜑 → 𝐿 <<s 𝑅)
negsunif.2	⊢ (𝜑 → 𝐴 = (𝐿 |s 𝑅))

Assertion

Ref	Expression
negsunif	⊢ (𝜑 → ( -us ‘𝐴) = (( -us “ 𝑅) |s ( -us “ 𝐿)))

Proof of Theorem negsunif

Dummy variables 𝑎 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		negsunif.2	. . . 4 ⊢ (𝜑 → 𝐴 = (𝐿 |s 𝑅))
2		negsunif.1	. . . . 5 ⊢ (𝜑 → 𝐿 <<s 𝑅)
3	2	cutscld 28162	. . . 4 ⊢ (𝜑 → (𝐿 |s 𝑅) ∈ No )
4	1, 3	eqeltrd 2861	. . 3 ⊢ (𝜑 → 𝐴 ∈ No )
5		negsval 28404	. . 3 ⊢ (𝐴 ∈ No → ( -us ‘𝐴) = (( -us “ ( R ‘𝐴)) |s ( -us “ ( L ‘𝐴))))
6	4, 5	syl 18	. 2 ⊢ (𝜑 → ( -us ‘𝐴) = (( -us “ ( R ‘𝐴)) |s ( -us “ ( L ‘𝐴))))
7		negcut2 28419	. . . 4 ⊢ (𝐴 ∈ No → ( -us “ ( R ‘𝐴)) <<s ( -us “ ( L ‘𝐴)))
8	4, 7	syl 18	. . 3 ⊢ (𝜑 → ( -us “ ( R ‘𝐴)) <<s ( -us “ ( L ‘𝐴)))
9	2, 1	cofcutr2d 28305	. . . . 5 ⊢ (𝜑 → ∀𝑐 ∈ ( R ‘𝐴)∃𝑑 ∈ 𝑅 𝑑 ≤s 𝑐)
10		negsfn 28402	. . . . . . . 8 ⊢ -us Fn No
11		sltsss2 28145	. . . . . . . . 9 ⊢ (𝐿 <<s 𝑅 → 𝑅 ⊆ No )
12	2, 11	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝑅 ⊆ No )
13		breq2 5107	. . . . . . . . 9 ⊢ (𝑏 = ( -us ‘𝑑) → (( -us ‘𝑐) ≤s 𝑏 ↔ ( -us ‘𝑐) ≤s ( -us ‘𝑑)))
14	13	rexima 7242	. . . . . . . 8 ⊢ (( -us Fn No ∧ 𝑅 ⊆ No ) → (∃𝑏 ∈ ( -us “ 𝑅)( -us ‘𝑐) ≤s 𝑏 ↔ ∃𝑑 ∈ 𝑅 ( -us ‘𝑐) ≤s ( -us ‘𝑑)))
15	10, 12, 14	sylancr 599	. . . . . . 7 ⊢ (𝜑 → (∃𝑏 ∈ ( -us “ 𝑅)( -us ‘𝑐) ≤s 𝑏 ↔ ∃𝑑 ∈ 𝑅 ( -us ‘𝑐) ≤s ( -us ‘𝑑)))
16	15	ralbidv 3186	. . . . . 6 ⊢ (𝜑 → (∀𝑐 ∈ ( R ‘𝐴)∃𝑏 ∈ ( -us “ 𝑅)( -us ‘𝑐) ≤s 𝑏 ↔ ∀𝑐 ∈ ( R ‘𝐴)∃𝑑 ∈ 𝑅 ( -us ‘𝑐) ≤s ( -us ‘𝑑)))
17	12	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑐 ∈ ( R ‘𝐴)) → 𝑅 ⊆ No )
18	17	sselda 3931	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑐 ∈ ( R ‘𝐴)) ∧ 𝑑 ∈ 𝑅) → 𝑑 ∈ No )
19		rightssno 28253	. . . . . . . . . . 11 ⊢ ( R ‘𝐴) ⊆ No
20	19	sseli 3927	. . . . . . . . . 10 ⊢ (𝑐 ∈ ( R ‘𝐴) → 𝑐 ∈ No )
21	20	ad2antlr 740	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑐 ∈ ( R ‘𝐴)) ∧ 𝑑 ∈ 𝑅) → 𝑐 ∈ No )
22	18, 21	lenegsd 28427	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑐 ∈ ( R ‘𝐴)) ∧ 𝑑 ∈ 𝑅) → (𝑑 ≤s 𝑐 ↔ ( -us ‘𝑐) ≤s ( -us ‘𝑑)))
23	22	rexbidva 3185	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑐 ∈ ( R ‘𝐴)) → (∃𝑑 ∈ 𝑅 𝑑 ≤s 𝑐 ↔ ∃𝑑 ∈ 𝑅 ( -us ‘𝑐) ≤s ( -us ‘𝑑)))
24	23	ralbidva 3184	. . . . . 6 ⊢ (𝜑 → (∀𝑐 ∈ ( R ‘𝐴)∃𝑑 ∈ 𝑅 𝑑 ≤s 𝑐 ↔ ∀𝑐 ∈ ( R ‘𝐴)∃𝑑 ∈ 𝑅 ( -us ‘𝑐) ≤s ( -us ‘𝑑)))
25	16, 24	bitr4d 285	. . . . 5 ⊢ (𝜑 → (∀𝑐 ∈ ( R ‘𝐴)∃𝑏 ∈ ( -us “ 𝑅)( -us ‘𝑐) ≤s 𝑏 ↔ ∀𝑐 ∈ ( R ‘𝐴)∃𝑑 ∈ 𝑅 𝑑 ≤s 𝑐))
26	9, 25	mpbird 260	. . . 4 ⊢ (𝜑 → ∀𝑐 ∈ ( R ‘𝐴)∃𝑏 ∈ ( -us “ 𝑅)( -us ‘𝑐) ≤s 𝑏)
27		breq1 5106	. . . . . . 7 ⊢ (𝑎 = ( -us ‘𝑐) → (𝑎 ≤s 𝑏 ↔ ( -us ‘𝑐) ≤s 𝑏))
28	27	rexbidv 3187	. . . . . 6 ⊢ (𝑎 = ( -us ‘𝑐) → (∃𝑏 ∈ ( -us “ 𝑅)𝑎 ≤s 𝑏 ↔ ∃𝑏 ∈ ( -us “ 𝑅)( -us ‘𝑐) ≤s 𝑏))
29	28	ralima 7241	. . . . 5 ⊢ (( -us Fn No ∧ ( R ‘𝐴) ⊆ No ) → (∀𝑎 ∈ ( -us “ ( R ‘𝐴))∃𝑏 ∈ ( -us “ 𝑅)𝑎 ≤s 𝑏 ↔ ∀𝑐 ∈ ( R ‘𝐴)∃𝑏 ∈ ( -us “ 𝑅)( -us ‘𝑐) ≤s 𝑏))
30	10, 19, 29	mp2an 705	. . . 4 ⊢ (∀𝑎 ∈ ( -us “ ( R ‘𝐴))∃𝑏 ∈ ( -us “ 𝑅)𝑎 ≤s 𝑏 ↔ ∀𝑐 ∈ ( R ‘𝐴)∃𝑏 ∈ ( -us “ 𝑅)( -us ‘𝑐) ≤s 𝑏)
31	26, 30	sylibr 237	. . 3 ⊢ (𝜑 → ∀𝑎 ∈ ( -us “ ( R ‘𝐴))∃𝑏 ∈ ( -us “ 𝑅)𝑎 ≤s 𝑏)
32	2, 1	cofcutr1d 28304	. . . . 5 ⊢ (𝜑 → ∀𝑐 ∈ ( L ‘𝐴)∃𝑑 ∈ 𝐿 𝑐 ≤s 𝑑)
33		sltsss1 28144	. . . . . . . . 9 ⊢ (𝐿 <<s 𝑅 → 𝐿 ⊆ No )
34	2, 33	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝐿 ⊆ No )
35		breq1 5106	. . . . . . . . 9 ⊢ (𝑏 = ( -us ‘𝑑) → (𝑏 ≤s ( -us ‘𝑐) ↔ ( -us ‘𝑑) ≤s ( -us ‘𝑐)))
36	35	rexima 7242	. . . . . . . 8 ⊢ (( -us Fn No ∧ 𝐿 ⊆ No ) → (∃𝑏 ∈ ( -us “ 𝐿)𝑏 ≤s ( -us ‘𝑐) ↔ ∃𝑑 ∈ 𝐿 ( -us ‘𝑑) ≤s ( -us ‘𝑐)))
37	10, 34, 36	sylancr 599	. . . . . . 7 ⊢ (𝜑 → (∃𝑏 ∈ ( -us “ 𝐿)𝑏 ≤s ( -us ‘𝑐) ↔ ∃𝑑 ∈ 𝐿 ( -us ‘𝑑) ≤s ( -us ‘𝑐)))
38	37	ralbidv 3186	. . . . . 6 ⊢ (𝜑 → (∀𝑐 ∈ ( L ‘𝐴)∃𝑏 ∈ ( -us “ 𝐿)𝑏 ≤s ( -us ‘𝑐) ↔ ∀𝑐 ∈ ( L ‘𝐴)∃𝑑 ∈ 𝐿 ( -us ‘𝑑) ≤s ( -us ‘𝑐)))
39		leftssno 28252	. . . . . . . . . . 11 ⊢ ( L ‘𝐴) ⊆ No
40	39	sseli 3927	. . . . . . . . . 10 ⊢ (𝑐 ∈ ( L ‘𝐴) → 𝑐 ∈ No )
41	40	ad2antlr 740	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑐 ∈ ( L ‘𝐴)) ∧ 𝑑 ∈ 𝐿) → 𝑐 ∈ No )
42	34	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑐 ∈ ( L ‘𝐴)) → 𝐿 ⊆ No )
43	42	sselda 3931	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑐 ∈ ( L ‘𝐴)) ∧ 𝑑 ∈ 𝐿) → 𝑑 ∈ No )
44	41, 43	lenegsd 28427	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑐 ∈ ( L ‘𝐴)) ∧ 𝑑 ∈ 𝐿) → (𝑐 ≤s 𝑑 ↔ ( -us ‘𝑑) ≤s ( -us ‘𝑐)))
45	44	rexbidva 3185	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑐 ∈ ( L ‘𝐴)) → (∃𝑑 ∈ 𝐿 𝑐 ≤s 𝑑 ↔ ∃𝑑 ∈ 𝐿 ( -us ‘𝑑) ≤s ( -us ‘𝑐)))
46	45	ralbidva 3184	. . . . . 6 ⊢ (𝜑 → (∀𝑐 ∈ ( L ‘𝐴)∃𝑑 ∈ 𝐿 𝑐 ≤s 𝑑 ↔ ∀𝑐 ∈ ( L ‘𝐴)∃𝑑 ∈ 𝐿 ( -us ‘𝑑) ≤s ( -us ‘𝑐)))
47	38, 46	bitr4d 285	. . . . 5 ⊢ (𝜑 → (∀𝑐 ∈ ( L ‘𝐴)∃𝑏 ∈ ( -us “ 𝐿)𝑏 ≤s ( -us ‘𝑐) ↔ ∀𝑐 ∈ ( L ‘𝐴)∃𝑑 ∈ 𝐿 𝑐 ≤s 𝑑))
48	32, 47	mpbird 260	. . . 4 ⊢ (𝜑 → ∀𝑐 ∈ ( L ‘𝐴)∃𝑏 ∈ ( -us “ 𝐿)𝑏 ≤s ( -us ‘𝑐))
49		breq2 5107	. . . . . . 7 ⊢ (𝑎 = ( -us ‘𝑐) → (𝑏 ≤s 𝑎 ↔ 𝑏 ≤s ( -us ‘𝑐)))
50	49	rexbidv 3187	. . . . . 6 ⊢ (𝑎 = ( -us ‘𝑐) → (∃𝑏 ∈ ( -us “ 𝐿)𝑏 ≤s 𝑎 ↔ ∃𝑏 ∈ ( -us “ 𝐿)𝑏 ≤s ( -us ‘𝑐)))
51	50	ralima 7241	. . . . 5 ⊢ (( -us Fn No ∧ ( L ‘𝐴) ⊆ No ) → (∀𝑎 ∈ ( -us “ ( L ‘𝐴))∃𝑏 ∈ ( -us “ 𝐿)𝑏 ≤s 𝑎 ↔ ∀𝑐 ∈ ( L ‘𝐴)∃𝑏 ∈ ( -us “ 𝐿)𝑏 ≤s ( -us ‘𝑐)))
52	10, 39, 51	mp2an 705	. . . 4 ⊢ (∀𝑎 ∈ ( -us “ ( L ‘𝐴))∃𝑏 ∈ ( -us “ 𝐿)𝑏 ≤s 𝑎 ↔ ∀𝑐 ∈ ( L ‘𝐴)∃𝑏 ∈ ( -us “ 𝐿)𝑏 ≤s ( -us ‘𝑐))
53	48, 52	sylibr 237	. . 3 ⊢ (𝜑 → ∀𝑎 ∈ ( -us “ ( L ‘𝐴))∃𝑏 ∈ ( -us “ 𝐿)𝑏 ≤s 𝑎)
54		fnfun 6637	. . . . . . 7 ⊢ ( -us Fn No → Fun -us )
55	10, 54	ax-mp 5	. . . . . 6 ⊢ Fun -us
56		sltsex2 28143	. . . . . . 7 ⊢ (𝐿 <<s 𝑅 → 𝑅 ∈ V)
57	2, 56	syl 18	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ V)
58		funimaexg 6624	. . . . . 6 ⊢ ((Fun -us ∧ 𝑅 ∈ V) → ( -us “ 𝑅) ∈ V)
59	55, 57, 58	sylancr 599	. . . . 5 ⊢ (𝜑 → ( -us “ 𝑅) ∈ V)
60		snex 5397	. . . . . 6 ⊢ {( -us ‘𝐴)} ∈ V
61	60	a1i 11	. . . . 5 ⊢ (𝜑 → {( -us ‘𝐴)} ∈ V)
62		imassrn 6196	. . . . . . 7 ⊢ ( -us “ 𝑅) ⊆ ran -us
63		negsfo 28432	. . . . . . . 8 ⊢ -us : No –onto→ No
64		forn 6797	. . . . . . . 8 ⊢ ( -us : No –onto→ No → ran -us = No )
65	63, 64	ax-mp 5	. . . . . . 7 ⊢ ran -us = No
66	62, 65	sseqtri 3979	. . . . . 6 ⊢ ( -us “ 𝑅) ⊆ No
67	66	a1i 11	. . . . 5 ⊢ (𝜑 → ( -us “ 𝑅) ⊆ No )
68	4	negscld 28416	. . . . . 6 ⊢ (𝜑 → ( -us ‘𝐴) ∈ No )
69	68	snssd 4747	. . . . 5 ⊢ (𝜑 → {( -us ‘𝐴)} ⊆ No )
70		velsn 4600	. . . . . . . 8 ⊢ (𝑎 ∈ {( -us ‘𝐴)} ↔ 𝑎 = ( -us ‘𝐴))
71		fvelimab 6955	. . . . . . . . . . 11 ⊢ (( -us Fn No ∧ 𝑅 ⊆ No ) → (𝑏 ∈ ( -us “ 𝑅) ↔ ∃𝑑 ∈ 𝑅 ( -us ‘𝑑) = 𝑏))
72	10, 12, 71	sylancr 599	. . . . . . . . . 10 ⊢ (𝜑 → (𝑏 ∈ ( -us “ 𝑅) ↔ ∃𝑑 ∈ 𝑅 ( -us ‘𝑑) = 𝑏))
73	1	sneqd 4596	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → {𝐴} = {(𝐿 |s 𝑅)})
74	73	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑅) → {𝐴} = {(𝐿 |s 𝑅)})
75		cutcuts 28160	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐿 <<s 𝑅 → ((𝐿 |s 𝑅) ∈ No ∧ 𝐿 <<s {(𝐿 |s 𝑅)} ∧ {(𝐿 |s 𝑅)} <<s 𝑅))
76	2, 75	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((𝐿 |s 𝑅) ∈ No ∧ 𝐿 <<s {(𝐿 |s 𝑅)} ∧ {(𝐿 |s 𝑅)} <<s 𝑅))
77	76	simp3d 1162	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → {(𝐿 |s 𝑅)} <<s 𝑅)
78	77	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑅) → {(𝐿 |s 𝑅)} <<s 𝑅)
79	74, 78	eqbrtrd 5127	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑅) → {𝐴} <<s 𝑅)
80		snidg 4621	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ No → 𝐴 ∈ {𝐴})
81	4, 80	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐴 ∈ {𝐴})
82	81	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑅) → 𝐴 ∈ {𝐴})
83		simpr 490	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑅) → 𝑑 ∈ 𝑅)
84	79, 82, 83	sltssepcd 28151	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑅) → 𝐴 <s 𝑑)
85	4	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑅) → 𝐴 ∈ No )
86	12	sselda 3931	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑅) → 𝑑 ∈ No )
87	85, 86	ltnegsd 28426	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑅) → (𝐴 <s 𝑑 ↔ ( -us ‘𝑑) <s ( -us ‘𝐴)))
88	84, 87	mpbid 235	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑅) → ( -us ‘𝑑) <s ( -us ‘𝐴))
89		breq1 5106	. . . . . . . . . . . 12 ⊢ (( -us ‘𝑑) = 𝑏 → (( -us ‘𝑑) <s ( -us ‘𝐴) ↔ 𝑏 <s ( -us ‘𝐴)))
90	88, 89	syl5ibcom 248	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑅) → (( -us ‘𝑑) = 𝑏 → 𝑏 <s ( -us ‘𝐴)))
91	90	rexlimdva 3164	. . . . . . . . . 10 ⊢ (𝜑 → (∃𝑑 ∈ 𝑅 ( -us ‘𝑑) = 𝑏 → 𝑏 <s ( -us ‘𝐴)))
92	72, 91	sylbid 243	. . . . . . . . 9 ⊢ (𝜑 → (𝑏 ∈ ( -us “ 𝑅) → 𝑏 <s ( -us ‘𝐴)))
93		breq2 5107	. . . . . . . . . 10 ⊢ (𝑎 = ( -us ‘𝐴) → (𝑏 <s 𝑎 ↔ 𝑏 <s ( -us ‘𝐴)))
94	93	imbi2d 343	. . . . . . . . 9 ⊢ (𝑎 = ( -us ‘𝐴) → ((𝑏 ∈ ( -us “ 𝑅) → 𝑏 <s 𝑎) ↔ (𝑏 ∈ ( -us “ 𝑅) → 𝑏 <s ( -us ‘𝐴))))
95	92, 94	syl5ibrcom 250	. . . . . . . 8 ⊢ (𝜑 → (𝑎 = ( -us ‘𝐴) → (𝑏 ∈ ( -us “ 𝑅) → 𝑏 <s 𝑎)))
96	70, 95	biimtrid 245	. . . . . . 7 ⊢ (𝜑 → (𝑎 ∈ {( -us ‘𝐴)} → (𝑏 ∈ ( -us “ 𝑅) → 𝑏 <s 𝑎)))
97	96	3imp 1128	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ {( -us ‘𝐴)} ∧ 𝑏 ∈ ( -us “ 𝑅)) → 𝑏 <s 𝑎)
98	97	3com23 1144	. . . . 5 ⊢ ((𝜑 ∧ 𝑏 ∈ ( -us “ 𝑅) ∧ 𝑎 ∈ {( -us ‘𝐴)}) → 𝑏 <s 𝑎)
99	59, 61, 67, 69, 98	sltsd 28147	. . . 4 ⊢ (𝜑 → ( -us “ 𝑅) <<s {( -us ‘𝐴)})
100	6	sneqd 4596	. . . 4 ⊢ (𝜑 → {( -us ‘𝐴)} = {(( -us “ ( R ‘𝐴)) |s ( -us “ ( L ‘𝐴)))})
101	99, 100	breqtrd 5131	. . 3 ⊢ (𝜑 → ( -us “ 𝑅) <<s {(( -us “ ( R ‘𝐴)) |s ( -us “ ( L ‘𝐴)))})
102		sltsex1 28142	. . . . . . 7 ⊢ (𝐿 <<s 𝑅 → 𝐿 ∈ V)
103	2, 102	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐿 ∈ V)
104		funimaexg 6624	. . . . . 6 ⊢ ((Fun -us ∧ 𝐿 ∈ V) → ( -us “ 𝐿) ∈ V)
105	55, 103, 104	sylancr 599	. . . . 5 ⊢ (𝜑 → ( -us “ 𝐿) ∈ V)
106		imassrn 6196	. . . . . . 7 ⊢ ( -us “ 𝐿) ⊆ ran -us
107	106, 65	sseqtri 3979	. . . . . 6 ⊢ ( -us “ 𝐿) ⊆ No
108	107	a1i 11	. . . . 5 ⊢ (𝜑 → ( -us “ 𝐿) ⊆ No )
109		fvelimab 6955	. . . . . . . . . 10 ⊢ (( -us Fn No ∧ 𝐿 ⊆ No ) → (𝑏 ∈ ( -us “ 𝐿) ↔ ∃𝑐 ∈ 𝐿 ( -us ‘𝑐) = 𝑏))
110	10, 34, 109	sylancr 599	. . . . . . . . 9 ⊢ (𝜑 → (𝑏 ∈ ( -us “ 𝐿) ↔ ∃𝑐 ∈ 𝐿 ( -us ‘𝑐) = 𝑏))
111	2	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐿) → 𝐿 <<s 𝑅)
112	111, 75	syl 18	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐿) → ((𝐿 |s 𝑅) ∈ No ∧ 𝐿 <<s {(𝐿 |s 𝑅)} ∧ {(𝐿 |s 𝑅)} <<s 𝑅))
113	112	simp2d 1161	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐿) → 𝐿 <<s {(𝐿 |s 𝑅)})
114	73	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐿) → {𝐴} = {(𝐿 |s 𝑅)})
115	113, 114	breqtrrd 5133	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐿) → 𝐿 <<s {𝐴})
116		simpr 490	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐿) → 𝑐 ∈ 𝐿)
117	81	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐿) → 𝐴 ∈ {𝐴})
118	115, 116, 117	sltssepcd 28151	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐿) → 𝑐 <s 𝐴)
119	34	sselda 3931	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐿) → 𝑐 ∈ No )
120	4	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐿) → 𝐴 ∈ No )
121	119, 120	ltnegsd 28426	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐿) → (𝑐 <s 𝐴 ↔ ( -us ‘𝐴) <s ( -us ‘𝑐)))
122	118, 121	mpbid 235	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐿) → ( -us ‘𝐴) <s ( -us ‘𝑐))
123		breq2 5107	. . . . . . . . . . 11 ⊢ (( -us ‘𝑐) = 𝑏 → (( -us ‘𝐴) <s ( -us ‘𝑐) ↔ ( -us ‘𝐴) <s 𝑏))
124	122, 123	syl5ibcom 248	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐿) → (( -us ‘𝑐) = 𝑏 → ( -us ‘𝐴) <s 𝑏))
125	124	rexlimdva 3164	. . . . . . . . 9 ⊢ (𝜑 → (∃𝑐 ∈ 𝐿 ( -us ‘𝑐) = 𝑏 → ( -us ‘𝐴) <s 𝑏))
126	110, 125	sylbid 243	. . . . . . . 8 ⊢ (𝜑 → (𝑏 ∈ ( -us “ 𝐿) → ( -us ‘𝐴) <s 𝑏))
127		breq1 5106	. . . . . . . . 9 ⊢ (𝑎 = ( -us ‘𝐴) → (𝑎 <s 𝑏 ↔ ( -us ‘𝐴) <s 𝑏))
128	127	imbi2d 343	. . . . . . . 8 ⊢ (𝑎 = ( -us ‘𝐴) → ((𝑏 ∈ ( -us “ 𝐿) → 𝑎 <s 𝑏) ↔ (𝑏 ∈ ( -us “ 𝐿) → ( -us ‘𝐴) <s 𝑏)))
129	126, 128	syl5ibrcom 250	. . . . . . 7 ⊢ (𝜑 → (𝑎 = ( -us ‘𝐴) → (𝑏 ∈ ( -us “ 𝐿) → 𝑎 <s 𝑏)))
130	70, 129	biimtrid 245	. . . . . 6 ⊢ (𝜑 → (𝑎 ∈ {( -us ‘𝐴)} → (𝑏 ∈ ( -us “ 𝐿) → 𝑎 <s 𝑏)))
131	130	3imp 1128	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ {( -us ‘𝐴)} ∧ 𝑏 ∈ ( -us “ 𝐿)) → 𝑎 <s 𝑏)
132	61, 105, 69, 108, 131	sltsd 28147	. . . 4 ⊢ (𝜑 → {( -us ‘𝐴)} <<s ( -us “ 𝐿))
133	100, 132	eqbrtrrd 5129	. . 3 ⊢ (𝜑 → {(( -us “ ( R ‘𝐴)) |s ( -us “ ( L ‘𝐴)))} <<s ( -us “ 𝐿))
134	8, 31, 53, 101, 133	cofcut1d 28300	. 2 ⊢ (𝜑 → (( -us “ ( R ‘𝐴)) |s ( -us “ ( L ‘𝐴))) = (( -us “ 𝑅) |s ( -us “ 𝐿)))
135	6, 134	eqtrd 2796	1 ⊢ (𝜑 → ( -us ‘𝐴) = (( -us “ 𝑅) |s ( -us “ 𝐿)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ⊆ wss 3899  {csn 4584   class class class wbr 5103  ran crn 5652   “ cima 5654  Fun wfun 6531   Fn wfn 6532  –onto→wfo 6535  ‘cfv 6537  (class class class)co 7418   No csur 27990   <s clts 27991   ≤s cles 28094   <<s cslts 28136   |s ccuts 28138   L cleft 28204   R cright 28205   -u_s cnegs 28398

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 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-ot 4593  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  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 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-1o 8469  df-2o 8470  df-nadd 8668  df-no 27993  df-lts 27994  df-bday 27995  df-les 28095  df-slts 28137  df-cuts 28139  df-0s 28186  df-made 28206  df-old 28207  df-left 28209  df-right 28210  df-norec 28317  df-norec2 28328  df-adds 28339  df-negs 28400

This theorem is used by:  zcuts  28786  renegscl  28877