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

Theorem precsexlem7 28227
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
precsexlem7 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω ∧ 𝐼𝐽) → (𝑅𝐼) ⊆ (𝑅𝐽))
Distinct variable groups:   𝐴,𝑎,𝑙,𝑝,𝑟,𝑥,𝑥𝐿,𝑥𝑅,𝑦𝑅   𝐹,𝑙,𝑝   𝐼,𝑎,𝑙,𝑝,𝑟,𝑥,𝑥𝐿,𝑥𝑅,𝑦𝐿,𝑦𝑅   𝐿,𝑎,𝑙,𝑥𝐿,𝑥𝑅,𝑦𝐿   𝑅,𝑎,𝑙,𝑟,𝑥𝐿,𝑥𝑅,𝑦𝑅
Allowed substitution hints:   𝐴(𝑦𝐿)   𝑅(𝑥,𝑝,𝑦𝐿)   𝐹(𝑥,𝑟,𝑎,𝑥𝐿,𝑥𝑅,𝑦𝐿,𝑦𝑅)   𝐽(𝑥,𝑟,𝑝,𝑎,𝑙,𝑥𝐿,𝑥𝑅,𝑦𝐿,𝑦𝑅)   𝐿(𝑥,𝑟,𝑝,𝑦𝑅)

Proof of Theorem precsexlem7
Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nnawordex 8567 . . 3 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (𝐼𝐽 ↔ ∃𝑘 ∈ ω (𝐼 +o 𝑘) = 𝐽))
2 oveq2 7368 . . . . . . . . . 10 (𝑘 = ∅ → (𝐼 +o 𝑘) = (𝐼 +o ∅))
32fveq2d 6835 . . . . . . . . 9 (𝑘 = ∅ → (𝑅‘(𝐼 +o 𝑘)) = (𝑅‘(𝐼 +o ∅)))
43sseq2d 3949 . . . . . . . 8 (𝑘 = ∅ → ((𝑅𝐼) ⊆ (𝑅‘(𝐼 +o 𝑘)) ↔ (𝑅𝐼) ⊆ (𝑅‘(𝐼 +o ∅))))
5 oveq2 7368 . . . . . . . . . 10 (𝑘 = 𝑗 → (𝐼 +o 𝑘) = (𝐼 +o 𝑗))
65fveq2d 6835 . . . . . . . . 9 (𝑘 = 𝑗 → (𝑅‘(𝐼 +o 𝑘)) = (𝑅‘(𝐼 +o 𝑗)))
76sseq2d 3949 . . . . . . . 8 (𝑘 = 𝑗 → ((𝑅𝐼) ⊆ (𝑅‘(𝐼 +o 𝑘)) ↔ (𝑅𝐼) ⊆ (𝑅‘(𝐼 +o 𝑗))))
8 oveq2 7368 . . . . . . . . . 10 (𝑘 = suc 𝑗 → (𝐼 +o 𝑘) = (𝐼 +o suc 𝑗))
98fveq2d 6835 . . . . . . . . 9 (𝑘 = suc 𝑗 → (𝑅‘(𝐼 +o 𝑘)) = (𝑅‘(𝐼 +o suc 𝑗)))
109sseq2d 3949 . . . . . . . 8 (𝑘 = suc 𝑗 → ((𝑅𝐼) ⊆ (𝑅‘(𝐼 +o 𝑘)) ↔ (𝑅𝐼) ⊆ (𝑅‘(𝐼 +o suc 𝑗))))
11 nna0 8534 . . . . . . . . . 10 (𝐼 ∈ ω → (𝐼 +o ∅) = 𝐼)
1211fveq2d 6835 . . . . . . . . 9 (𝐼 ∈ ω → (𝑅‘(𝐼 +o ∅)) = (𝑅𝐼))
1312eqimsscd 3974 . . . . . . . 8 (𝐼 ∈ ω → (𝑅𝐼) ⊆ (𝑅‘(𝐼 +o ∅)))
14 nnacl 8541 . . . . . . . . . . . 12 ((𝐼 ∈ ω ∧ 𝑗 ∈ ω) → (𝐼 +o 𝑗) ∈ ω)
15 ssun1 4110 . . . . . . . . . . . . 13 (𝑅‘(𝐼 +o 𝑗)) ⊆ ((𝑅‘(𝐼 +o 𝑗)) ∪ ({𝑎 ∣ ∃𝑥𝐿 ∈ {𝑥 ∈ ( L ‘𝐴) ∣ 0s <s 𝑥}∃𝑦𝐿 ∈ (𝐿‘(𝐼 +o 𝑗))𝑎 = (( 1s +s ((𝑥𝐿 -s 𝐴) ·s 𝑦𝐿)) /su 𝑥𝐿)} ∪ {𝑎 ∣ ∃𝑥𝑅 ∈ ( R ‘𝐴)∃𝑦𝑅 ∈ (𝑅‘(𝐼 +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, 18precsexlem5 28225 . . . . . . . . . . . . 13 ((𝐼 +o 𝑗) ∈ ω → (𝑅‘suc (𝐼 +o 𝑗)) = ((𝑅‘(𝐼 +o 𝑗)) ∪ ({𝑎 ∣ ∃𝑥𝐿 ∈ {𝑥 ∈ ( L ‘𝐴) ∣ 0s <s 𝑥}∃𝑦𝐿 ∈ (𝐿‘(𝐼 +o 𝑗))𝑎 = (( 1s +s ((𝑥𝐿 -s 𝐴) ·s 𝑦𝐿)) /su 𝑥𝐿)} ∪ {𝑎 ∣ ∃𝑥𝑅 ∈ ( R ‘𝐴)∃𝑦𝑅 ∈ (𝑅‘(𝐼 +o 𝑗))𝑎 = (( 1s +s ((𝑥𝑅 -s 𝐴) ·s 𝑦𝑅)) /su 𝑥𝑅)})))
2015, 19sseqtrrid 3960 . . . . . . . . . . . 12 ((𝐼 +o 𝑗) ∈ ω → (𝑅‘(𝐼 +o 𝑗)) ⊆ (𝑅‘suc (𝐼 +o 𝑗)))
2114, 20syl 17 . . . . . . . . . . 11 ((𝐼 ∈ ω ∧ 𝑗 ∈ ω) → (𝑅‘(𝐼 +o 𝑗)) ⊆ (𝑅‘suc (𝐼 +o 𝑗)))
22 nnasuc 8536 . . . . . . . . . . . 12 ((𝐼 ∈ ω ∧ 𝑗 ∈ ω) → (𝐼 +o suc 𝑗) = suc (𝐼 +o 𝑗))
2322fveq2d 6835 . . . . . . . . . . 11 ((𝐼 ∈ ω ∧ 𝑗 ∈ ω) → (𝑅‘(𝐼 +o suc 𝑗)) = (𝑅‘suc (𝐼 +o 𝑗)))
2421, 23sseqtrrd 3954 . . . . . . . . . 10 ((𝐼 ∈ ω ∧ 𝑗 ∈ ω) → (𝑅‘(𝐼 +o 𝑗)) ⊆ (𝑅‘(𝐼 +o suc 𝑗)))
25 sstr2 3924 . . . . . . . . . 10 ((𝑅𝐼) ⊆ (𝑅‘(𝐼 +o 𝑗)) → ((𝑅‘(𝐼 +o 𝑗)) ⊆ (𝑅‘(𝐼 +o suc 𝑗)) → (𝑅𝐼) ⊆ (𝑅‘(𝐼 +o suc 𝑗))))
2624, 25syl5com 31 . . . . . . . . 9 ((𝐼 ∈ ω ∧ 𝑗 ∈ ω) → ((𝑅𝐼) ⊆ (𝑅‘(𝐼 +o 𝑗)) → (𝑅𝐼) ⊆ (𝑅‘(𝐼 +o suc 𝑗))))
2726expcom 415 . . . . . . . 8 (𝑗 ∈ ω → (𝐼 ∈ ω → ((𝑅𝐼) ⊆ (𝑅‘(𝐼 +o 𝑗)) → (𝑅𝐼) ⊆ (𝑅‘(𝐼 +o suc 𝑗)))))
284, 7, 10, 13, 27finds2 7842 . . . . . . 7 (𝑘 ∈ ω → (𝐼 ∈ ω → (𝑅𝐼) ⊆ (𝑅‘(𝐼 +o 𝑘))))
2928impcom 409 . . . . . 6 ((𝐼 ∈ ω ∧ 𝑘 ∈ ω) → (𝑅𝐼) ⊆ (𝑅‘(𝐼 +o 𝑘)))
30 fveq2 6831 . . . . . . 7 ((𝐼 +o 𝑘) = 𝐽 → (𝑅‘(𝐼 +o 𝑘)) = (𝑅𝐽))
3130sseq2d 3949 . . . . . 6 ((𝐼 +o 𝑘) = 𝐽 → ((𝑅𝐼) ⊆ (𝑅‘(𝐼 +o 𝑘)) ↔ (𝑅𝐼) ⊆ (𝑅𝐽)))
3229, 31syl5ibcom 247 . . . . 5 ((𝐼 ∈ ω ∧ 𝑘 ∈ ω) → ((𝐼 +o 𝑘) = 𝐽 → (𝑅𝐼) ⊆ (𝑅𝐽)))
3332rexlimdva 3142 . . . 4 (𝐼 ∈ ω → (∃𝑘 ∈ ω (𝐼 +o 𝑘) = 𝐽 → (𝑅𝐼) ⊆ (𝑅𝐽)))
3433adantr 482 . . 3 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (∃𝑘 ∈ ω (𝐼 +o 𝑘) = 𝐽 → (𝑅𝐼) ⊆ (𝑅𝐽)))
351, 34sylbid 242 . 2 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (𝐼𝐽 → (𝑅𝐼) ⊆ (𝑅𝐽)))
36353impia 1124 1 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω ∧ 𝐼𝐽) → (𝑅𝐼) ⊆ (𝑅𝐽))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397  w3a 1093   = wceq 1548  wcel 2121  {cab 2719  wrex 3065  {crab 3393  Vcvv 3433  csb 3833  cun 3883  wss 3885  c0 4264  {csn 4558  cop 4564   class class class wbr 5075  cmpt 5156  ccom 5625  suc csuc 6316  cfv 6489  (class class class)co 7360  ωcom 7810  1st c1st 7933  2nd c2nd 7934  reccrdg 8342   +o coa 8396   <s clts 27626   0s c0s 27819   1s c1s 27820   L cleft 27839   R cright 27840   +s cadds 27973   -s csubs 28034   ·s cmuls 28120   /su cdivs 28201
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5202  ax-sep 5221  ax-nul 5231  ax-pr 5365  ax-un 7682
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-int 4881  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-oadd 8403
This theorem is referenced by:  precsexlem10  28230
  Copyright terms: Public domain W3C validator