Theorem ltsrec 28193

Description: A comparison law for surreals considered as cuts of sets of surreals. (Contributed by Scott Fenton, 11-Dec-2021.)

Assertion

Ref	Expression
ltsrec	⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → (𝑋 <s 𝑌 ↔ (∃𝑐 ∈ 𝐶 𝑋 ≤s 𝑐 ∨ ∃𝑏 ∈ 𝐵 𝑏 ≤s 𝑌)))

Distinct variable groups:   𝐴,𝑏,𝑐   𝐵,𝑏,𝑐   𝐶,𝑏,𝑐   𝐷,𝑏,𝑐   𝑋,𝑏,𝑐   𝑌,𝑏,𝑐

Proof of Theorem ltsrec

Step	Hyp	Ref	Expression
1		simplr 781	. . . . 5 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → 𝐶 <<s 𝐷)
2		simpll 779	. . . . 5 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → 𝐴 <<s 𝐵)
3		simprr 785	. . . . 5 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → 𝑌 = (𝐶 |s 𝐷))
4		simprl 783	. . . . 5 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → 𝑋 = (𝐴 |s 𝐵))
5	1, 2, 3, 4	lesrecd 28192	. . . 4 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → (𝑌 ≤s 𝑋 ↔ (∀𝑏 ∈ 𝐵 𝑌 <s 𝑏 ∧ ∀𝑐 ∈ 𝐶 𝑐 <s 𝑋)))
6		ancom 466	. . . 4 ⊢ ((∀𝑏 ∈ 𝐵 𝑌 <s 𝑏 ∧ ∀𝑐 ∈ 𝐶 𝑐 <s 𝑋) ↔ (∀𝑐 ∈ 𝐶 𝑐 <s 𝑋 ∧ ∀𝑏 ∈ 𝐵 𝑌 <s 𝑏))
7	5, 6	bitrdi 290	. . 3 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → (𝑌 ≤s 𝑋 ↔ (∀𝑐 ∈ 𝐶 𝑐 <s 𝑋 ∧ ∀𝑏 ∈ 𝐵 𝑌 <s 𝑏)))
8		cutcuts 28173	. . . . . . 7 ⊢ (𝐶 <<s 𝐷 → ((𝐶 |s 𝐷) ∈ No ∧ 𝐶 <<s {(𝐶 |s 𝐷)} ∧ {(𝐶 |s 𝐷)} <<s 𝐷))
9	8	simp1d 1160	. . . . . 6 ⊢ (𝐶 <<s 𝐷 → (𝐶 |s 𝐷) ∈ No)
10	9	ad2antlr 740	. . . . 5 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → (𝐶 |s 𝐷) ∈ No)
11	3, 10	eqeltrd 2860	. . . 4 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → 𝑌 ∈ No)
12		cutcuts 28173	. . . . . . 7 ⊢ (𝐴 <<s 𝐵 → ((𝐴 |s 𝐵) ∈ No ∧ 𝐴 <<s {(𝐴 |s 𝐵)} ∧ {(𝐴 |s 𝐵)} <<s 𝐵))
13	12	simp1d 1160	. . . . . 6 ⊢ (𝐴 <<s 𝐵 → (𝐴 |s 𝐵) ∈ No)
14	13	ad2antrr 739	. . . . 5 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → (𝐴 |s 𝐵) ∈ No)
15	4, 14	eqeltrd 2860	. . . 4 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → 𝑋 ∈ No)
16		lenlts 28115	. . . 4 ⊢ ((𝑌 ∈ No ∧ 𝑋 ∈ No) → (𝑌 ≤s 𝑋 ↔ ¬ 𝑋 <s 𝑌))
17	11, 15, 16	syl2anc 596	. . 3 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → (𝑌 ≤s 𝑋 ↔ ¬ 𝑋 <s 𝑌))
18		sltsss1 28157	. . . . . . . . 9 ⊢ (𝐶 <<s 𝐷 → 𝐶 ⊆ No)
19	18	ad2antlr 740	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → 𝐶 ⊆ No)
20	19	sselda 3908	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) ∧ 𝑐 ∈ 𝐶) → 𝑐 ∈ No)
21	15	adantr 486	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) ∧ 𝑐 ∈ 𝐶) → 𝑋 ∈ No)
22		ltnles 28116	. . . . . . 7 ⊢ ((𝑐 ∈ No ∧ 𝑋 ∈ No) → (𝑐 <s 𝑋 ↔ ¬ 𝑋 ≤s 𝑐))
23	20, 21, 22	syl2anc 596	. . . . . 6 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) ∧ 𝑐 ∈ 𝐶) → (𝑐 <s 𝑋 ↔ ¬ 𝑋 ≤s 𝑐))
24	23	ralbidva 3183	. . . . 5 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → (∀𝑐 ∈ 𝐶 𝑐 <s 𝑋 ↔ ∀𝑐 ∈ 𝐶 ¬ 𝑋 ≤s 𝑐))
25	11	adantr 486	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) ∧ 𝑏 ∈ 𝐵) → 𝑌 ∈ No)
26		sltsss2 28158	. . . . . . . . 9 ⊢ (𝐴 <<s 𝐵 → 𝐵 ⊆ No)
27	26	ad2antrr 739	. . . . . . . 8 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → 𝐵 ⊆ No)
28	27	sselda 3908	. . . . . . 7 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ No)
29		ltnles 28116	. . . . . . 7 ⊢ ((𝑌 ∈ No ∧ 𝑏 ∈ No) → (𝑌 <s 𝑏 ↔ ¬ 𝑏 ≤s 𝑌))
30	25, 28, 29	syl2anc 596	. . . . . 6 ⊢ ((((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) ∧ 𝑏 ∈ 𝐵) → (𝑌 <s 𝑏 ↔ ¬ 𝑏 ≤s 𝑌))
31	30	ralbidva 3183	. . . . 5 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → (∀𝑏 ∈ 𝐵 𝑌 <s 𝑏 ↔ ∀𝑏 ∈ 𝐵 ¬ 𝑏 ≤s 𝑌))
32	24, 31	anbi12d 644	. . . 4 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → ((∀𝑐 ∈ 𝐶 𝑐 <s 𝑋 ∧ ∀𝑏 ∈ 𝐵 𝑌 <s 𝑏) ↔ (∀𝑐 ∈ 𝐶 ¬ 𝑋 ≤s 𝑐 ∧ ∀𝑏 ∈ 𝐵 ¬ 𝑏 ≤s 𝑌)))
33		ralnex 3088	. . . . . 6 ⊢ (∀𝑐 ∈ 𝐶 ¬ 𝑋 ≤s 𝑐 ↔ ¬ ∃𝑐 ∈ 𝐶 𝑋 ≤s 𝑐)
34		ralnex 3088	. . . . . 6 ⊢ (∀𝑏 ∈ 𝐵 ¬ 𝑏 ≤s 𝑌 ↔ ¬ ∃𝑏 ∈ 𝐵 𝑏 ≤s 𝑌)
35	33, 34	anbi12i 640	. . . . 5 ⊢ ((∀𝑐 ∈ 𝐶 ¬ 𝑋 ≤s 𝑐 ∧ ∀𝑏 ∈ 𝐵 ¬ 𝑏 ≤s 𝑌) ↔ (¬ ∃𝑐 ∈ 𝐶 𝑋 ≤s 𝑐 ∧ ¬ ∃𝑏 ∈ 𝐵 𝑏 ≤s 𝑌))
36		ioran 999	. . . . 5 ⊢ (¬ (∃𝑐 ∈ 𝐶 𝑋 ≤s 𝑐 ∨ ∃𝑏 ∈ 𝐵 𝑏 ≤s 𝑌) ↔ (¬ ∃𝑐 ∈ 𝐶 𝑋 ≤s 𝑐 ∧ ¬ ∃𝑏 ∈ 𝐵 𝑏 ≤s 𝑌))
37	35, 36	bitr4i 281	. . . 4 ⊢ ((∀𝑐 ∈ 𝐶 ¬ 𝑋 ≤s 𝑐 ∧ ∀𝑏 ∈ 𝐵 ¬ 𝑏 ≤s 𝑌) ↔ ¬ (∃𝑐 ∈ 𝐶 𝑋 ≤s 𝑐 ∨ ∃𝑏 ∈ 𝐵 𝑏 ≤s 𝑌))
38	32, 37	bitrdi 290	. . 3 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → ((∀𝑐 ∈ 𝐶 𝑐 <s 𝑋 ∧ ∀𝑏 ∈ 𝐵 𝑌 <s 𝑏) ↔ ¬ (∃𝑐 ∈ 𝐶 𝑋 ≤s 𝑐 ∨ ∃𝑏 ∈ 𝐵 𝑏 ≤s 𝑌)))
39	7, 17, 38	3bitr3d 312	. 2 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → (¬ 𝑋 <s 𝑌 ↔ ¬ (∃𝑐 ∈ 𝐶 𝑋 ≤s 𝑐 ∨ ∃𝑏 ∈ 𝐵 𝑏 ≤s 𝑌)))
40	39	con4bid 320	1 ⊢ (((𝐴 <<s 𝐵 ∧ 𝐶 <<s 𝐷) ∧ (𝑋 = (𝐴 |s 𝐵) ∧ 𝑌 = (𝐶 |s 𝐷))) → (𝑋 <s 𝑌 ↔ (∃𝑐 ∈ 𝐶 𝑋 ≤s 𝑐 ∨ ∃𝑏 ∈ 𝐵 𝑏 ≤s 𝑌)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895  {csn 4584   class class class wbr 5102  (class class class)co 7421  Nocsur 28003   <s clts 28004   ≤s cles 28107   <<s cslts 28149   |s ccuts 28151

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-uni 4867  df-int 4907  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-suc 6368  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7378  df-ov 7424  df-oprab 7425  df-mpo 7426  df-1o 8480  df-2o 8481  df-no 28006  df-lts 28007  df-bday 28008  df-les 28108  df-slts 28150  df-cuts 28152

This theorem is used by:  ltsrecd  28194  0lt1s  28204