| 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 2775 | . . . . . 6 ⊢ (𝑎 = 𝐴 → (𝑏 = 𝑎 ↔ 𝑏 = 𝐴)) | |
| 2 | 1 | imbi2d 343 | . . . . 5 ⊢ (𝑎 = 𝐴 → (((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝑎) ↔ ((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴))) |
| 3 | 2 | ralbidv 3189 | . . . 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 2966 | . . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝑏 ≠ 𝐴) |
| 13 | 12 | necomd 3014 | . . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝐴 ≠ 𝑏) |
| 14 | 6, 7, 9, 10, 13 | prlngin0 29449 | . . . . . . 7 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → (𝐴 ∩ 𝑏) = ∅) |
| 15 | simp-5r 798 | . . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝑋 ∈ 𝐴) | |
| 16 | simplr 781 | . . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝑋 ∈ 𝑏) | |
| 17 | 15, 16 | elind 4100 | . . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝑋 ∈ (𝐴 ∩ 𝑏)) |
| 18 | 17 | ne0d 4291 | . . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → (𝐴 ∩ 𝑏) ≠ ∅) |
| 19 | 18 | neneqd 2964 | . . . . . . 7 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → ¬ (𝐴 ∩ 𝑏) = ∅) |
| 20 | 14, 19 | condan 830 | . . . . . 6 ⊢ (((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴) |
| 21 | 20 | expl 463 | . . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) → ((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴)) |
| 22 | 21 | ralrimiva 3158 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ∀𝑏 ∈ ran 𝐿((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴)) |
| 23 | 3, 5, 22 | rspcedvdw 3583 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ∃𝑎 ∈ ran 𝐿∀𝑏 ∈ ran 𝐿((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝑎)) |
| 24 | nfv 1949 | . . . 4 ⊢ Ⅎ𝑎(𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) | |
| 25 | 24 | rmo2i 3839 | . . 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 4053 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → 𝑋 ∈ (𝑃 ∖ 𝐴)) |
| 34 | prlngmo2.1 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiGE) | |
| 35 | 34 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → 𝐺 ∈ TarskiGE) |
| 36 | 27, 6, 7, 28, 29, 33, 35 | prlngmo 29459 | . 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 2147 ∀wral 3080 ∃wrex 3090 ∃*wrmo 3368 ∩ cin 4092 ∅c0 4281 class class class wbr 5106 ran crn 5656 ‘cfv 6555 Basecbs 17413 TarskiGcstrkg 28916 TarskiGEcstrkge 28921 LineGclng 28923 parlnGcprlng 29441 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-1st 8022 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-1o 8501 df-oadd 8505 df-er 8742 df-map 8874 df-pm 8875 df-en 8999 df-dom 9000 df-sdom 9001 df-fin 9002 df-dju 10006 df-card 10044 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-nn 12360 df-2 12429 df-3 12430 df-n0 12631 df-xnn0 12704 df-z 12718 df-uz 12990 df-fz 13664 df-fzo 13813 df-hash 14499 df-word 14683 df-concat 14740 df-s1 14767 df-s2 15024 df-s3 15025 df-trkgc 28937 df-trkgb 28938 df-trkgcb 28939 df-trkge 28940 df-trkgld 28941 df-trkg 28942 df-cgrg 29001 df-leg 29073 df-hlg 29091 df-mir 29152 df-rag 29196 df-perpg 29198 df-hpg 29263 df-plng 29279 df-prlng 29442 |
| This theorem is used by: prlngeq 29462 prlngplngtr 29464 |
| Copyright terms: Public domain | W3C validator |