| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ragflat3 | Structured version Visualization version GIF version | ||
| Description: Right angle and colinearity. Theorem 8.9 of [Schwabhauser] p. 58. (Contributed by Thierry Arnoux, 4-Sep-2019.) |
| Ref | Expression |
|---|---|
| israg.p | ⊢ 𝑃 = (Base‘𝐺) |
| israg.d | ⊢ − = (dist‘𝐺) |
| israg.i | ⊢ 𝐼 = (Itv‘𝐺) |
| israg.l | ⊢ 𝐿 = (LineG‘𝐺) |
| israg.s | ⊢ 𝑆 = (pInvG‘𝐺) |
| israg.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| israg.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| israg.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| israg.c | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| ragflat3.1 | ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉 ∈ (∟G‘𝐺)) |
| ragflat3.2 | ⊢ (𝜑 → (𝐶 ∈ (𝐴𝐿𝐵) ∨ 𝐴 = 𝐵)) |
| Ref | Expression |
|---|---|
| ragflat3 | ⊢ (𝜑 → (𝐴 = 𝐵 ∨ 𝐶 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | israg.p | . . . 4 ⊢ 𝑃 = (Base‘𝐺) | |
| 2 | israg.d | . . . 4 ⊢ − = (dist‘𝐺) | |
| 3 | israg.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
| 4 | israg.l | . . . 4 ⊢ 𝐿 = (LineG‘𝐺) | |
| 5 | israg.s | . . . 4 ⊢ 𝑆 = (pInvG‘𝐺) | |
| 6 | israg.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 7 | 6 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐺 ∈ TarskiG) |
| 8 | israg.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 9 | 8 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐶 ∈ 𝑃) |
| 10 | israg.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 11 | 10 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐵 ∈ 𝑃) |
| 12 | israg.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 13 | 12 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐴 ∈ 𝑃) |
| 14 | ragflat3.1 | . . . . . 6 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉 ∈ (∟G‘𝐺)) | |
| 15 | 14 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 〈“𝐴𝐵𝐶”〉 ∈ (∟G‘𝐺)) |
| 16 | simpr 484 | . . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → ¬ 𝐴 = 𝐵) | |
| 17 | 16 | neqned 2940 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐴 ≠ 𝐵) |
| 18 | ragflat3.2 | . . . . . . 7 ⊢ (𝜑 → (𝐶 ∈ (𝐴𝐿𝐵) ∨ 𝐴 = 𝐵)) | |
| 19 | 18 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → (𝐶 ∈ (𝐴𝐿𝐵) ∨ 𝐴 = 𝐵)) |
| 20 | 1, 4, 3, 7, 13, 11, 9, 19 | colrot1 28641 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶)) |
| 21 | 1, 2, 3, 4, 5, 7, 13, 11, 9, 9, 15, 17, 20 | ragcol 28781 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 〈“𝐶𝐵𝐶”〉 ∈ (∟G‘𝐺)) |
| 22 | 1, 2, 3, 4, 5, 7, 9, 11, 13, 21 | ragtriva 28787 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐶 = 𝐵) |
| 23 | 22 | ex 412 | . 2 ⊢ (𝜑 → (¬ 𝐴 = 𝐵 → 𝐶 = 𝐵)) |
| 24 | 23 | orrd 864 | 1 ⊢ (𝜑 → (𝐴 = 𝐵 ∨ 𝐶 = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 848 = wceq 1542 ∈ wcel 2114 ‘cfv 6492 (class class class)co 7360 〈“cs3 14795 Basecbs 17170 distcds 17220 TarskiGcstrkg 28509 Itvcitv 28515 LineGclng 28516 pInvGcmir 28734 ∟Gcrag 28775 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-oadd 8402 df-er 8636 df-map 8768 df-pm 8769 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-dju 9816 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-3 12236 df-n0 12429 df-xnn0 12502 df-z 12516 df-uz 12780 df-fz 13453 df-fzo 13600 df-hash 14284 df-word 14467 df-concat 14524 df-s1 14550 df-s2 14801 df-s3 14802 df-trkgc 28530 df-trkgb 28531 df-trkgcb 28532 df-trkg 28535 df-cgrg 28593 df-mir 28735 df-rag 28776 |
| This theorem is referenced by: ragncol 28791 mideulem2 28816 opphllem 28817 |
| Copyright terms: Public domain | W3C validator |