| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prlngpln4 | Structured version Visualization version GIF version | ||
| Description: Building a parallel line conserves planes, i.e. given a line 𝐴 and a point 𝑋 not on 𝐴, the (unique) parallel 𝐵 to 𝐴 through 𝑋 lies completely within the plane defined by 𝐴 and 𝑋. Theorem 12.14 of [Schwabhauser] p. 124. (Contributed by Thierry Arnoux, 13-Jul-2026.) |
| Ref | Expression |
|---|---|
| prlngpln4.e | ⊢ 𝐸 = (hlG‘𝐺) |
| prlngpln4.p | ⊢ ∥ = (parlnG‘𝐺) |
| prlngpln4.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| prlngpln4.h | ⊢ (𝜑 → 𝐻 ∈ ran 𝐸) |
| prlngpln4.a | ⊢ (𝜑 → 𝐴 ⊆ 𝐻) |
| prlngpln4.1 | ⊢ (𝜑 → 𝐴 ∥ 𝐵) |
| prlngpln4.x | ⊢ (𝜑 → 𝑋 ∈ 𝐻) |
| prlngpln4.2 | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| prlngpln4 | ⊢ (𝜑 → 𝐵 ⊆ 𝐻) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 489 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵) | |
| 2 | prlngpln4.a | . . . 4 ⊢ (𝜑 → 𝐴 ⊆ 𝐻) | |
| 3 | 2 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 ⊆ 𝐻) |
| 4 | 1, 3 | eqsstrrd 3980 | . 2 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 ⊆ 𝐻) |
| 5 | eqid 2770 | . . . 4 ⊢ (LineG‘𝐺) = (LineG‘𝐺) | |
| 6 | prlngpln4.e | . . . 4 ⊢ 𝐸 = (hlG‘𝐺) | |
| 7 | prlngpln4.p | . . . 4 ⊢ ∥ = (parlnG‘𝐺) | |
| 8 | prlngpln4.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 9 | 8 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐺 ∈ TarskiG) |
| 10 | prlngpln4.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∥ 𝐵) | |
| 11 | 10 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐴 ∥ 𝐵) |
| 12 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐴 ≠ 𝐵) | |
| 13 | prlngpln4.2 | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 14 | 13 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝑋 ∈ 𝐵) |
| 15 | 5, 6, 7, 9, 11, 12, 14 | prlngpln3 29176 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐵 ⊆ (𝐴𝐸𝑋)) |
| 16 | eqid 2770 | . . . 4 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 17 | prlngpln4.h | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ ran 𝐸) | |
| 18 | 17 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐻 ∈ ran 𝐸) |
| 19 | 5, 7, 8, 10 | prlngrcl1 29169 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ran (LineG‘𝐺)) |
| 20 | 19 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐴 ∈ ran (LineG‘𝐺)) |
| 21 | prlngpln4.x | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐻) | |
| 22 | 21 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝑋 ∈ 𝐻) |
| 23 | 5, 7, 9, 11, 12 | prlngin0 29171 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → (𝐴 ∩ 𝐵) = ∅) |
| 24 | 23 | adantr 485 | . . . . . 6 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑋 ∈ 𝐴) → (𝐴 ∩ 𝐵) = ∅) |
| 25 | simpr 489 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ 𝐴) | |
| 26 | 13 | ad2antrr 738 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ 𝐵) |
| 27 | 25, 26 | elind 4161 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ (𝐴 ∩ 𝐵)) |
| 28 | 27 | ne0d 4303 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑋 ∈ 𝐴) → (𝐴 ∩ 𝐵) ≠ ∅) |
| 29 | 28 | neneqd 2970 | . . . . . 6 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑋 ∈ 𝐴) → ¬ (𝐴 ∩ 𝐵) = ∅) |
| 30 | 24, 29 | pm2.65da 828 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → ¬ 𝑋 ∈ 𝐴) |
| 31 | 22, 30 | eldifd 3924 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝑋 ∈ (𝐻 ∖ 𝐴)) |
| 32 | 2 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐴 ⊆ 𝐻) |
| 33 | 16, 5, 6, 9, 18, 20, 31, 32 | plng3p 29057 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐻 = (𝐴𝐸𝑋)) |
| 34 | 15, 33 | sseqtrrd 3982 | . 2 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐵 ⊆ 𝐻) |
| 35 | 4, 34 | pm2.61dane 3052 | 1 ⊢ (𝜑 → 𝐵 ⊆ 𝐻) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1568 ∈ wcel 2150 ≠ wne 2965 ∩ cin 3912 ⊆ wss 3913 ∅c0 4294 class class class wbr 5114 ran crn 5666 ‘cfv 6540 (class class class)co 7414 Basecbs 17272 TarskiGcstrkg 28676 LineGclng 28683 hlGcplng 29033 parlnGcprlng 29163 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2199 ax-12 2220 ax-ext 2742 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5340 ax-pr 5408 ax-un 7736 ax-cnex 11159 ax-resscn 11160 ax-1cn 11161 ax-icn 11162 ax-addcl 11163 ax-addrcl 11164 ax-mulcl 11165 ax-mulrcl 11166 ax-mulcom 11167 ax-addass 11168 ax-mulass 11169 ax-distr 11170 ax-i2m1 11171 ax-1ne0 11172 ax-1rid 11173 ax-rnegex 11174 ax-rrecex 11175 ax-cnre 11176 ax-pre-lttri 11177 ax-pre-lttrn 11178 ax-pre-ltadd 11179 ax-pre-mulgt0 11180 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2099 df-mo 2574 df-eu 2604 df-clab 2749 df-cleq 2762 df-clel 2845 df-nfc 2919 df-ne 2966 df-nel 3072 df-ral 3087 df-rex 3097 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3464 df-sbc 3753 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5560 df-eprel 5565 df-po 5573 df-so 5574 df-fr 5618 df-we 5620 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8456 df-oadd 8460 df-er 8697 df-map 8829 df-pm 8830 df-en 8947 df-dom 8948 df-sdom 8949 df-fin 8950 df-dju 9890 df-card 9928 df-pnf 11248 df-mnf 11249 df-xr 11250 df-ltxr 11251 df-le 11252 df-sub 11446 df-neg 11447 df-nn 12237 df-2 12306 df-3 12307 df-n0 12508 df-xnn0 12581 df-z 12595 df-uz 12866 df-fz 13539 df-fzo 13686 df-hash 14370 df-word 14554 df-concat 14611 df-s1 14637 df-s2 14888 df-s3 14889 df-trkgc 28697 df-trkgb 28698 df-trkgcb 28699 df-trkgld 28701 df-trkg 28702 df-cgrg 28760 df-leg 28832 df-hlg 28850 df-mir 28910 df-rag 28953 df-perpg 28955 df-hpg 29019 df-plng 29034 df-prlng 29164 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |