| 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 490 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵) | |
| 2 | prlngpln4.a | . . . 4 ⊢ (𝜑 → 𝐴 ⊆ 𝐻) | |
| 3 | 2 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 ⊆ 𝐻) |
| 4 | 1, 3 | eqsstrrd 3969 | . 2 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 ⊆ 𝐻) |
| 5 | eqid 2762 | . . . 4 ⊢ (LineG‘𝐺) = (LineG‘𝐺) | |
| 6 | prlngpln4.e | . . . 4 ⊢ 𝐸 = (hlG‘𝐺) | |
| 7 | prlngpln4.p | . . . 4 ⊢ ∥ = (parlnG‘𝐺) | |
| 8 | prlngpln4.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 9 | 8 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐺 ∈ TarskiG) |
| 10 | prlngpln4.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∥ 𝐵) | |
| 11 | 10 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐴 ∥ 𝐵) |
| 12 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐴 ≠ 𝐵) | |
| 13 | prlngpln4.2 | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 14 | 13 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝑋 ∈ 𝐵) |
| 15 | 5, 6, 7, 9, 11, 12, 14 | prlngpln3 29292 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐵 ⊆ (𝐴𝐸𝑋)) |
| 16 | eqid 2762 | . . . 4 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 17 | prlngpln4.h | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ ran 𝐸) | |
| 18 | 17 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐻 ∈ ran 𝐸) |
| 19 | 5, 7, 8, 10 | prlngrcl1 29285 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ran (LineG‘𝐺)) |
| 20 | 19 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐴 ∈ ran (LineG‘𝐺)) |
| 21 | prlngpln4.x | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐻) | |
| 22 | 21 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝑋 ∈ 𝐻) |
| 23 | 5, 7, 9, 11, 12 | prlngin0 29287 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → (𝐴 ∩ 𝐵) = ∅) |
| 24 | 23 | adantr 486 | . . . . . 6 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑋 ∈ 𝐴) → (𝐴 ∩ 𝐵) = ∅) |
| 25 | simpr 490 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ 𝐴) | |
| 26 | 13 | ad2antrr 739 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ 𝐵) |
| 27 | 25, 26 | elind 4149 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ (𝐴 ∩ 𝐵)) |
| 28 | 27 | ne0d 4291 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑋 ∈ 𝐴) → (𝐴 ∩ 𝐵) ≠ ∅) |
| 29 | 28 | neneqd 2962 | . . . . . 6 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑋 ∈ 𝐴) → ¬ (𝐴 ∩ 𝐵) = ∅) |
| 30 | 24, 29 | pm2.65da 829 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → ¬ 𝑋 ∈ 𝐴) |
| 31 | 22, 30 | eldifd 3913 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝑋 ∈ (𝐻 ∖ 𝐴)) |
| 32 | 2 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐴 ⊆ 𝐻) |
| 33 | 16, 5, 6, 9, 18, 20, 31, 32 | plng3p 29152 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐻 = (𝐴𝐸𝑋)) |
| 34 | 15, 33 | sseqtrrd 3971 | . 2 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐵 ⊆ 𝐻) |
| 35 | 4, 34 | pm2.61dane 3044 | 1 ⊢ (𝜑 → 𝐵 ⊆ 𝐻) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 ∩ cin 3901 ⊆ wss 3902 ∅c0 4282 class class class wbr 5107 ran crn 5660 ‘cfv 6537 (class class class)co 7416 Basecbs 17305 TarskiGcstrkg 28766 LineGclng 28773 hlGcplng 29128 parlnGcprlng 29279 |
| 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-rmo 3367 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-map 8831 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-trkgld 28791 df-trkg 28792 df-cgrg 28851 df-leg 28923 df-hlg 28941 df-mir 29002 df-rag 29046 df-perpg 29048 df-hpg 29113 df-plng 29129 df-prlng 29280 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |