| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prlnginn0 | Structured version Visualization version GIF version | ||
| Description: A line 𝐶 intersecting another line 𝐴 also intersects any line 𝐵 parallel to 𝐴. Theorem 12.16 of [Schwabhauser] p. 125. (Contributed by Thierry Arnoux, 13-Jul-2026.) |
| Ref | Expression |
|---|---|
| prlnginn0.l | ⊢ 𝐿 = (LineG‘𝐺) |
| prlnginn0.e | ⊢ 𝐸 = (hlG‘𝐺) |
| prlnginn0.p | ⊢ ∥ = (parlnG‘𝐺) |
| prlnginn0.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| prlnginn0.1 | ⊢ (𝜑 → 𝐺 ∈ TarskiGE) |
| prlnginn0.h | ⊢ (𝜑 → 𝐻 ∈ ran 𝐸) |
| prlnginn0.c | ⊢ (𝜑 → 𝐶 ∈ ran 𝐿) |
| prlnginn0.2 | ⊢ (𝜑 → (𝐴 ∩ 𝐶) ≠ ∅) |
| prlnginn0.3 | ⊢ (𝜑 → 𝐴 ≠ 𝐶) |
| prlnginn0.4 | ⊢ (𝜑 → 𝐴 ∥ 𝐵) |
| prlnginn0.5 | ⊢ (𝜑 → 𝐴 ⊆ 𝐻) |
| prlnginn0.6 | ⊢ (𝜑 → 𝐵 ⊆ 𝐻) |
| prlnginn0.7 | ⊢ (𝜑 → 𝐶 ⊆ 𝐻) |
| Ref | Expression |
|---|---|
| prlnginn0 | ⊢ (𝜑 → (𝐵 ∩ 𝐶) ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prlnginn0.2 | . . . . . 6 ⊢ (𝜑 → (𝐴 ∩ 𝐶) ≠ ∅) | |
| 2 | 1 | neneqd 2967 | . . . . 5 ⊢ (𝜑 → ¬ (𝐴 ∩ 𝐶) = ∅) |
| 3 | prlnginn0.l | . . . . . 6 ⊢ 𝐿 = (LineG‘𝐺) | |
| 4 | prlnginn0.p | . . . . . 6 ⊢ ∥ = (parlnG‘𝐺) | |
| 5 | prlnginn0.g | . . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 6 | 5 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∥ 𝐶) → 𝐺 ∈ TarskiG) |
| 7 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∥ 𝐶) → 𝐴 ∥ 𝐶) | |
| 8 | prlnginn0.3 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ≠ 𝐶) | |
| 9 | 8 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∥ 𝐶) → 𝐴 ≠ 𝐶) |
| 10 | 3, 4, 6, 7, 9 | prlngin0 29481 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∥ 𝐶) → (𝐴 ∩ 𝐶) = ∅) |
| 11 | 2, 10 | mtand 828 | . . . 4 ⊢ (𝜑 → ¬ 𝐴 ∥ 𝐶) |
| 12 | prlnginn0.e | . . . . 5 ⊢ 𝐸 = (hlG‘𝐺) | |
| 13 | 5 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∥ 𝐶) → 𝐺 ∈ TarskiG) |
| 14 | prlnginn0.h | . . . . . 6 ⊢ (𝜑 → 𝐻 ∈ ran 𝐸) | |
| 15 | 14 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∥ 𝐶) → 𝐻 ∈ ran 𝐸) |
| 16 | prlnginn0.5 | . . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ 𝐻) | |
| 17 | 16 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∥ 𝐶) → 𝐴 ⊆ 𝐻) |
| 18 | prlnginn0.4 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∥ 𝐵) | |
| 19 | 18 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∥ 𝐶) → 𝐴 ∥ 𝐵) |
| 20 | prlnginn0.1 | . . . . . 6 ⊢ (𝜑 → 𝐺 ∈ TarskiGE) | |
| 21 | 20 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∥ 𝐶) → 𝐺 ∈ TarskiGE) |
| 22 | prlnginn0.7 | . . . . . 6 ⊢ (𝜑 → 𝐶 ⊆ 𝐻) | |
| 23 | 22 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∥ 𝐶) → 𝐶 ⊆ 𝐻) |
| 24 | simpr 490 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∥ 𝐶) → 𝐵 ∥ 𝐶) | |
| 25 | 12, 4, 13, 15, 17, 19, 21, 23, 24 | prlngplngtr 29496 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ∥ 𝐶) → 𝐴 ∥ 𝐶) |
| 26 | 11, 25 | mtand 828 | . . 3 ⊢ (𝜑 → ¬ 𝐵 ∥ 𝐶) |
| 27 | 5 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝐵 ∩ 𝐶) = ∅) → 𝐺 ∈ TarskiG) |
| 28 | 3, 4, 5, 18 | prlngrcl2 29480 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ ran 𝐿) |
| 29 | 28 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝐵 ∩ 𝐶) = ∅) → 𝐵 ∈ ran 𝐿) |
| 30 | prlnginn0.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ran 𝐿) | |
| 31 | 30 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝐵 ∩ 𝐶) = ∅) → 𝐶 ∈ ran 𝐿) |
| 32 | 14 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝐵 ∩ 𝐶) = ∅) → 𝐻 ∈ ran 𝐸) |
| 33 | prlnginn0.6 | . . . . 5 ⊢ (𝜑 → 𝐵 ⊆ 𝐻) | |
| 34 | 33 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝐵 ∩ 𝐶) = ∅) → 𝐵 ⊆ 𝐻) |
| 35 | 22 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝐵 ∩ 𝐶) = ∅) → 𝐶 ⊆ 𝐻) |
| 36 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ (𝐵 ∩ 𝐶) = ∅) → (𝐵 ∩ 𝐶) = ∅) | |
| 37 | 3, 12, 4, 27, 29, 31, 32, 34, 35, 36 | prlngd 29476 | . . 3 ⊢ ((𝜑 ∧ (𝐵 ∩ 𝐶) = ∅) → 𝐵 ∥ 𝐶) |
| 38 | 26, 37 | mtand 828 | . 2 ⊢ (𝜑 → ¬ (𝐵 ∩ 𝐶) = ∅) |
| 39 | 38 | neqned 2969 | 1 ⊢ (𝜑 → (𝐵 ∩ 𝐶) ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ≠ wne 2962 ⊆ wss 3899 ∩ cin 4091 ∅c0 4280 class class class wbr 5107 ran crn 5658 ‘cfv 6565 TarskiGcstrkg 28948 TarskiGEcstrkge 28953 LineGclng 28955 hlGcplng 29310 parlnGcprlng 29473 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-oadd 8517 df-er 8754 df-map 8886 df-pm 8887 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-dju 10018 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-3 12445 df-n0 12646 df-xnn0 12719 df-z 12733 df-uz 13005 df-fz 13679 df-fzo 13828 df-hash 14515 df-word 14699 df-concat 14756 df-s1 14783 df-s2 15040 df-s3 15041 df-trkgc 28969 df-trkgb 28970 df-trkgcb 28971 df-trkge 28972 df-trkgld 28973 df-trkg 28974 df-cgrg 29033 df-leg 29105 df-hlg 29123 df-mir 29184 df-rag 29228 df-perpg 29230 df-hpg 29295 df-plng 29311 df-prlng 29474 |
| This theorem is used by: quadcgrprlng 29503 |
| Copyright terms: Public domain | W3C validator |