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

Theorem legval 25279
 Description: Value of the less-than relationship. (Contributed by Thierry Arnoux, 21-Jun-2019.)
Hypotheses
Ref Expression
legval.p 𝑃 = (Base‘𝐺)
legval.d = (dist‘𝐺)
legval.i 𝐼 = (Itv‘𝐺)
legval.l = (≤G‘𝐺)
legval.g (𝜑𝐺 ∈ TarskiG)
Assertion
Ref Expression
legval (𝜑 = {⟨𝑒, 𝑓⟩ ∣ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))})
Distinct variable groups:   𝑒,𝑓,𝐺   𝑥,𝑦,𝑧,𝐼   𝑥,𝑒,𝑦,𝑧,𝑃,𝑓   ,𝑒,𝑓,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑒,𝑓)   𝐺(𝑥,𝑦,𝑧)   𝐼(𝑒,𝑓)   (𝑥,𝑦,𝑧,𝑒,𝑓)

Proof of Theorem legval
Dummy variables 𝑑 𝑔 𝑖 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 legval.l . 2 = (≤G‘𝐺)
2 legval.g . . 3 (𝜑𝐺 ∈ TarskiG)
3 elex 3185 . . 3 (𝐺 ∈ TarskiG → 𝐺 ∈ V)
4 legval.p . . . . . 6 𝑃 = (Base‘𝐺)
5 legval.d . . . . . 6 = (dist‘𝐺)
6 legval.i . . . . . 6 𝐼 = (Itv‘𝐺)
7 simp1 1054 . . . . . . . 8 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → 𝑝 = 𝑃)
87eqcomd 2616 . . . . . . 7 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → 𝑃 = 𝑝)
9 simp2 1055 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → 𝑑 = )
109eqcomd 2616 . . . . . . . . . . 11 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → = 𝑑)
1110oveqd 6566 . . . . . . . . . 10 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (𝑥 𝑦) = (𝑥𝑑𝑦))
1211eqeq2d 2620 . . . . . . . . 9 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (𝑓 = (𝑥 𝑦) ↔ 𝑓 = (𝑥𝑑𝑦)))
13 simp3 1056 . . . . . . . . . . . . . 14 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → 𝑖 = 𝐼)
1413eqcomd 2616 . . . . . . . . . . . . 13 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → 𝐼 = 𝑖)
1514oveqd 6566 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (𝑥𝐼𝑦) = (𝑥𝑖𝑦))
1615eleq2d 2673 . . . . . . . . . . 11 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (𝑧 ∈ (𝑥𝐼𝑦) ↔ 𝑧 ∈ (𝑥𝑖𝑦)))
1710oveqd 6566 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (𝑥 𝑧) = (𝑥𝑑𝑧))
1817eqeq2d 2620 . . . . . . . . . . 11 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (𝑒 = (𝑥 𝑧) ↔ 𝑒 = (𝑥𝑑𝑧)))
1916, 18anbi12d 743 . . . . . . . . . 10 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → ((𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)) ↔ (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧))))
208, 19rexeqbidv 3130 . . . . . . . . 9 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)) ↔ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧))))
2112, 20anbi12d 743 . . . . . . . 8 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → ((𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧))) ↔ (𝑓 = (𝑥𝑑𝑦) ∧ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧)))))
228, 21rexeqbidv 3130 . . . . . . 7 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (∃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧))) ↔ ∃𝑦𝑝 (𝑓 = (𝑥𝑑𝑦) ∧ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧)))))
238, 22rexeqbidv 3130 . . . . . 6 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧))) ↔ ∃𝑥𝑝𝑦𝑝 (𝑓 = (𝑥𝑑𝑦) ∧ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧)))))
244, 5, 6, 23sbcie3s 15745 . . . . 5 (𝑔 = 𝐺 → ([(Base‘𝑔) / 𝑝][(dist‘𝑔) / 𝑑][(Itv‘𝑔) / 𝑖]𝑥𝑝𝑦𝑝 (𝑓 = (𝑥𝑑𝑦) ∧ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧))) ↔ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))))
2524opabbidv 4648 . . . 4 (𝑔 = 𝐺 → {⟨𝑒, 𝑓⟩ ∣ [(Base‘𝑔) / 𝑝][(dist‘𝑔) / 𝑑][(Itv‘𝑔) / 𝑖]𝑥𝑝𝑦𝑝 (𝑓 = (𝑥𝑑𝑦) ∧ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧)))} = {⟨𝑒, 𝑓⟩ ∣ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))})
26 df-leg 25278 . . . 4 ≤G = (𝑔 ∈ V ↦ {⟨𝑒, 𝑓⟩ ∣ [(Base‘𝑔) / 𝑝][(dist‘𝑔) / 𝑑][(Itv‘𝑔) / 𝑖]𝑥𝑝𝑦𝑝 (𝑓 = (𝑥𝑑𝑦) ∧ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧)))})
27 fvex 6113 . . . . . . . . . 10 (dist‘𝐺) ∈ V
285, 27eqeltri 2684 . . . . . . . . 9 ∈ V
2928imaex 6996 . . . . . . . 8 ( “ (𝑃 × 𝑃)) ∈ V
30 p0ex 4779 . . . . . . . 8 {∅} ∈ V
3129, 30unex 6854 . . . . . . 7 (( “ (𝑃 × 𝑃)) ∪ {∅}) ∈ V
3231a1i 11 . . . . . 6 (⊤ → (( “ (𝑃 × 𝑃)) ∪ {∅}) ∈ V)
33 simprr 792 . . . . . . . . . . . . 13 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → 𝑒 = (𝑥 𝑑))
34 ovima0 6711 . . . . . . . . . . . . . 14 ((𝑥𝑃𝑑𝑃) → (𝑥 𝑑) ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
3534ad5ant14 1294 . . . . . . . . . . . . 13 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → (𝑥 𝑑) ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
3633, 35eqeltrd 2688 . . . . . . . . . . . 12 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → 𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
37 simpllr 795 . . . . . . . . . . . . . 14 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧))))
3837simpld 474 . . . . . . . . . . . . 13 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → 𝑓 = (𝑥 𝑦))
39 ovima0 6711 . . . . . . . . . . . . . 14 ((𝑥𝑃𝑦𝑃) → (𝑥 𝑦) ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
4039ad3antrrr 762 . . . . . . . . . . . . 13 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → (𝑥 𝑦) ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
4138, 40eqeltrd 2688 . . . . . . . . . . . 12 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
4236, 41jca 553 . . . . . . . . . . 11 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → (𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}) ∧ 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅})))
43 simprr 792 . . . . . . . . . . . 12 (((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) → ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))
44 eleq1 2676 . . . . . . . . . . . . . 14 (𝑧 = 𝑑 → (𝑧 ∈ (𝑥𝐼𝑦) ↔ 𝑑 ∈ (𝑥𝐼𝑦)))
45 oveq2 6557 . . . . . . . . . . . . . . 15 (𝑧 = 𝑑 → (𝑥 𝑧) = (𝑥 𝑑))
4645eqeq2d 2620 . . . . . . . . . . . . . 14 (𝑧 = 𝑑 → (𝑒 = (𝑥 𝑧) ↔ 𝑒 = (𝑥 𝑑)))
4744, 46anbi12d 743 . . . . . . . . . . . . 13 (𝑧 = 𝑑 → ((𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)) ↔ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))))
4847cbvrexv 3148 . . . . . . . . . . . 12 (∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)) ↔ ∃𝑑𝑃 (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑)))
4943, 48sylib 207 . . . . . . . . . . 11 (((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) → ∃𝑑𝑃 (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑)))
5042, 49r19.29a 3060 . . . . . . . . . 10 (((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) → (𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}) ∧ 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅})))
5150ex 449 . . . . . . . . 9 ((𝑥𝑃𝑦𝑃) → ((𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧))) → (𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}) ∧ 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))))
5251rexlimivv 3018 . . . . . . . 8 (∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧))) → (𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}) ∧ 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅})))
5352adantl 481 . . . . . . 7 ((⊤ ∧ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) → (𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}) ∧ 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅})))
5453simpld 474 . . . . . 6 ((⊤ ∧ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) → 𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
5553simprd 478 . . . . . 6 ((⊤ ∧ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) → 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
5632, 32, 54, 55opabex2 6997 . . . . 5 (⊤ → {⟨𝑒, 𝑓⟩ ∣ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))} ∈ V)
5756trud 1484 . . . 4 {⟨𝑒, 𝑓⟩ ∣ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))} ∈ V
5825, 26, 57fvmpt 6191 . . 3 (𝐺 ∈ V → (≤G‘𝐺) = {⟨𝑒, 𝑓⟩ ∣ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))})
592, 3, 583syl 18 . 2 (𝜑 → (≤G‘𝐺) = {⟨𝑒, 𝑓⟩ ∣ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))})
601, 59syl5eq 2656 1 (𝜑 = {⟨𝑒, 𝑓⟩ ∣ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   ∧ w3a 1031   = wceq 1475  ⊤wtru 1476   ∈ wcel 1977  ∃wrex 2897  Vcvv 3173  [wsbc 3402   ∪ cun 3538  ∅c0 3874  {csn 4125  {copab 4642   × cxp 5036   “ cima 5041  ‘cfv 5804  (class class class)co 6549  Basecbs 15695  distcds 15777  TarskiGcstrkg 25129  Itvcitv 25135  ≤Gcleg 25277 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fv 5812  df-ov 6552  df-leg 25278 This theorem is referenced by:  legov  25280
 Copyright terms: Public domain W3C validator