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

Theorem precsexlem10 28661
Description: Lemma for surreal reciprocal. Show that the union of the left sets is less than the union of the right sets. Note that this is the first theorem in the surreal numbers to require the axiom of infinity. (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 ∘ 𝐹)
precsexlem.4 (𝜑 → 𝐴 ∈ No)
precsexlem.5 (𝜑 → 0s <s 𝐴)
precsexlem.6 (𝜑 → ∀𝑥𝑂 ∈ ((L‘𝐴) ∪ (R‘𝐴))( 0s <s 𝑥𝑂 → ∃𝑦 ∈ No (𝑥𝑂 ·s 𝑦) = 1s ))
Assertion
Ref Expression
precsexlem10 (𝜑 → ∪ (𝐿 “ ω) <<s ∪ (𝑅 “ ω))
Distinct variable groups:   𝐴,𝑎,𝑙,𝑝,𝑟,𝑥,𝑥𝑂,𝑥𝐿,𝑥𝑅,𝑦,𝑦𝐿,𝑦𝑅   𝐹,𝑙,𝑝   𝐿,𝑎,𝑙,𝑥𝐿,𝑥𝑅,𝑦𝐿,𝑦𝑅   𝑅,𝑎,𝑙,𝑟,𝑥𝐿,𝑥𝑅,𝑦𝐿,𝑦𝑅   𝜑,𝑎,𝑥𝐿,𝑥𝑅,𝑦𝐿,𝑦𝑅   𝐿,𝑟   𝜑,𝑟
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑝, 𝑙, 𝑥𝑂)   𝑅(𝑥, 𝑦, 𝑝, 𝑥𝑂)   𝐹(𝑥, 𝑦, 𝑟, 𝑎, 𝑥𝑂, 𝑥𝐿, 𝑥𝑅, 𝑦𝐿, 𝑦𝑅)   𝐿(𝑥, 𝑦, 𝑝, 𝑥𝑂)

Proof of Theorem precsexlem10
Dummy variables 𝑖 𝑗 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fo1st 8054 . . . . . . . 8 1st :V⟶ontoV
2 fofun 6826 . . . . . . . 8 (1st :V⟶ontoV → Fun 1st )
31, 2ax-mp 5 . . . . . . 7 Fun 1st
4 rdgfun 8461 . . . . . . . 8 Fun 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 }, ∅⟩)
5 precsexlem.1 . . . . . . . . 9 𝐹 = 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 }, ∅⟩)
65funeqi 6587 . . . . . . . 8 (Fun 𝐹 ↔ Fun 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 }, ∅⟩))
74, 6mpbir 234 . . . . . . 7 Fun 𝐹
8 funco 6607 . . . . . . 7 ((Fun 1st ∧ Fun 𝐹) → Fun (1st ∘ 𝐹))
93, 7, 8mp2an 705 . . . . . 6 Fun (1st ∘ 𝐹)
10 precsexlem.2 . . . . . . 7 𝐿 = (1st ∘ 𝐹)
1110funeqi 6587 . . . . . 6 (Fun 𝐿 ↔ Fun (1st ∘ 𝐹))
129, 11mpbir 234 . . . . 5 Fun 𝐿
13 dcomex 10563 . . . . . 6 ω ∈ V
1413funimaex 6656 . . . . 5 (Fun 𝐿 → (𝐿 “ ω) ∈ V)
1512, 14ax-mp 5 . . . 4 (𝐿 “ ω) ∈ V
1615uniex 7789 . . 3 ∪ (𝐿 “ ω) ∈ V
1716a1i 11 . 2 (𝜑 → ∪ (𝐿 “ ω) ∈ V)
18 fo2nd 8055 . . . . . . . 8 2nd :V⟶ontoV
19 fofun 6826 . . . . . . . 8 (2nd :V⟶ontoV → Fun 2nd )
2018, 19ax-mp 5 . . . . . . 7 Fun 2nd
21 funco 6607 . . . . . . 7 ((Fun 2nd ∧ Fun 𝐹) → Fun (2nd ∘ 𝐹))
2220, 7, 21mp2an 705 . . . . . 6 Fun (2nd ∘ 𝐹)
23 precsexlem.3 . . . . . . 7 𝑅 = (2nd ∘ 𝐹)
2423funeqi 6587 . . . . . 6 (Fun 𝑅 ↔ Fun (2nd ∘ 𝐹))
2522, 24mpbir 234 . . . . 5 Fun 𝑅
2613funimaex 6656 . . . . 5 (Fun 𝑅 → (𝑅 “ ω) ∈ V)
2725, 26ax-mp 5 . . . 4 (𝑅 “ ω) ∈ V
2827uniex 7789 . . 3 ∪ (𝑅 “ ω) ∈ V
2928a1i 11 . 2 (𝜑 → ∪ (𝑅 “ ω) ∈ V)
30 funiunfv 7282 . . . 4 (Fun 𝐿 → ∪ 𝑖 ∈ ω (𝐿‘𝑖) = ∪ (𝐿 “ ω))
3112, 30ax-mp 5 . . 3 ∪ 𝑖 ∈ ω (𝐿‘𝑖) = ∪ (𝐿 “ ω)
32 precsexlem.4 . . . . . 6 (𝜑 → 𝐴 ∈ No)
33 precsexlem.5 . . . . . 6 (𝜑 → 0s <s 𝐴)
34 precsexlem.6 . . . . . 6 (𝜑 → ∀𝑥𝑂 ∈ ((L‘𝐴) ∪ (R‘𝐴))( 0s <s 𝑥𝑂 → ∃𝑦 ∈ No (𝑥𝑂 ·s 𝑦) = 1s ))
355, 10, 23, 32, 33, 34precsexlem8 28659 . . . . 5 ((𝜑 ∧ 𝑖 ∈ ω) → ((𝐿‘𝑖) ⊆ No ∧ (𝑅‘𝑖) ⊆ No))
3635simpld 500 . . . 4 ((𝜑 ∧ 𝑖 ∈ ω) → (𝐿‘𝑖) ⊆ No)
3736iunssd 5013 . . 3 (𝜑 → ∪ 𝑖 ∈ ω (𝐿‘𝑖) ⊆ No)
3831, 37eqsstrrid 3951 . 2 (𝜑 → ∪ (𝐿 “ ω) ⊆ No)
39 funiunfv 7282 . . . 4 (Fun 𝑅 → ∪ 𝑖 ∈ ω (𝑅‘𝑖) = ∪ (𝑅 “ ω))
4025, 39ax-mp 5 . . 3 ∪ 𝑖 ∈ ω (𝑅‘𝑖) = ∪ (𝑅 “ ω)
4135simprd 501 . . . 4 ((𝜑 ∧ 𝑖 ∈ ω) → (𝑅‘𝑖) ⊆ No)
4241iunssd 5013 . . 3 (𝜑 → ∪ 𝑖 ∈ ω (𝑅‘𝑖) ⊆ No)
4340, 42eqsstrrid 3951 . 2 (𝜑 → ∪ (𝑅 “ ω) ⊆ No)
4431eleq2i 2859 . . . . . . 7 (𝑏 ∈ ∪ 𝑖 ∈ ω (𝐿‘𝑖) ↔ 𝑏 ∈ ∪ (𝐿 “ ω))
45 eliun 4959 . . . . . . 7 (𝑏 ∈ ∪ 𝑖 ∈ ω (𝐿‘𝑖) ↔ ∃𝑖 ∈ ω 𝑏 ∈ (𝐿‘𝑖))
4644, 45bitr3i 280 . . . . . 6 (𝑏 ∈ ∪ (𝐿 “ ω) ↔ ∃𝑖 ∈ ω 𝑏 ∈ (𝐿‘𝑖))
47 funiunfv 7282 . . . . . . . . 9 (Fun 𝑅 → ∪ 𝑗 ∈ ω (𝑅‘𝑗) = ∪ (𝑅 “ ω))
4825, 47ax-mp 5 . . . . . . . 8 ∪ 𝑗 ∈ ω (𝑅‘𝑗) = ∪ (𝑅 “ ω)
4948eleq2i 2859 . . . . . . 7 (𝑐 ∈ ∪ 𝑗 ∈ ω (𝑅‘𝑗) ↔ 𝑐 ∈ ∪ (𝑅 “ ω))
50 eliun 4959 . . . . . . 7 (𝑐 ∈ ∪ 𝑗 ∈ ω (𝑅‘𝑗) ↔ ∃𝑗 ∈ ω 𝑐 ∈ (𝑅‘𝑗))
5149, 50bitr3i 280 . . . . . 6 (𝑐 ∈ ∪ (𝑅 “ ω) ↔ ∃𝑗 ∈ ω 𝑐 ∈ (𝑅‘𝑗))
5246, 51anbi12i 640 . . . . 5 ((𝑏 ∈ ∪ (𝐿 “ ω) ∧ 𝑐 ∈ ∪ (𝑅 “ ω)) ↔ (∃𝑖 ∈ ω 𝑏 ∈ (𝐿‘𝑖) ∧ ∃𝑗 ∈ ω 𝑐 ∈ (𝑅‘𝑗)))
53 reeanv 3238 . . . . 5 (∃𝑖 ∈ ω ∃𝑗 ∈ ω (𝑏 ∈ (𝐿‘𝑖) ∧ 𝑐 ∈ (𝑅‘𝑗)) ↔ (∃𝑖 ∈ ω 𝑏 ∈ (𝐿‘𝑖) ∧ ∃𝑗 ∈ ω 𝑐 ∈ (𝑅‘𝑗)))
5452, 53bitr4i 281 . . . 4 ((𝑏 ∈ ∪ (𝐿 “ ω) ∧ 𝑐 ∈ ∪ (𝑅 “ ω)) ↔ ∃𝑖 ∈ ω ∃𝑗 ∈ ω (𝑏 ∈ (𝐿‘𝑖) ∧ 𝑐 ∈ (𝑅‘𝑗)))
55 omun 7932 . . . . . . . . 9 ((𝑖 ∈ ω ∧ 𝑗 ∈ ω) → (𝑖 ∪ 𝑗) ∈ ω)
56 ssun1 4178 . . . . . . . . . 10 𝑖 ⊆ (𝑖 ∪ 𝑗)
575, 10, 23precsexlem6 28657 . . . . . . . . . 10 ((𝑖 ∈ ω ∧ (𝑖 ∪ 𝑗) ∈ ω ∧ 𝑖 ⊆ (𝑖 ∪ 𝑗)) → (𝐿‘𝑖) ⊆ (𝐿‘(𝑖 ∪ 𝑗)))
5856, 57mp3an3 1482 . . . . . . . . 9 ((𝑖 ∈ ω ∧ (𝑖 ∪ 𝑗) ∈ ω) → (𝐿‘𝑖) ⊆ (𝐿‘(𝑖 ∪ 𝑗)))
5955, 58syldan 603 . . . . . . . 8 ((𝑖 ∈ ω ∧ 𝑗 ∈ ω) → (𝐿‘𝑖) ⊆ (𝐿‘(𝑖 ∪ 𝑗)))
6059adantl 487 . . . . . . 7 ((𝜑 ∧ (𝑖 ∈ ω ∧ 𝑗 ∈ ω)) → (𝐿‘𝑖) ⊆ (𝐿‘(𝑖 ∪ 𝑗)))
6160sseld 3911 . . . . . 6 ((𝜑 ∧ (𝑖 ∈ ω ∧ 𝑗 ∈ ω)) → (𝑏 ∈ (𝐿‘𝑖) → 𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗))))
62 simpr 490 . . . . . . . . 9 ((𝑖 ∈ ω ∧ 𝑗 ∈ ω) → 𝑗 ∈ ω)
63 ssun2 4179 . . . . . . . . . 10 𝑗 ⊆ (𝑖 ∪ 𝑗)
645, 10, 23precsexlem7 28658 . . . . . . . . . 10 ((𝑗 ∈ ω ∧ (𝑖 ∪ 𝑗) ∈ ω ∧ 𝑗 ⊆ (𝑖 ∪ 𝑗)) → (𝑅‘𝑗) ⊆ (𝑅‘(𝑖 ∪ 𝑗)))
6563, 64mp3an3 1482 . . . . . . . . 9 ((𝑗 ∈ ω ∧ (𝑖 ∪ 𝑗) ∈ ω) → (𝑅‘𝑗) ⊆ (𝑅‘(𝑖 ∪ 𝑗)))
6662, 55, 65syl2anc 596 . . . . . . . 8 ((𝑖 ∈ ω ∧ 𝑗 ∈ ω) → (𝑅‘𝑗) ⊆ (𝑅‘(𝑖 ∪ 𝑗)))
6766sseld 3911 . . . . . . 7 ((𝑖 ∈ ω ∧ 𝑗 ∈ ω) → (𝑐 ∈ (𝑅‘𝑗) → 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗))))
6867adantl 487 . . . . . 6 ((𝜑 ∧ (𝑖 ∈ ω ∧ 𝑗 ∈ ω)) → (𝑐 ∈ (𝑅‘𝑗) → 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗))))
6932ad2antrr 739 . . . . . . . . . . . 12 (((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) ∧ (𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)))) → 𝐴 ∈ No)
705, 10, 23, 32, 33, 34precsexlem8 28659 . . . . . . . . . . . . . . 15 ((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) → ((𝐿‘(𝑖 ∪ 𝑗)) ⊆ No ∧ (𝑅‘(𝑖 ∪ 𝑗)) ⊆ No))
7170simpld 500 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) → (𝐿‘(𝑖 ∪ 𝑗)) ⊆ No)
7271sselda 3912 . . . . . . . . . . . . 13 (((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) ∧ 𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗))) → 𝑏 ∈ No)
7372adantrr 730 . . . . . . . . . . . 12 (((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) ∧ (𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)))) → 𝑏 ∈ No)
7469, 73mulscld 28580 . . . . . . . . . . 11 (((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) ∧ (𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)))) → (𝐴 ·s 𝑏) ∈ No)
7570simprd 501 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) → (𝑅‘(𝑖 ∪ 𝑗)) ⊆ No)
7675sselda 3912 . . . . . . . . . . . . 13 (((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗))) → 𝑐 ∈ No)
7776adantrl 729 . . . . . . . . . . . 12 (((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) ∧ (𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)))) → 𝑐 ∈ No)
7869, 77mulscld 28580 . . . . . . . . . . 11 (((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) ∧ (𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)))) → (𝐴 ·s 𝑐) ∈ No)
7974, 78jca 521 . . . . . . . . . 10 (((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) ∧ (𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)))) → ((𝐴 ·s 𝑏) ∈ No ∧ (𝐴 ·s 𝑐) ∈ No))
805, 10, 23, 32, 33, 34precsexlem9 28660 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) → (∀𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗))(𝐴 ·s 𝑏) <s 1s ∧ ∀𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)) 1s <s (𝐴 ·s 𝑐)))
8180simpld 500 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) → ∀𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗))(𝐴 ·s 𝑏) <s 1s )
82 rsp 3254 . . . . . . . . . . . . 13 (∀𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗))(𝐴 ·s 𝑏) <s 1s → (𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) → (𝐴 ·s 𝑏) <s 1s ))
8381, 82syl 18 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) → (𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) → (𝐴 ·s 𝑏) <s 1s ))
8480simprd 501 . . . . . . . . . . . . 13 ((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) → ∀𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)) 1s <s (𝐴 ·s 𝑐))
85 rsp 3254 . . . . . . . . . . . . 13 (∀𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)) 1s <s (𝐴 ·s 𝑐) → (𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)) → 1s <s (𝐴 ·s 𝑐)))
8684, 85syl 18 . . . . . . . . . . . 12 ((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) → (𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)) → 1s <s (𝐴 ·s 𝑐)))
8783, 86anim12d 621 . . . . . . . . . . 11 ((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) → ((𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗))) → ((𝐴 ·s 𝑏) <s 1s ∧ 1s <s (𝐴 ·s 𝑐))))
8887imp 412 . . . . . . . . . 10 (((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) ∧ (𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)))) → ((𝐴 ·s 𝑏) <s 1s ∧ 1s <s (𝐴 ·s 𝑐)))
89 1no 28255 . . . . . . . . . . 11 1s ∈ No
90 ltstr 28163 . . . . . . . . . . 11 (((𝐴 ·s 𝑏) ∈ No ∧ 1s ∈ No ∧ (𝐴 ·s 𝑐) ∈ No) → (((𝐴 ·s 𝑏) <s 1s ∧ 1s <s (𝐴 ·s 𝑐)) → (𝐴 ·s 𝑏) <s (𝐴 ·s 𝑐)))
9189, 90mp3an2 1481 . . . . . . . . . 10 (((𝐴 ·s 𝑏) ∈ No ∧ (𝐴 ·s 𝑐) ∈ No) → (((𝐴 ·s 𝑏) <s 1s ∧ 1s <s (𝐴 ·s 𝑐)) → (𝐴 ·s 𝑏) <s (𝐴 ·s 𝑐)))
9279, 88, 91sylc 66 . . . . . . . . 9 (((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) ∧ (𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)))) → (𝐴 ·s 𝑏) <s (𝐴 ·s 𝑐))
9333ad2antrr 739 . . . . . . . . . 10 (((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) ∧ (𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)))) → 0s <s 𝐴)
9473, 77, 69, 93ltmuls2d 28617 . . . . . . . . 9 (((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) ∧ (𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)))) → (𝑏 <s 𝑐 ↔ (𝐴 ·s 𝑏) <s (𝐴 ·s 𝑐)))
9592, 94mpbird 260 . . . . . . . 8 (((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) ∧ (𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗)))) → 𝑏 <s 𝑐)
9695ex 418 . . . . . . 7 ((𝜑 ∧ (𝑖 ∪ 𝑗) ∈ ω) → ((𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗))) → 𝑏 <s 𝑐))
9755, 96sylan2 605 . . . . . 6 ((𝜑 ∧ (𝑖 ∈ ω ∧ 𝑗 ∈ ω)) → ((𝑏 ∈ (𝐿‘(𝑖 ∪ 𝑗)) ∧ 𝑐 ∈ (𝑅‘(𝑖 ∪ 𝑗))) → 𝑏 <s 𝑐))
9861, 68, 97syl2and 620 . . . . 5 ((𝜑 ∧ (𝑖 ∈ ω ∧ 𝑗 ∈ ω)) → ((𝑏 ∈ (𝐿‘𝑖) ∧ 𝑐 ∈ (𝑅‘𝑗)) → 𝑏 <s 𝑐))
9998rexlimdvva 3223 . . . 4 (𝜑 → (∃𝑖 ∈ ω ∃𝑗 ∈ ω (𝑏 ∈ (𝐿‘𝑖) ∧ 𝑐 ∈ (𝑅‘𝑗)) → 𝑏 <s 𝑐))
10054, 99biimtrid 245 . . 3 (𝜑 → ((𝑏 ∈ ∪ (𝐿 “ ω) ∧ 𝑐 ∈ ∪ (𝑅 “ ω)) → 𝑏 <s 𝑐))
1011003impib 1135 . 2 ((𝜑 ∧ 𝑏 ∈ ∪ (𝐿 “ ω) ∧ 𝑐 ∈ ∪ (𝑅 “ ω)) → 𝑏 <s 𝑐)
10217, 29, 38, 43, 101sltsd 28213 1 (𝜑 → ∪ (𝐿 “ ω) <<s ∪ (𝑅 “ ω))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  {cab 2744  ∀wral 3083  ∃wrex 3093  {crab 3415  Vcvv 3453  ⦋csb 3850   ⊆ wss 3899   ∪ cun 4151  ∅c0 4280  {csn 4587  ⟨cop 4839  ∪ cuni 4871  ∪ ciun 4955   class class class wbr 5107   ↦ cmpt 5191   “ cima 5660   ∘ ccom 5661  Fun wfun 6559  ⟶ontowfo 6563  ‘cfv 6565  (class class class)co 7450  ωcom 7910  1st c1st 8032  2nd c2nd 8033  reccrdg 8454  Nocsur 28056   <s clts 28057   <<s cslts 28202   0s c0s 28250   1s c1s 28251  Lcleft 28270  Rcright 28271   +s cadds 28404   −s csubs 28465   ·s cmuls 28551   /su cdivs 28632
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-dc 10562
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4840  df-ot 4863  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-se 5611  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-2o 8514  df-oadd 8517  df-nadd 8712  df-no 28059  df-lts 28060  df-bday 28061  df-les 28161  df-slts 28203  df-cuts 28205  df-0s 28252  df-1s 28253  df-made 28272  df-old 28273  df-left 28275  df-right 28276  df-norec 28383  df-norec2 28394  df-adds 28405  df-negs 28466  df-subs 28467  df-muls 28552  df-divs 28633
This theorem is used by:  precsexlem11  28662  precsex  28663
  Copyright terms: Public domain W3C validator