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

Theorem legval 26297
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 3510 . . 3 (𝐺 ∈ TarskiG → 𝐺 ∈ V)
4 legval.p . . . . . 6 𝑃 = (Base‘𝐺)
5 legval.d . . . . . 6 = (dist‘𝐺)
6 legval.i . . . . . 6 𝐼 = (Itv‘𝐺)
7 simp1 1128 . . . . . . . 8 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → 𝑝 = 𝑃)
87eqcomd 2824 . . . . . . 7 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → 𝑃 = 𝑝)
9 simp2 1129 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → 𝑑 = )
109eqcomd 2824 . . . . . . . . . . 11 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → = 𝑑)
1110oveqd 7162 . . . . . . . . . 10 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (𝑥 𝑦) = (𝑥𝑑𝑦))
1211eqeq2d 2829 . . . . . . . . 9 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (𝑓 = (𝑥 𝑦) ↔ 𝑓 = (𝑥𝑑𝑦)))
13 simp3 1130 . . . . . . . . . . . . . 14 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → 𝑖 = 𝐼)
1413eqcomd 2824 . . . . . . . . . . . . 13 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → 𝐼 = 𝑖)
1514oveqd 7162 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (𝑥𝐼𝑦) = (𝑥𝑖𝑦))
1615eleq2d 2895 . . . . . . . . . . 11 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (𝑧 ∈ (𝑥𝐼𝑦) ↔ 𝑧 ∈ (𝑥𝑖𝑦)))
1710oveqd 7162 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (𝑥 𝑧) = (𝑥𝑑𝑧))
1817eqeq2d 2829 . . . . . . . . . . 11 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (𝑒 = (𝑥 𝑧) ↔ 𝑒 = (𝑥𝑑𝑧)))
1916, 18anbi12d 630 . . . . . . . . . 10 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → ((𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)) ↔ (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧))))
208, 19rexeqbidv 3400 . . . . . . . . 9 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)) ↔ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧))))
2112, 20anbi12d 630 . . . . . . . 8 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → ((𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧))) ↔ (𝑓 = (𝑥𝑑𝑦) ∧ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧)))))
228, 21rexeqbidv 3400 . . . . . . 7 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (∃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧))) ↔ ∃𝑦𝑝 (𝑓 = (𝑥𝑑𝑦) ∧ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧)))))
238, 22rexeqbidv 3400 . . . . . 6 ((𝑝 = 𝑃𝑑 = 𝑖 = 𝐼) → (∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧))) ↔ ∃𝑥𝑝𝑦𝑝 (𝑓 = (𝑥𝑑𝑦) ∧ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧)))))
244, 5, 6, 23sbcie3s 16529 . . . . 5 (𝑔 = 𝐺 → ([(Base‘𝑔) / 𝑝][(dist‘𝑔) / 𝑑][(Itv‘𝑔) / 𝑖]𝑥𝑝𝑦𝑝 (𝑓 = (𝑥𝑑𝑦) ∧ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧))) ↔ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))))
2524opabbidv 5123 . . . 4 (𝑔 = 𝐺 → {⟨𝑒, 𝑓⟩ ∣ [(Base‘𝑔) / 𝑝][(dist‘𝑔) / 𝑑][(Itv‘𝑔) / 𝑖]𝑥𝑝𝑦𝑝 (𝑓 = (𝑥𝑑𝑦) ∧ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧)))} = {⟨𝑒, 𝑓⟩ ∣ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))})
26 df-leg 26296 . . . 4 ≤G = (𝑔 ∈ V ↦ {⟨𝑒, 𝑓⟩ ∣ [(Base‘𝑔) / 𝑝][(dist‘𝑔) / 𝑑][(Itv‘𝑔) / 𝑖]𝑥𝑝𝑦𝑝 (𝑓 = (𝑥𝑑𝑦) ∧ ∃𝑧𝑝 (𝑧 ∈ (𝑥𝑖𝑦) ∧ 𝑒 = (𝑥𝑑𝑧)))})
275fvexi 6677 . . . . . . . . 9 ∈ V
2827imaex 7610 . . . . . . . 8 ( “ (𝑃 × 𝑃)) ∈ V
29 p0ex 5275 . . . . . . . 8 {∅} ∈ V
3028, 29unex 7458 . . . . . . 7 (( “ (𝑃 × 𝑃)) ∪ {∅}) ∈ V
3130a1i 11 . . . . . 6 (⊤ → (( “ (𝑃 × 𝑃)) ∪ {∅}) ∈ V)
32 simprr 769 . . . . . . . . . . . . 13 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → 𝑒 = (𝑥 𝑑))
33 ovima0 7316 . . . . . . . . . . . . . 14 ((𝑥𝑃𝑑𝑃) → (𝑥 𝑑) ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
3433ad5ant14 754 . . . . . . . . . . . . 13 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → (𝑥 𝑑) ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
3532, 34eqeltrd 2910 . . . . . . . . . . . 12 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → 𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
36 simpllr 772 . . . . . . . . . . . . . 14 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧))))
3736simpld 495 . . . . . . . . . . . . 13 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → 𝑓 = (𝑥 𝑦))
38 ovima0 7316 . . . . . . . . . . . . . 14 ((𝑥𝑃𝑦𝑃) → (𝑥 𝑦) ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
3938ad3antrrr 726 . . . . . . . . . . . . 13 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → (𝑥 𝑦) ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
4037, 39eqeltrd 2910 . . . . . . . . . . . 12 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
4135, 40jca 512 . . . . . . . . . . 11 (((((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) ∧ 𝑑𝑃) ∧ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))) → (𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}) ∧ 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅})))
42 simprr 769 . . . . . . . . . . . 12 (((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) → ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))
43 eleq1w 2892 . . . . . . . . . . . . . 14 (𝑧 = 𝑑 → (𝑧 ∈ (𝑥𝐼𝑦) ↔ 𝑑 ∈ (𝑥𝐼𝑦)))
44 oveq2 7153 . . . . . . . . . . . . . . 15 (𝑧 = 𝑑 → (𝑥 𝑧) = (𝑥 𝑑))
4544eqeq2d 2829 . . . . . . . . . . . . . 14 (𝑧 = 𝑑 → (𝑒 = (𝑥 𝑧) ↔ 𝑒 = (𝑥 𝑑)))
4643, 45anbi12d 630 . . . . . . . . . . . . 13 (𝑧 = 𝑑 → ((𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)) ↔ (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑))))
4746cbvrexvw 3448 . . . . . . . . . . . 12 (∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)) ↔ ∃𝑑𝑃 (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑)))
4842, 47sylib 219 . . . . . . . . . . 11 (((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) → ∃𝑑𝑃 (𝑑 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑑)))
4941, 48r19.29a 3286 . . . . . . . . . 10 (((𝑥𝑃𝑦𝑃) ∧ (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) → (𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}) ∧ 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅})))
5049ex 413 . . . . . . . . 9 ((𝑥𝑃𝑦𝑃) → ((𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧))) → (𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}) ∧ 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))))
5150rexlimivv 3289 . . . . . . . 8 (∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧))) → (𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}) ∧ 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅})))
5251adantl 482 . . . . . . 7 ((⊤ ∧ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) → (𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}) ∧ 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅})))
5352simpld 495 . . . . . 6 ((⊤ ∧ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) → 𝑒 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
5452simprd 496 . . . . . 6 ((⊤ ∧ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))) → 𝑓 ∈ (( “ (𝑃 × 𝑃)) ∪ {∅}))
5531, 31, 53, 54opabex2 7744 . . . . 5 (⊤ → {⟨𝑒, 𝑓⟩ ∣ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))} ∈ V)
5655mptru 1535 . . . 4 {⟨𝑒, 𝑓⟩ ∣ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))} ∈ V
5725, 26, 56fvmpt 6761 . . 3 (𝐺 ∈ V → (≤G‘𝐺) = {⟨𝑒, 𝑓⟩ ∣ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))})
582, 3, 573syl 18 . 2 (𝜑 → (≤G‘𝐺) = {⟨𝑒, 𝑓⟩ ∣ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))})
591, 58syl5eq 2865 1 (𝜑 = {⟨𝑒, 𝑓⟩ ∣ ∃𝑥𝑃𝑦𝑃 (𝑓 = (𝑥 𝑦) ∧ ∃𝑧𝑃 (𝑧 ∈ (𝑥𝐼𝑦) ∧ 𝑒 = (𝑥 𝑧)))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1079   = wceq 1528  wtru 1529  wcel 2105  wrex 3136  Vcvv 3492  [wsbc 3769  cun 3931  c0 4288  {csn 4557  {copab 5119   × cxp 5546  cima 5551  cfv 6348  (class class class)co 7145  Basecbs 16471  distcds 16562  TarskiGcstrkg 26143  Itvcitv 26149  ≤Gcleg 26295
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7450
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-ral 3140  df-rex 3141  df-rab 3144  df-v 3494  df-sbc 3770  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-pw 4537  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4831  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fv 6356  df-ov 7148  df-leg 26296
This theorem is referenced by:  legov  26298
  Copyright terms: Public domain W3C validator