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

Theorem istrkgb 28735
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 487 . . . . 5 ((𝑝 = 𝑃𝑖 = 𝐼) → 𝑝 = 𝑃)
4 simpr 489 . . . . . . . . 9 ((𝑝 = 𝑃𝑖 = 𝐼) → 𝑖 = 𝐼)
54oveqd 7429 . . . . . . . 8 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑥𝑖𝑥) = (𝑥𝐼𝑥))
65eleq2d 2848 . . . . . . 7 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑦 ∈ (𝑥𝑖𝑥) ↔ 𝑦 ∈ (𝑥𝐼𝑥)))
76imbi1d 344 . . . . . 6 ((𝑝 = 𝑃𝑖 = 𝐼) → ((𝑦 ∈ (𝑥𝑖𝑥) → 𝑥 = 𝑦) ↔ (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦)))
83, 7raleqbidv 3337 . . . . 5 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑦𝑝 (𝑦 ∈ (𝑥𝑖𝑥) → 𝑥 = 𝑦) ↔ ∀𝑦𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦)))
93, 8raleqbidv 3337 . . . 4 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑥𝑝𝑦𝑝 (𝑦 ∈ (𝑥𝑖𝑥) → 𝑥 = 𝑦) ↔ ∀𝑥𝑃𝑦𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦)))
104oveqd 7429 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑥𝑖𝑧) = (𝑥𝐼𝑧))
1110eleq2d 2848 . . . . . . . . . . 11 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑢 ∈ (𝑥𝑖𝑧) ↔ 𝑢 ∈ (𝑥𝐼𝑧)))
124oveqd 7429 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑦𝑖𝑧) = (𝑦𝐼𝑧))
1312eleq2d 2848 . . . . . . . . . . 11 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑣 ∈ (𝑦𝑖𝑧) ↔ 𝑣 ∈ (𝑦𝐼𝑧)))
1411, 13anbi12d 643 . . . . . . . . . 10 ((𝑝 = 𝑃𝑖 = 𝐼) → ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) ↔ (𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧))))
154oveqd 7429 . . . . . . . . . . . . 13 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑢𝑖𝑦) = (𝑢𝐼𝑦))
1615eleq2d 2848 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑎 ∈ (𝑢𝑖𝑦) ↔ 𝑎 ∈ (𝑢𝐼𝑦)))
174oveqd 7429 . . . . . . . . . . . . 13 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑣𝑖𝑥) = (𝑣𝐼𝑥))
1817eleq2d 2848 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑎 ∈ (𝑣𝑖𝑥) ↔ 𝑎 ∈ (𝑣𝐼𝑥)))
1916, 18anbi12d 643 . . . . . . . . . . 11 ((𝑝 = 𝑃𝑖 = 𝐼) → ((𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥)) ↔ (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))))
203, 19rexeqbidv 3338 . . . . . . . . . 10 ((𝑝 = 𝑃𝑖 = 𝐼) → (∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥)) ↔ ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))))
2114, 20imbi12d 347 . . . . . . . . 9 ((𝑝 = 𝑃𝑖 = 𝐼) → (((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ↔ ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥)))))
223, 21raleqbidv 3337 . . . . . . . 8 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ↔ ∀𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥)))))
233, 22raleqbidv 3337 . . . . . . 7 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ↔ ∀𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥)))))
243, 23raleqbidv 3337 . . . . . 6 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑧𝑝𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ↔ ∀𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥)))))
253, 24raleqbidv 3337 . . . . 5 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑦𝑝𝑧𝑝𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ↔ ∀𝑦𝑃𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥)))))
263, 25raleqbidv 3337 . . . 4 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑥𝑝𝑦𝑝𝑧𝑝𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ↔ ∀𝑥𝑃𝑦𝑃𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥)))))
273pweqd 4578 . . . . 5 ((𝑝 = 𝑃𝑖 = 𝐼) → 𝒫 𝑝 = 𝒫 𝑃)
284oveqd 7429 . . . . . . . . . 10 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑎𝑖𝑦) = (𝑎𝐼𝑦))
2928eleq2d 2848 . . . . . . . . 9 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑥 ∈ (𝑎𝑖𝑦) ↔ 𝑥 ∈ (𝑎𝐼𝑦)))
30292ralbidv 3228 . . . . . . . 8 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) ↔ ∀𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦)))
313, 30rexeqbidv 3338 . . . . . . 7 ((𝑝 = 𝑃𝑖 = 𝐼) → (∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) ↔ ∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦)))
324oveqd 7429 . . . . . . . . . 10 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑥𝑖𝑦) = (𝑥𝐼𝑦))
3332eleq2d 2848 . . . . . . . . 9 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑏 ∈ (𝑥𝑖𝑦) ↔ 𝑏 ∈ (𝑥𝐼𝑦)))
34332ralbidv 3228 . . . . . . . 8 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦) ↔ ∀𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))
353, 34rexeqbidv 3338 . . . . . . 7 ((𝑝 = 𝑃𝑖 = 𝐼) → (∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦) ↔ ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))
3631, 35imbi12d 347 . . . . . 6 ((𝑝 = 𝑃𝑖 = 𝐼) → ((∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) → ∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦)) ↔ (∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦))))
3727, 36raleqbidv 3337 . . . . 5 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑡 ∈ 𝒫 𝑝(∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) → ∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦)) ↔ ∀𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦))))
3827, 37raleqbidv 3337 . . . 4 ((𝑝 = 𝑃𝑖 = 𝐼) → (∀𝑠 ∈ 𝒫 𝑝𝑡 ∈ 𝒫 𝑝(∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) → ∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦)) ↔ ∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦))))
399, 26, 383anbi123d 1463 . . 3 ((𝑝 = 𝑃𝑖 = 𝐼) → ((∀𝑥𝑝𝑦𝑝 (𝑦 ∈ (𝑥𝑖𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑝𝑦𝑝𝑧𝑝𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑝𝑡 ∈ 𝒫 𝑝(∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) → ∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦))) ↔ (∀𝑥𝑃𝑦𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑃𝑦𝑃𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))))
401, 2, 39sbcie2s 17227 . 2 (𝑓 = 𝐺 → ([(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](∀𝑥𝑝𝑦𝑝 (𝑦 ∈ (𝑥𝑖𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑝𝑦𝑝𝑧𝑝𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑝𝑡 ∈ 𝒫 𝑝(∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) → ∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦))) ↔ (∀𝑥𝑃𝑦𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑃𝑦𝑃𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))))
41 df-trkgb 28729 . 2 TarskiGB = {𝑓[(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](∀𝑥𝑝𝑦𝑝 (𝑦 ∈ (𝑥𝑖𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑝𝑦𝑝𝑧𝑝𝑢𝑝𝑣𝑝 ((𝑢 ∈ (𝑥𝑖𝑧) ∧ 𝑣 ∈ (𝑦𝑖𝑧)) → ∃𝑎𝑝 (𝑎 ∈ (𝑢𝑖𝑦) ∧ 𝑎 ∈ (𝑣𝑖𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑝𝑡 ∈ 𝒫 𝑝(∃𝑎𝑝𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝑖𝑦) → ∃𝑏𝑝𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝑖𝑦)))}
4240, 41elab4g 3641 1 (𝐺 ∈ TarskiGB ↔ (𝐺 ∈ V ∧ (∀𝑥𝑃𝑦𝑃 (𝑦 ∈ (𝑥𝐼𝑥) → 𝑥 = 𝑦) ∧ ∀𝑥𝑃𝑦𝑃𝑧𝑃𝑢𝑃𝑣𝑃 ((𝑢 ∈ (𝑥𝐼𝑧) ∧ 𝑣 ∈ (𝑦𝐼𝑧)) → ∃𝑎𝑃 (𝑎 ∈ (𝑢𝐼𝑦) ∧ 𝑎 ∈ (𝑣𝐼𝑥))) ∧ ∀𝑠 ∈ 𝒫 𝑃𝑡 ∈ 𝒫 𝑃(∃𝑎𝑃𝑥𝑠𝑦𝑡 𝑥 ∈ (𝑎𝐼𝑦) → ∃𝑏𝑃𝑥𝑠𝑦𝑡 𝑏 ∈ (𝑥𝐼𝑦)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400  w3a 1102   = wceq 1569  wcel 2142  wral 3078  wrex 3088  Vcvv 3454  [wsbc 3743  𝒫 cpw 4561  cfv 6536  (class class class)co 7412  Basecbs 17275  distcds 17325  TarskiGBcstrkgb 28709  Itvcitv 28713
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-nul 5268
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-sbc 3744  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-iota 6492  df-fv 6544  df-ov 7415  df-trkgb 28729
This theorem is used by:  axtgbtwnid  28746  axtgpasch  28747  axtgcont1  28748  f1otrg  29231  eengtrkg  29347
  Copyright terms: Public domain W3C validator