| 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 2774 | . . . . . 6 ⊢ (𝑎 = 𝐴 → (𝑏 = 𝑎 ↔ 𝑏 = 𝐴)) | |
| 2 | 1 | imbi2d 343 | . . . . 5 ⊢ (𝑎 = 𝐴 → (((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝑎) ↔ ((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴))) |
| 3 | 2 | ralbidv 3187 | . . . 4 ⊢ (𝑎 = 𝐴 → (∀𝑏 ∈ ran 𝐿((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝑎) ↔ ∀𝑏 ∈ ran 𝐿((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴))) |
| 4 | prlngmo2.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) | |
| 5 | 4 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → 𝐴 ∈ ran 𝐿) |
| 6 | prlngmo2.l | . . . . . . . 8 ⊢ 𝐿 = (LineG‘𝐺) | |
| 7 | prlngmo2.r | . . . . . . . 8 ⊢ ∥ = (parlnG‘𝐺) | |
| 8 | prlngmo2.g | . . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 9 | 8 | ad5antr 746 | . . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝐺 ∈ TarskiG) |
| 10 | simpllr 787 | . . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝐴 ∥ 𝑏) | |
| 11 | simpr 489 | . . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → ¬ 𝑏 = 𝐴) | |
| 12 | 11 | neqned 2964 | . . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝑏 ≠ 𝐴) |
| 13 | 12 | necomd 3012 | . . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝐴 ≠ 𝑏) |
| 14 | 6, 7, 9, 10, 13 | prlngin0 29205 | . . . . . . 7 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → (𝐴 ∩ 𝑏) = ∅) |
| 15 | simp-5r 797 | . . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝑋 ∈ 𝐴) | |
| 16 | simplr 780 | . . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝑋 ∈ 𝑏) | |
| 17 | 15, 16 | elind 4152 | . . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → 𝑋 ∈ (𝐴 ∩ 𝑏)) |
| 18 | 17 | ne0d 4294 | . . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → (𝐴 ∩ 𝑏) ≠ ∅) |
| 19 | 18 | neneqd 2962 | . . . . . . 7 ⊢ ((((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) ∧ ¬ 𝑏 = 𝐴) → ¬ (𝐴 ∩ 𝑏) = ∅) |
| 20 | 14, 19 | condan 829 | . . . . . 6 ⊢ (((((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) ∧ 𝐴 ∥ 𝑏) ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴) |
| 21 | 20 | expl 462 | . . . . 5 ⊢ (((𝜑 ∧ 𝑋 ∈ 𝐴) ∧ 𝑏 ∈ ran 𝐿) → ((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴)) |
| 22 | 21 | ralrimiva 3156 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ∀𝑏 ∈ ran 𝐿((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝐴)) |
| 23 | 3, 5, 22 | rspcedvdw 3583 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ∃𝑎 ∈ ran 𝐿∀𝑏 ∈ ran 𝐿((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝑎)) |
| 24 | nfv 1943 | . . . 4 ⊢ Ⅎ𝑎(𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) | |
| 25 | 24 | rmo2i 3840 | . . 3 ⊢ (∃𝑎 ∈ ran 𝐿∀𝑏 ∈ ran 𝐿((𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏) → 𝑏 = 𝑎) → ∃*𝑏 ∈ ran 𝐿(𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏)) |
| 26 | 23, 25 | syl 18 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ∃*𝑏 ∈ ran 𝐿(𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏)) |
| 27 | prlngmo2.p | . . 3 ⊢ 𝑃 = (Base‘𝐺) | |
| 28 | 8 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → 𝐺 ∈ TarskiG) |
| 29 | 4 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → 𝐴 ∈ ran 𝐿) |
| 30 | prlngmo2.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 31 | 30 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → 𝑋 ∈ 𝑃) |
| 32 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → ¬ 𝑋 ∈ 𝐴) | |
| 33 | 31, 32 | eldifd 3915 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → 𝑋 ∈ (𝑃 ∖ 𝐴)) |
| 34 | prlngmo2.1 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiGE) | |
| 35 | 34 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → 𝐺 ∈ TarskiGE) |
| 36 | 27, 6, 7, 28, 29, 33, 35 | prlngmo 29215 | . 2 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → ∃*𝑏 ∈ ran 𝐿(𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏)) |
| 37 | 26, 36 | pm2.61dan 824 | 1 ⊢ (𝜑 → ∃*𝑏 ∈ ran 𝐿(𝐴 ∥ 𝑏 ∧ 𝑋 ∈ 𝑏)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ∀wral 3078 ∃wrex 3088 ∃*wrmo 3367 ∩ cin 3903 ∅c0 4285 class class class wbr 5108 ran crn 5661 ‘cfv 6536 Basecbs 17275 TarskiGcstrkg 28707 TarskiGEcstrkge 28712 LineGclng 28714 parlnGcprlng 29197 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 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 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-oadd 8455 df-er 8692 df-map 8824 df-pm 8825 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-dju 9894 df-card 9932 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-nn 12240 df-2 12309 df-3 12310 df-n0 12511 df-xnn0 12584 df-z 12598 df-uz 12869 df-fz 13542 df-fzo 13690 df-hash 14374 df-word 14558 df-concat 14615 df-s1 14641 df-s2 14892 df-s3 14893 df-trkgc 28728 df-trkgb 28729 df-trkgcb 28730 df-trkge 28731 df-trkgld 28732 df-trkg 28733 df-cgrg 28791 df-leg 28863 df-hlg 28881 df-mir 28941 df-rag 28985 df-perpg 28987 df-hpg 29051 df-plng 29067 df-prlng 29198 |
| This theorem is used by: prlngeq 29218 prlngplngtr 29220 |
| Copyright terms: Public domain | W3C validator |