| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tglineineq | Structured version Visualization version GIF version | ||
| Description: Two distinct lines intersect in at most one point, variation. Theorem 6.21 of [Schwabhauser] p. 46. (Contributed by Thierry Arnoux, 6-Aug-2019.) |
| Ref | Expression |
|---|---|
| tglineintmo.p | ⊢ 𝑃 = (Base‘𝐺) |
| tglineintmo.i | ⊢ 𝐼 = (Itv‘𝐺) |
| tglineintmo.l | ⊢ 𝐿 = (LineG‘𝐺) |
| tglineintmo.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| tglineintmo.a | ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) |
| tglineintmo.b | ⊢ (𝜑 → 𝐵 ∈ ran 𝐿) |
| tglineintmo.c | ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| tglineineq.x | ⊢ (𝜑 → 𝑋 ∈ (𝐴 ∩ 𝐵)) |
| tglineineq.y | ⊢ (𝜑 → 𝑌 ∈ (𝐴 ∩ 𝐵)) |
| Ref | Expression |
|---|---|
| tglineineq | ⊢ (𝜑 → 𝑋 = 𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tglineineq.x | . 2 ⊢ (𝜑 → 𝑋 ∈ (𝐴 ∩ 𝐵)) | |
| 2 | tglineineq.y | . 2 ⊢ (𝜑 → 𝑌 ∈ (𝐴 ∩ 𝐵)) | |
| 3 | tglineintmo.p | . . 3 ⊢ 𝑃 = (Base‘𝐺) | |
| 4 | tglineintmo.i | . . 3 ⊢ 𝐼 = (Itv‘𝐺) | |
| 5 | tglineintmo.l | . . 3 ⊢ 𝐿 = (LineG‘𝐺) | |
| 6 | tglineintmo.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 7 | tglineintmo.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) | |
| 8 | tglineintmo.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ ran 𝐿) | |
| 9 | tglineintmo.c | . . 3 ⊢ (𝜑 → 𝐴 ≠ 𝐵) | |
| 10 | 3, 4, 5, 6, 7, 8, 9 | tglineintmo 28710 | . 2 ⊢ (𝜑 → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) |
| 11 | elin 3906 | . . 3 ⊢ (𝑋 ∈ (𝐴 ∩ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) | |
| 12 | 1, 11 | sylib 218 | . 2 ⊢ (𝜑 → (𝑋 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) |
| 13 | elin 3906 | . . 3 ⊢ (𝑌 ∈ (𝐴 ∩ 𝐵) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵)) | |
| 14 | 2, 13 | sylib 218 | . 2 ⊢ (𝜑 → (𝑌 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵)) |
| 15 | eleq1 2825 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ 𝐴 ↔ 𝑋 ∈ 𝐴)) | |
| 16 | eleq1 2825 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ 𝐵 ↔ 𝑋 ∈ 𝐵)) | |
| 17 | 15, 16 | anbi12d 633 | . . 3 ⊢ (𝑥 = 𝑋 → ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵))) |
| 18 | eleq1 2825 | . . . 4 ⊢ (𝑥 = 𝑌 → (𝑥 ∈ 𝐴 ↔ 𝑌 ∈ 𝐴)) | |
| 19 | eleq1 2825 | . . . 4 ⊢ (𝑥 = 𝑌 → (𝑥 ∈ 𝐵 ↔ 𝑌 ∈ 𝐵)) | |
| 20 | 18, 19 | anbi12d 633 | . . 3 ⊢ (𝑥 = 𝑌 → ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵))) |
| 21 | 17, 20 | moi 3665 | . 2 ⊢ (((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ 𝑌 ∈ (𝐴 ∩ 𝐵)) ∧ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ ((𝑋 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵))) → 𝑋 = 𝑌) |
| 22 | 1, 2, 10, 12, 14, 21 | syl212anc 1383 | 1 ⊢ (𝜑 → 𝑋 = 𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∃*wmo 2538 ≠ wne 2933 ∩ cin 3889 ran crn 5632 ‘cfv 6499 Basecbs 17179 TarskiGcstrkg 28495 Itvcitv 28501 LineGclng 28502 |
| 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 5213 ax-sep 5232 ax-nul 5242 ax-pow 5308 ax-pr 5376 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| 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-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 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6266 df-ord 6327 df-on 6328 df-lim 6329 df-suc 6330 df-iota 6455 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-oadd 8409 df-er 8643 df-pm 8776 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-dju 9825 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-xnn0 12511 df-z 12525 df-uz 12789 df-fz 13462 df-fzo 13609 df-hash 14293 df-word 14476 df-concat 14533 df-s1 14559 df-s2 14810 df-s3 14811 df-trkgc 28516 df-trkgb 28517 df-trkgcb 28518 df-trkg 28521 df-cgrg 28579 |
| This theorem is referenced by: isperp2 28783 footne 28791 lnopp2hpgb 28831 colopp 28837 lmieu 28852 |
| Copyright terms: Public domain | W3C validator |