MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tgisline Structured version   Visualization version   GIF version

Theorem tgisline 28606
Description: The property of being a proper line, generated by two distinct points. (Contributed by Thierry Arnoux, 25-May-2019.)
Hypotheses
Ref Expression
tglineelsb2.p 𝐵 = (Base‘𝐺)
tglineelsb2.i 𝐼 = (Itv‘𝐺)
tglineelsb2.l 𝐿 = (LineG‘𝐺)
tglineelsb2.g (𝜑𝐺 ∈ TarskiG)
tgisline.1 (𝜑𝐴 ∈ ran 𝐿)
Assertion
Ref Expression
tgisline (𝜑 → ∃𝑥𝐵𝑦𝐵 (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝐺,𝑦   𝑥,𝐼,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝐿(𝑥,𝑦)

Proof of Theorem tgisline
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 tglineelsb2.p . . . . . 6 𝐵 = (Base‘𝐺)
2 tglineelsb2.l . . . . . 6 𝐿 = (LineG‘𝐺)
3 tglineelsb2.i . . . . . 6 𝐼 = (Itv‘𝐺)
4 tglineelsb2.g . . . . . . 7 (𝜑𝐺 ∈ TarskiG)
54adantr 480 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → 𝐺 ∈ TarskiG)
6 simprl 770 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → 𝑥𝐵)
7 simprr 772 . . . . . . 7 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → 𝑦 ∈ (𝐵 ∖ {𝑥}))
87eldifad 3938 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → 𝑦𝐵)
9 eldifsn 4762 . . . . . . . . 9 (𝑦 ∈ (𝐵 ∖ {𝑥}) ↔ (𝑦𝐵𝑦𝑥))
107, 9sylib 218 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → (𝑦𝐵𝑦𝑥))
1110simprd 495 . . . . . . 7 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → 𝑦𝑥)
1211necomd 2987 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → 𝑥𝑦)
131, 2, 3, 5, 6, 8, 12tglngval 28530 . . . . 5 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → (𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
1413, 12jca 511 . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → ((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦))
1514ralrimivva 3187 . . 3 (𝜑 → ∀𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥})((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦))
16 tgisline.1 . . . . 5 (𝜑𝐴 ∈ ran 𝐿)
171, 2, 3tglng 28525 . . . . . . 7 (𝐺 ∈ TarskiG → 𝐿 = (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
184, 17syl 17 . . . . . 6 (𝜑𝐿 = (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
1918rneqd 5918 . . . . 5 (𝜑 → ran 𝐿 = ran (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
2016, 19eleqtrd 2836 . . . 4 (𝜑𝐴 ∈ ran (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
21 eqid 2735 . . . . . 6 (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) = (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
2221elrnmpog 7542 . . . . 5 (𝐴 ∈ ran 𝐿 → (𝐴 ∈ ran (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) ↔ ∃𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥})𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
2316, 22syl 17 . . . 4 (𝜑 → (𝐴 ∈ ran (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) ↔ ∃𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥})𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
2420, 23mpbid 232 . . 3 (𝜑 → ∃𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥})𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
2515, 24r19.29d2r 3127 . 2 (𝜑 → ∃𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥})(((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
26 difss 4111 . . . 4 (𝐵 ∖ {𝑥}) ⊆ 𝐵
27 simpr 484 . . . . . . 7 ((((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
28 simpll 766 . . . . . . 7 ((((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → (𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
2927, 28eqtr4d 2773 . . . . . 6 ((((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → 𝐴 = (𝑥𝐿𝑦))
30 simplr 768 . . . . . 6 ((((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → 𝑥𝑦)
3129, 30jca 511 . . . . 5 ((((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
3231reximi 3074 . . . 4 (∃𝑦 ∈ (𝐵 ∖ {𝑥})(((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → ∃𝑦 ∈ (𝐵 ∖ {𝑥})(𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
33 ssrexv 4028 . . . 4 ((𝐵 ∖ {𝑥}) ⊆ 𝐵 → (∃𝑦 ∈ (𝐵 ∖ {𝑥})(𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦) → ∃𝑦𝐵 (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)))
3426, 32, 33mpsyl 68 . . 3 (∃𝑦 ∈ (𝐵 ∖ {𝑥})(((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → ∃𝑦𝐵 (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
3534reximi 3074 . 2 (∃𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥})(((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → ∃𝑥𝐵𝑦𝐵 (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
3625, 35syl 17 1 (𝜑 → ∃𝑥𝐵𝑦𝐵 (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3o 1085   = wceq 1540  wcel 2108  wne 2932  wrex 3060  {crab 3415  cdif 3923  wss 3926  {csn 4601  ran crn 5655  cfv 6531  (class class class)co 7405  cmpo 7407  Basecbs 17228  TarskiGcstrkg 28406  Itvcitv 28412  LineGclng 28413
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-sbc 3766  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-iota 6484  df-fun 6533  df-fv 6539  df-ov 7408  df-oprab 7409  df-mpo 7410  df-trkg 28432
This theorem is referenced by:  tglnne  28607  tglndim0  28608  tglinethru  28615  tglnne0  28619  tglnpt2  28620  footexALT  28697  footex  28700  opptgdim2  28724
  Copyright terms: Public domain W3C validator