![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > tgellng | Structured version Visualization version GIF version |
Description: Property of lying on the line going through points 𝑋 and 𝑌. Definition 4.10 of [Schwabhauser] p. 36. We choose the notation 𝑍 ∈ (𝑋(LineG‘𝐺)𝑌) instead of "colinear" because LineG is a common structure slot for other axiomatizations of geometry. (Contributed by Thierry Arnoux, 28-Mar-2019.) |
Ref | Expression |
---|---|
tglngval.p | ⊢ 𝑃 = (Base‘𝐺) |
tglngval.l | ⊢ 𝐿 = (LineG‘𝐺) |
tglngval.i | ⊢ 𝐼 = (Itv‘𝐺) |
tglngval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
tglngval.x | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
tglngval.y | ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
tglngval.z | ⊢ (𝜑 → 𝑋 ≠ 𝑌) |
tgellng.z | ⊢ (𝜑 → 𝑍 ∈ 𝑃) |
Ref | Expression |
---|---|
tgellng | ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tgellng.z | . 2 ⊢ (𝜑 → 𝑍 ∈ 𝑃) | |
2 | tglngval.p | . . . . 5 ⊢ 𝑃 = (Base‘𝐺) | |
3 | tglngval.l | . . . . 5 ⊢ 𝐿 = (LineG‘𝐺) | |
4 | tglngval.i | . . . . 5 ⊢ 𝐼 = (Itv‘𝐺) | |
5 | tglngval.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
6 | tglngval.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
7 | tglngval.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
8 | tglngval.z | . . . . 5 ⊢ (𝜑 → 𝑋 ≠ 𝑌) | |
9 | 2, 3, 4, 5, 6, 7, 8 | tglngval 28577 | . . . 4 ⊢ (𝜑 → (𝑋𝐿𝑌) = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))}) |
10 | 9 | eleq2d 2830 | . . 3 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐿𝑌) ↔ 𝑍 ∈ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))})) |
11 | eleq1 2832 | . . . . 5 ⊢ (𝑧 = 𝑍 → (𝑧 ∈ (𝑋𝐼𝑌) ↔ 𝑍 ∈ (𝑋𝐼𝑌))) | |
12 | oveq1 7455 | . . . . . 6 ⊢ (𝑧 = 𝑍 → (𝑧𝐼𝑌) = (𝑍𝐼𝑌)) | |
13 | 12 | eleq2d 2830 | . . . . 5 ⊢ (𝑧 = 𝑍 → (𝑋 ∈ (𝑧𝐼𝑌) ↔ 𝑋 ∈ (𝑍𝐼𝑌))) |
14 | oveq2 7456 | . . . . . 6 ⊢ (𝑧 = 𝑍 → (𝑋𝐼𝑧) = (𝑋𝐼𝑍)) | |
15 | 14 | eleq2d 2830 | . . . . 5 ⊢ (𝑧 = 𝑍 → (𝑌 ∈ (𝑋𝐼𝑧) ↔ 𝑌 ∈ (𝑋𝐼𝑍))) |
16 | 11, 13, 15 | 3orbi123d 1435 | . . . 4 ⊢ (𝑧 = 𝑍 → ((𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧)) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)))) |
17 | 16 | elrab 3708 | . . 3 ⊢ (𝑍 ∈ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))} ↔ (𝑍 ∈ 𝑃 ∧ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)))) |
18 | 10, 17 | bitrdi 287 | . 2 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑍 ∈ 𝑃 ∧ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))) |
19 | 1, 18 | mpbirand 706 | 1 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ w3o 1086 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 {crab 3443 ‘cfv 6573 (class class class)co 7448 Basecbs 17258 TarskiGcstrkg 28453 Itvcitv 28459 LineGclng 28460 |
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-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 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-in 3983 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-opab 5229 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-iota 6525 df-fun 6575 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-trkg 28479 |
This theorem is referenced by: tgcolg 28580 hlln 28633 lnhl 28641 btwnlng1 28645 btwnlng2 28646 btwnlng3 28647 lncom 28648 lnrot1 28649 lnrot2 28650 tglineeltr 28657 colmid 28714 cgracol 28854 |
Copyright terms: Public domain | W3C validator |