| 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 28987 | . 2 ⊢ (𝜑 → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) |
| 11 | elin 3918 | . . 3 ⊢ (𝑋 ∈ (𝐴 ∩ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) | |
| 12 | 1, 11 | sylib 221 | . 2 ⊢ (𝜑 → (𝑋 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) |
| 13 | elin 3918 | . . 3 ⊢ (𝑌 ∈ (𝐴 ∩ 𝐵) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵)) | |
| 14 | 2, 13 | sylib 221 | . 2 ⊢ (𝜑 → (𝑌 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵)) |
| 15 | eleq1 2850 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ 𝐴 ↔ 𝑋 ∈ 𝐴)) | |
| 16 | eleq1 2850 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ 𝐵 ↔ 𝑋 ∈ 𝐵)) | |
| 17 | 15, 16 | anbi12d 644 | . . 3 ⊢ (𝑥 = 𝑋 → ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵))) |
| 18 | eleq1 2850 | . . . 4 ⊢ (𝑥 = 𝑌 → (𝑥 ∈ 𝐴 ↔ 𝑌 ∈ 𝐴)) | |
| 19 | eleq1 2850 | . . . 4 ⊢ (𝑥 = 𝑌 → (𝑥 ∈ 𝐵 ↔ 𝑌 ∈ 𝐵)) | |
| 20 | 18, 19 | anbi12d 644 | . . 3 ⊢ (𝑥 = 𝑌 → ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵))) |
| 21 | 17, 20 | moi 3679 | . 2 ⊢ (((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ 𝑌 ∈ (𝐴 ∩ 𝐵)) ∧ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ ((𝑋 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑌 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵))) → 𝑋 = 𝑌) |
| 22 | 1, 2, 10, 12, 14, 21 | syl212anc 1407 | 1 ⊢ (𝜑 → 𝑋 = 𝑌) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃*wmo 2564 ≠ wne 2957 ∩ cin 3901 ran crn 5660 ‘cfv 6537 Basecbs 17305 TarskiGcstrkg 28766 Itvcitv 28772 LineGclng 28773 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-oadd 8462 df-er 8699 df-pm 8832 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-dju 9909 df-card 9947 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-2 12330 df-3 12331 df-n0 12532 df-xnn0 12605 df-z 12619 df-uz 12891 df-fz 13564 df-fzo 13712 df-hash 14397 df-word 14581 df-concat 14638 df-s1 14665 df-s2 14921 df-s3 14922 df-trkgc 28787 df-trkgb 28788 df-trkgcb 28789 df-trkg 28792 df-cgrg 28851 |
| This theorem is used by: tglineinsn 28989 tglnpt4 29000 isperp2 29067 footne 29075 lnopp2hpgb 29118 colopp 29124 plngrotlem1 29142 plngrotlem2 29143 lnssplng 29147 lmieu 29166 tgaaddcpbllem1 29226 tgaaddcpbl 29229 prlngsymquadlem 29306 |
| Copyright terms: Public domain | W3C validator |