| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prlngmo2 | Structured version Visualization version GIF version | ||
| Description: Playfair's axiom, without the restriction that the point 𝑋 is outside of the line 𝐴. Theorem 12.11 of [Schwabhauser] p. 123. (Contributed by Thierry Arnoux, 13-Jul-2026.) |
| Ref | Expression |
|---|---|
| prlngmo2.p | ⊢ 𝑃 = (Base‘𝐺) |
| prlngmo2.l | ⊢ 𝐿 = (LineG‘𝐺) |
| prlngmo2.r | ⊢ ∥ = (parlnG‘𝐺) |
| prlngmo2.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| prlngmo2.a | ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) |
| prlngmo2.x | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
| prlngmo2.1 | ⊢ (𝜑 → 𝐺 ∈ TarskiGE) |
| Ref | Expression |
|---|---|
| prlngmo2 | ⊢ (𝜑 → ∃*𝑏 ∈ ran 𝐿(𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq2 2772 | . . . . . 6 ⊢ (𝑎 = 𝐴 → (𝑏 = 𝑎 ↔ 𝑏 = 𝐴)) | |
| 2 | 1 | imbi2d 343 | . . . . 5 ⊢ (𝑎 = 𝐴 → (((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝑎) ↔ ((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴))) |
| 3 | 2 | ralbidv 3185 | . . . 4 ⊢ (𝑎 = 𝐴 → (∀𝑏 ∈ ran 𝐿((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝑎) ↔ ∀𝑏 ∈ ran 𝐿((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴))) |
| 4 | prlngmo2.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) | |
| 5 | 4 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → 𝐴 ∈ ran 𝐿) |
| 6 | prlngmo2.l | . . . . . . . 8 ⊢ 𝐿 = (LineG‘𝐺) | |
| 7 | prlngmo2.r | . . . . . . . 8 ⊢ ∥ = (parlnG‘𝐺) | |
| 8 | prlngmo2.g | . . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 9 | 8 | ad5antr 747 | . . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝐺 ∈ TarskiG) |
| 10 | simpllr 788 | . . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝐴 ∥ 𝑏) | |
| 11 | simpr 490 | . . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → ¬ 𝑏 = 𝐴) | |
| 12 | 11 | neqned 2962 | . . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝑏 ≠ 𝐴) |
| 13 | 12 | necomd 3010 | . . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝐴 ≠ 𝑏) |
| 14 | 6, 7, 9, 10, 13 | prlngin0 29341 | . . . . . . 7 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → (𝐴 ∩ 𝑏) = ∅) |
| 15 | simp-5r 798 | . . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝑋 ∈ 𝐴) | |
| 16 | simplr 781 | . . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝑋 ∈ 𝑏) | |
| 17 | 15, 16 | elind 4146 | . . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝑋 ∈ (𝐴 ∩ 𝑏)) |
| 18 | 17 | ne0d 4288 | . . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → (𝐴 ∩ 𝑏) ≠ ∅) |
| 19 | 18 | neneqd 2960 | . . . . . . 7 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → ¬ (𝐴 ∩ 𝑏) = ∅) |
| 20 | 14, 19 | condan 830 | . . . . . 6 ⊢ (((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴) |
| 21 | 20 | expl 463 | . . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) → ((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴)) |
| 22 | 21 | ralrimiva 3154 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ∀𝑏 ∈ ran 𝐿((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴)) |
| 23 | 3, 5, 22 | rspcedvdw 3579 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ∃𝑎 ∈ ran 𝐿∀𝑏 ∈ ran 𝐿((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝑎)) |
| 24 | nfv 1947 | . . . 4 ⊢ Ⅎ𝑎(𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) | |
| 25 | 24 | rmo2i 3835 | . . 3 ⊢ (∃𝑎 ∈ ran 𝐿∀𝑏 ∈ ran 𝐿((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝑎) → ∃*𝑏 ∈ ran 𝐿(𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏)) |
| 26 | 23, 25 | syl 18 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ∃*𝑏 ∈ ran 𝐿(𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏)) |
| 27 | prlngmo2.p | . . 3 ⊢ 𝑃 = (Base‘𝐺) | |
| 28 | 8 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → 𝐺 ∈ TarskiG) |
| 29 | 4 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → 𝐴 ∈ ran 𝐿) |
| 30 | prlngmo2.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 31 | 30 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → 𝑋 ∈ 𝑃) |
| 32 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → ¬ 𝑋 ∈ 𝐴) | |
| 33 | 31, 32 | eldifd 3910 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → 𝑋 ∈ (𝑃 ∖ 𝐴)) |
| 34 | prlngmo2.1 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiGE) | |
| 35 | 34 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → 𝐺 ∈ TarskiGE) |
| 36 | 27, 6, 7, 28, 29, 33, 35 | prlngmo 29351 | . 2 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → ∃*𝑏 ∈ ran 𝐿(𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏)) |
| 37 | 26, 36 | pm2.61dan 825 | 1 ⊢ (𝜑 → ∃*𝑏 ∈ ran 𝐿(𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ∃wrex 3086 ∃*wrmo 3364 ∩ cin 3898 ∅c0 4279 class class class wbr 5103 ran crn 5649 ‘cfv 6528 Basecbs 17334 TarskiGcstrkg 28808 TarskiGEcstrkge 28813 LineGclng 28815 parlnGcprlng 29333 |
| 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 2213 ax-ext 2732 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 ax-cnex 11213 ax-resscn 11214 ax-1cn 11215 ax-icn 11216 ax-addcl 11217 ax-addrcl 11218 ax-mulcl 11219 ax-mulrcl 11220 ax-mulcom 11221 ax-addass 11222 ax-mulass 11223 ax-distr 11224 ax-i2m1 11225 ax-1ne0 11226 ax-1rid 11227 ax-rnegex 11228 ax-rrecex 11229 ax-cnre 11230 ax-pre-lttri 11231 ax-pre-lttrn 11232 ax-pre-ltadd 11233 ax-pre-mulgt0 11234 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6294 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-riota 7366 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8455 df-oadd 8459 df-er 8696 df-map 8828 df-pm 8829 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-dju 9939 df-card 9977 df-pnf 11302 df-mnf 11303 df-xr 11304 df-ltxr 11305 df-le 11306 df-sub 11500 df-neg 11501 df-nn 12291 df-2 12360 df-3 12361 df-n0 12562 df-xnn0 12635 df-z 12649 df-uz 12921 df-fz 13595 df-fzo 13743 df-hash 14428 df-word 14612 df-concat 14669 df-s1 14696 df-s2 14952 df-s3 14953 df-trkgc 28829 df-trkgb 28830 df-trkgcb 28831 df-trkge 28832 df-trkgld 28833 df-trkg 28834 df-cgrg 28893 df-leg 28965 df-hlg 28983 df-mir 29044 df-rag 29088 df-perpg 29090 df-hpg 29155 df-plng 29171 df-prlng 29334 |
| This theorem is used by: prlngeq 29354 prlngplngtr 29356 |
| Copyright terms: Public domain | W3C validator |