MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  precsexlem6 Structured version   Visualization version   GIF version

Theorem precsexlem6 28208
Description: Lemma for surreal reciprocal. Show that 𝐿 is non-strictly increasing in its argument. (Contributed by Scott Fenton, 15-Mar-2025.)
Hypotheses
Ref Expression
precsexlem.1 𝐹 = rec((𝑝 ∈ V ↦ (1st𝑝) / 𝑙(2nd𝑝) / 𝑟⟨(𝑙 ∪ ({𝑎 ∣ ∃𝑥𝑅 ∈ ( R ‘𝐴)∃𝑦𝐿𝑙 𝑎 = (( 1s +s ((𝑥𝑅 -s 𝐴) ·s 𝑦𝐿)) /su 𝑥𝑅)} ∪ {𝑎 ∣ ∃𝑥𝐿 ∈ {𝑥 ∈ ( L ‘𝐴) ∣ 0s <s 𝑥}∃𝑦𝑅𝑟 𝑎 = (( 1s +s ((𝑥𝐿 -s 𝐴) ·s 𝑦𝑅)) /su 𝑥𝐿)})), (𝑟 ∪ ({𝑎 ∣ ∃𝑥𝐿 ∈ {𝑥 ∈ ( L ‘𝐴) ∣ 0s <s 𝑥}∃𝑦𝐿𝑙 𝑎 = (( 1s +s ((𝑥𝐿 -s 𝐴) ·s 𝑦𝐿)) /su 𝑥𝐿)} ∪ {𝑎 ∣ ∃𝑥𝑅 ∈ ( R ‘𝐴)∃𝑦𝑅𝑟 𝑎 = (( 1s +s ((𝑥𝑅 -s 𝐴) ·s 𝑦𝑅)) /su 𝑥𝑅)}))⟩), ⟨{ 0s }, ∅⟩)
precsexlem.2 𝐿 = (1st𝐹)
precsexlem.3 𝑅 = (2nd𝐹)
Assertion
Ref Expression
precsexlem6 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω ∧ 𝐼𝐽) → (𝐿𝐼) ⊆ (𝐿𝐽))
Distinct variable groups:   𝐴,𝑎,𝑙,𝑝,𝑟,𝑥,𝑥𝐿,𝑥𝑅,𝑦𝑅   𝐹,𝑙,𝑝   𝐼,𝑎,𝑙,𝑝,𝑟,𝑥,𝑥𝐿,𝑥𝑅,𝑦𝐿,𝑦𝑅   𝐿,𝑎,𝑙,𝑥𝐿,𝑥𝑅,𝑦𝐿   𝑅,𝑎,𝑙,𝑟,𝑥𝐿,𝑥𝑅,𝑦𝑅
Allowed substitution hints:   𝐴(𝑦𝐿)   𝑅(𝑥,𝑝,𝑦𝐿)   𝐹(𝑥,𝑟,𝑎,𝑥𝐿,𝑥𝑅,𝑦𝐿,𝑦𝑅)   𝐽(𝑥,𝑟,𝑝,𝑎,𝑙,𝑥𝐿,𝑥𝑅,𝑦𝐿,𝑦𝑅)   𝐿(𝑥,𝑟,𝑝,𝑦𝑅)

Proof of Theorem precsexlem6
Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nnawordex 8565 . . 3 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (𝐼𝐽 ↔ ∃𝑘 ∈ ω (𝐼 +o 𝑘) = 𝐽))
2 oveq2 7366 . . . . . . . . . 10 (𝑘 = ∅ → (𝐼 +o 𝑘) = (𝐼 +o ∅))
32fveq2d 6838 . . . . . . . . 9 (𝑘 = ∅ → (𝐿‘(𝐼 +o 𝑘)) = (𝐿‘(𝐼 +o ∅)))
43sseq2d 3966 . . . . . . . 8 (𝑘 = ∅ → ((𝐿𝐼) ⊆ (𝐿‘(𝐼 +o 𝑘)) ↔ (𝐿𝐼) ⊆ (𝐿‘(𝐼 +o ∅))))
5 oveq2 7366 . . . . . . . . . 10 (𝑘 = 𝑗 → (𝐼 +o 𝑘) = (𝐼 +o 𝑗))
65fveq2d 6838 . . . . . . . . 9 (𝑘 = 𝑗 → (𝐿‘(𝐼 +o 𝑘)) = (𝐿‘(𝐼 +o 𝑗)))
76sseq2d 3966 . . . . . . . 8 (𝑘 = 𝑗 → ((𝐿𝐼) ⊆ (𝐿‘(𝐼 +o 𝑘)) ↔ (𝐿𝐼) ⊆ (𝐿‘(𝐼 +o 𝑗))))
8 oveq2 7366 . . . . . . . . . 10 (𝑘 = suc 𝑗 → (𝐼 +o 𝑘) = (𝐼 +o suc 𝑗))
98fveq2d 6838 . . . . . . . . 9 (𝑘 = suc 𝑗 → (𝐿‘(𝐼 +o 𝑘)) = (𝐿‘(𝐼 +o suc 𝑗)))
109sseq2d 3966 . . . . . . . 8 (𝑘 = suc 𝑗 → ((𝐿𝐼) ⊆ (𝐿‘(𝐼 +o 𝑘)) ↔ (𝐿𝐼) ⊆ (𝐿‘(𝐼 +o suc 𝑗))))
11 nna0 8532 . . . . . . . . . 10 (𝐼 ∈ ω → (𝐼 +o ∅) = 𝐼)
1211fveq2d 6838 . . . . . . . . 9 (𝐼 ∈ ω → (𝐿‘(𝐼 +o ∅)) = (𝐿𝐼))
1312eqimsscd 3991 . . . . . . . 8 (𝐼 ∈ ω → (𝐿𝐼) ⊆ (𝐿‘(𝐼 +o ∅)))
14 nnacl 8539 . . . . . . . . . . . 12 ((𝐼 ∈ ω ∧ 𝑗 ∈ ω) → (𝐼 +o 𝑗) ∈ ω)
15 ssun1 4130 . . . . . . . . . . . . 13 (𝐿‘(𝐼 +o 𝑗)) ⊆ ((𝐿‘(𝐼 +o 𝑗)) ∪ ({𝑎 ∣ ∃𝑥𝑅 ∈ ( R ‘𝐴)∃𝑦𝐿 ∈ (𝐿‘(𝐼 +o 𝑗))𝑎 = (( 1s +s ((𝑥𝑅 -s 𝐴) ·s 𝑦𝐿)) /su 𝑥𝑅)} ∪ {𝑎 ∣ ∃𝑥𝐿 ∈ {𝑥 ∈ ( L ‘𝐴) ∣ 0s <s 𝑥}∃𝑦𝑅 ∈ (𝑅‘(𝐼 +o 𝑗))𝑎 = (( 1s +s ((𝑥𝐿 -s 𝐴) ·s 𝑦𝑅)) /su 𝑥𝐿)}))
16 precsexlem.1 . . . . . . . . . . . . . 14 𝐹 = rec((𝑝 ∈ V ↦ (1st𝑝) / 𝑙(2nd𝑝) / 𝑟⟨(𝑙 ∪ ({𝑎 ∣ ∃𝑥𝑅 ∈ ( R ‘𝐴)∃𝑦𝐿𝑙 𝑎 = (( 1s +s ((𝑥𝑅 -s 𝐴) ·s 𝑦𝐿)) /su 𝑥𝑅)} ∪ {𝑎 ∣ ∃𝑥𝐿 ∈ {𝑥 ∈ ( L ‘𝐴) ∣ 0s <s 𝑥}∃𝑦𝑅𝑟 𝑎 = (( 1s +s ((𝑥𝐿 -s 𝐴) ·s 𝑦𝑅)) /su 𝑥𝐿)})), (𝑟 ∪ ({𝑎 ∣ ∃𝑥𝐿 ∈ {𝑥 ∈ ( L ‘𝐴) ∣ 0s <s 𝑥}∃𝑦𝐿𝑙 𝑎 = (( 1s +s ((𝑥𝐿 -s 𝐴) ·s 𝑦𝐿)) /su 𝑥𝐿)} ∪ {𝑎 ∣ ∃𝑥𝑅 ∈ ( R ‘𝐴)∃𝑦𝑅𝑟 𝑎 = (( 1s +s ((𝑥𝑅 -s 𝐴) ·s 𝑦𝑅)) /su 𝑥𝑅)}))⟩), ⟨{ 0s }, ∅⟩)
17 precsexlem.2 . . . . . . . . . . . . . 14 𝐿 = (1st𝐹)
18 precsexlem.3 . . . . . . . . . . . . . 14 𝑅 = (2nd𝐹)
1916, 17, 18precsexlem4 28206 . . . . . . . . . . . . 13 ((𝐼 +o 𝑗) ∈ ω → (𝐿‘suc (𝐼 +o 𝑗)) = ((𝐿‘(𝐼 +o 𝑗)) ∪ ({𝑎 ∣ ∃𝑥𝑅 ∈ ( R ‘𝐴)∃𝑦𝐿 ∈ (𝐿‘(𝐼 +o 𝑗))𝑎 = (( 1s +s ((𝑥𝑅 -s 𝐴) ·s 𝑦𝐿)) /su 𝑥𝑅)} ∪ {𝑎 ∣ ∃𝑥𝐿 ∈ {𝑥 ∈ ( L ‘𝐴) ∣ 0s <s 𝑥}∃𝑦𝑅 ∈ (𝑅‘(𝐼 +o 𝑗))𝑎 = (( 1s +s ((𝑥𝐿 -s 𝐴) ·s 𝑦𝑅)) /su 𝑥𝐿)})))
2015, 19sseqtrrid 3977 . . . . . . . . . . . 12 ((𝐼 +o 𝑗) ∈ ω → (𝐿‘(𝐼 +o 𝑗)) ⊆ (𝐿‘suc (𝐼 +o 𝑗)))
2114, 20syl 17 . . . . . . . . . . 11 ((𝐼 ∈ ω ∧ 𝑗 ∈ ω) → (𝐿‘(𝐼 +o 𝑗)) ⊆ (𝐿‘suc (𝐼 +o 𝑗)))
22 nnasuc 8534 . . . . . . . . . . . 12 ((𝐼 ∈ ω ∧ 𝑗 ∈ ω) → (𝐼 +o suc 𝑗) = suc (𝐼 +o 𝑗))
2322fveq2d 6838 . . . . . . . . . . 11 ((𝐼 ∈ ω ∧ 𝑗 ∈ ω) → (𝐿‘(𝐼 +o suc 𝑗)) = (𝐿‘suc (𝐼 +o 𝑗)))
2421, 23sseqtrrd 3971 . . . . . . . . . 10 ((𝐼 ∈ ω ∧ 𝑗 ∈ ω) → (𝐿‘(𝐼 +o 𝑗)) ⊆ (𝐿‘(𝐼 +o suc 𝑗)))
25 sstr2 3940 . . . . . . . . . 10 ((𝐿𝐼) ⊆ (𝐿‘(𝐼 +o 𝑗)) → ((𝐿‘(𝐼 +o 𝑗)) ⊆ (𝐿‘(𝐼 +o suc 𝑗)) → (𝐿𝐼) ⊆ (𝐿‘(𝐼 +o suc 𝑗))))
2624, 25syl5com 31 . . . . . . . . 9 ((𝐼 ∈ ω ∧ 𝑗 ∈ ω) → ((𝐿𝐼) ⊆ (𝐿‘(𝐼 +o 𝑗)) → (𝐿𝐼) ⊆ (𝐿‘(𝐼 +o suc 𝑗))))
2726expcom 413 . . . . . . . 8 (𝑗 ∈ ω → (𝐼 ∈ ω → ((𝐿𝐼) ⊆ (𝐿‘(𝐼 +o 𝑗)) → (𝐿𝐼) ⊆ (𝐿‘(𝐼 +o suc 𝑗)))))
284, 7, 10, 13, 27finds2 7840 . . . . . . 7 (𝑘 ∈ ω → (𝐼 ∈ ω → (𝐿𝐼) ⊆ (𝐿‘(𝐼 +o 𝑘))))
2928impcom 407 . . . . . 6 ((𝐼 ∈ ω ∧ 𝑘 ∈ ω) → (𝐿𝐼) ⊆ (𝐿‘(𝐼 +o 𝑘)))
30 fveq2 6834 . . . . . . 7 ((𝐼 +o 𝑘) = 𝐽 → (𝐿‘(𝐼 +o 𝑘)) = (𝐿𝐽))
3130sseq2d 3966 . . . . . 6 ((𝐼 +o 𝑘) = 𝐽 → ((𝐿𝐼) ⊆ (𝐿‘(𝐼 +o 𝑘)) ↔ (𝐿𝐼) ⊆ (𝐿𝐽)))
3229, 31syl5ibcom 245 . . . . 5 ((𝐼 ∈ ω ∧ 𝑘 ∈ ω) → ((𝐼 +o 𝑘) = 𝐽 → (𝐿𝐼) ⊆ (𝐿𝐽)))
3332rexlimdva 3137 . . . 4 (𝐼 ∈ ω → (∃𝑘 ∈ ω (𝐼 +o 𝑘) = 𝐽 → (𝐿𝐼) ⊆ (𝐿𝐽)))
3433adantr 480 . . 3 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (∃𝑘 ∈ ω (𝐼 +o 𝑘) = 𝐽 → (𝐿𝐼) ⊆ (𝐿𝐽)))
351, 34sylbid 240 . 2 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (𝐼𝐽 → (𝐿𝐼) ⊆ (𝐿𝐽)))
36353impia 1117 1 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω ∧ 𝐼𝐽) → (𝐿𝐼) ⊆ (𝐿𝐽))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1541  wcel 2113  {cab 2714  wrex 3060  {crab 3399  Vcvv 3440  csb 3849  cun 3899  wss 3901  c0 4285  {csn 4580  cop 4586   class class class wbr 5098  cmpt 5179  ccom 5628  suc csuc 6319  cfv 6492  (class class class)co 7358  ωcom 7808  1st c1st 7931  2nd c2nd 7932  reccrdg 8340   +o coa 8394   <s clts 27608   0s c0s 27801   1s c1s 27802   L cleft 27821   R cright 27822   +s cadds 27955   -s csubs 28016   ·s cmuls 28102   /su cdivs 28183
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 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-oadd 8401
This theorem is referenced by:  precsexlem10  28212
  Copyright terms: Public domain W3C validator