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

Theorem istrkgb 28481
Description: Property of being a Tarski geometry - betweenness part. (Contributed by Thierry Arnoux, 14-Mar-2019.)
Hypotheses
Ref Expression
istrkg.p 𝑃 = (Base‘𝐺)
istrkg.d = (dist‘𝐺)
istrkg.i 𝐼 = (Itv‘𝐺)
Assertion
Ref Expression
istrkgb (𝐺 ∈ TarskiGB ↔ (𝐺 ∈ V ∧ (∀𝑥𝑃𝑦𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑃𝑦𝑃𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))))
Distinct variable groups:   𝑎,𝑏,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧,𝐼   𝑃,𝑎,𝑏,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   ,𝑎,𝑏,𝑢,𝑣,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐺(𝑥,𝑦,𝑧,𝑣,𝑢,𝑡,𝑠,𝑎,𝑏)   (𝑡,𝑠)

Proof of Theorem istrkgb
Dummy variables 𝑓 𝑖 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 istrkg.p . . 3 𝑃 = (Base‘𝐺)
2 istrkg.i . . 3 𝐼 = (Itv‘𝐺)
3 simpl 482 . . . . 5 ((𝑝 = 𝑃𝑖 = 𝐼) → 𝑝 = 𝑃)
4 simpr 484 . . . . . . . . 9 ((𝑝 = 𝑃𝑖 = 𝐼) → 𝑖 = 𝐼)
54oveqd 7465 . . . . . . . 8 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑥𝑖𝑥) = (𝑥𝐼𝑥))
65eleq2d 2830 . . . . . . 7 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑦 ∈ (𝑥𝑖𝑥) ↔ 𝑦 ∈ (𝑥𝐼𝑥)))
76imbi1d 341 . . . . . 6 ((𝑝 = 𝑃𝑖 = 𝐼) → ((𝑦 ∈ (𝑥𝑖𝑥) → 𝑥 = 𝑦) ↔ (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦)))
83, 7raleqbidv 3354 . . . . 5 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑦𝑝 (𝑦 ∈ (𝑥𝑖𝑥) → 𝑥 = 𝑦) ↔ ∀𝑦𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦)))
93, 8raleqbidv 3354 . . . 4 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑥𝑝𝑦𝑝 (𝑦 ∈ (𝑥𝑖𝑥) → 𝑥 = 𝑦) ↔ ∀𝑥𝑃𝑦𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦)))
104oveqd 7465 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑥𝑖𝑧) = (𝑥𝐼𝑧))
1110eleq2d 2830 . . . . . . . . . . 11 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑢 ∈ (𝑥𝑖𝑧) ↔ 𝑢 ∈ (𝑥𝐼𝑧)))
124oveqd 7465 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑦𝑖𝑧) = (𝑦𝐼𝑧))
1312eleq2d 2830 . . . . . . . . . . 11 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑣 ∈ (𝑦𝑖𝑧) ↔ 𝑣 ∈ (𝑦𝐼𝑧)))
1411, 13anbi12d 631 . . . . . . . . . 10 ((𝑝 = 𝑃𝑖 = 𝐼) → ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) ↔ (𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧))))
154oveqd 7465 . . . . . . . . . . . . 13 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑢𝑖𝑦) = (𝑢𝐼𝑦))
1615eleq2d 2830 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑎 ∈ (𝑢𝑖𝑦) ↔ 𝑎 ∈ (𝑢𝐼𝑦)))
174oveqd 7465 . . . . . . . . . . . . 13 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑣𝑖𝑥) = (𝑣𝐼𝑥))
1817eleq2d 2830 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑎 ∈ (𝑣𝑖𝑥) ↔ 𝑎 ∈ (𝑣𝐼𝑥)))
1916, 18anbi12d 631 . . . . . . . . . . 11 ((𝑝 = 𝑃𝑖 = 𝐼) → ((𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥)) ↔ (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))))
203, 19rexeqbidv 3355 . . . . . . . . . 10 ((𝑝 = 𝑃𝑖 = 𝐼) → (∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥)) ↔ ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))))
2114, 20imbi12d 344 . . . . . . . . 9 ((𝑝 = 𝑃𝑖 = 𝐼) → (((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ↔ ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥)))))
223, 21raleqbidv 3354 . . . . . . . 8 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ↔ ∀𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥)))))
233, 22raleqbidv 3354 . . . . . . 7 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ↔ ∀𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥)))))
243, 23raleqbidv 3354 . . . . . 6 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑧𝑝𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ↔ ∀𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥)))))
253, 24raleqbidv 3354 . . . . 5 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑦𝑝𝑧𝑝𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ↔ ∀𝑦𝑃𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥)))))
263, 25raleqbidv 3354 . . . 4 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑥𝑝𝑦𝑝𝑧𝑝𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ↔ ∀𝑥𝑃𝑦𝑃𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥)))))
273pweqd 4639 . . . . 5 ((𝑝 = 𝑃𝑖 = 𝐼) → 𝒫 𝑝 = 𝒫 𝑃)
284oveqd 7465 . . . . . . . . . 10 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑎𝑖𝑦) = (𝑎𝐼𝑦))
2928eleq2d 2830 . . . . . . . . 9 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑥 ∈ (𝑎𝑖𝑦) ↔ 𝑥 ∈ (𝑎𝐼𝑦)))
30292ralbidv 3227 . . . . . . . 8 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) ↔ ∀𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦)))
313, 30rexeqbidv 3355 . . . . . . 7 ((𝑝 = 𝑃𝑖 = 𝐼) → (∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) ↔ ∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦)))
324oveqd 7465 . . . . . . . . . 10 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑥𝑖𝑦) = (𝑥𝐼𝑦))
3332eleq2d 2830 . . . . . . . . 9 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑏 ∈ (𝑥𝑖𝑦) ↔ 𝑏 ∈ (𝑥𝐼𝑦)))
34332ralbidv 3227 . . . . . . . 8 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦) ↔ ∀𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))
353, 34rexeqbidv 3355 . . . . . . 7 ((𝑝 = 𝑃𝑖 = 𝐼) → (∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦) ↔ ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))
3631, 35imbi12d 344 . . . . . 6 ((𝑝 = 𝑃𝑖 = 𝐼) → ((∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) → ∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦)) ↔ (∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦))))
3727, 36raleqbidv 3354 . . . . 5 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑡 ∈ 𝒫 𝑝(∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) → ∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦)) ↔ ∀𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦))))
3827, 37raleqbidv 3354 . . . 4 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑠 ∈ 𝒫 𝑝𝑡 ∈ 𝒫 𝑝(∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) → ∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦)) ↔ ∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦))))
399, 26, 383anbi123d 1436 . . 3 ((𝑝 = 𝑃𝑖 = 𝐼) → ((∀𝑥𝑝𝑦𝑝 (𝑦 ∈ (𝑥𝑖𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑝𝑦𝑝𝑧𝑝𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑝𝑡 ∈ 𝒫 𝑝(∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) → ∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦))) ↔ (∀𝑥𝑃𝑦𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑃𝑦𝑃𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))))
401, 2, 39sbcie2s 17208 . 2 (𝑓 = 𝐺 → ([(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](∀𝑥𝑝𝑦𝑝 (𝑦 ∈ (𝑥𝑖𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑝𝑦𝑝𝑧𝑝𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑝𝑡 ∈ 𝒫 𝑝(∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) → ∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦))) ↔ (∀𝑥𝑃𝑦𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑃𝑦𝑃𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))))
41 df-trkgb 28475 . 2 TarskiGB = {𝑓[(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](∀𝑥𝑝𝑦𝑝 (𝑦 ∈ (𝑥𝑖𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑝𝑦𝑝𝑧𝑝𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑝𝑡 ∈ 𝒫 𝑝(∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) → ∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦)))}
4240, 41elab4g 3699 1 (𝐺 ∈ TarskiGB ↔ (𝐺 ∈ V ∧ (∀𝑥𝑃𝑦𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑃𝑦𝑃𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1537  wcel 2108  wral 3067  wrex 3076  Vcvv 3488  [wsbc 3804  𝒫 cpw 4622  cfv 6573  (class class class)co 7448  Basecbs 17258  distcds 17320  TarskiGBcstrkgb 28455  Itvcitv 28459
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-nul 5324
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-iota 6525  df-fv 6581  df-ov 7451  df-trkgb 28475
This theorem is referenced by:  axtgbtwnid  28492  axtgpasch  28493  axtgcont1  28494  f1otrg  28897  eengtrkg  29019
  Copyright terms: Public domain W3C validator