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

Theorem tgisline 26988
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 481 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → 𝐺 ∈ TarskiG)
6 simprl 768 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → 𝑥𝐵)
7 simprr 770 . . . . . . 7 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → 𝑦 ∈ (𝐵 ∖ {𝑥}))
87eldifad 3899 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → 𝑦𝐵)
9 eldifsn 4720 . . . . . . . . 9 (𝑦 ∈ (𝐵 ∖ {𝑥}) ↔ (𝑦𝐵𝑦𝑥))
107, 9sylib 217 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → (𝑦𝐵𝑦𝑥))
1110simprd 496 . . . . . . 7 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → 𝑦𝑥)
1211necomd 2999 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → 𝑥𝑦)
131, 2, 3, 5, 6, 8, 12tglngval 26912 . . . . 5 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → (𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
1413, 12jca 512 . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥}))) → ((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦))
1514ralrimivva 3123 . . 3 (𝜑 → ∀𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥})((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦))
16 tgisline.1 . . . . 5 (𝜑𝐴 ∈ ran 𝐿)
171, 2, 3tglng 26907 . . . . . . 7 (𝐺 ∈ TarskiG → 𝐿 = (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
184, 17syl 17 . . . . . 6 (𝜑𝐿 = (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
1918rneqd 5847 . . . . 5 (𝜑 → ran 𝐿 = ran (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
2016, 19eleqtrd 2841 . . . 4 (𝜑𝐴 ∈ ran (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
21 eqid 2738 . . . . . 6 (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) = (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
2221elrnmpog 7409 . . . . 5 (𝐴 ∈ ran 𝐿 → (𝐴 ∈ ran (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) ↔ ∃𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥})𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
2316, 22syl 17 . . . 4 (𝜑 → (𝐴 ∈ ran (𝑥𝐵, 𝑦 ∈ (𝐵 ∖ {𝑥}) ↦ {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) ↔ ∃𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥})𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
2420, 23mpbid 231 . . 3 (𝜑 → ∃𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥})𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
2515, 24r19.29d2r 3264 . 2 (𝜑 → ∃𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥})(((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
26 difss 4066 . . . 4 (𝐵 ∖ {𝑥}) ⊆ 𝐵
27 simpr 485 . . . . . . 7 ((((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
28 simpll 764 . . . . . . 7 ((((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → (𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
2927, 28eqtr4d 2781 . . . . . 6 ((((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → 𝐴 = (𝑥𝐿𝑦))
30 simplr 766 . . . . . 6 ((((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → 𝑥𝑦)
3129, 30jca 512 . . . . 5 ((((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
3231reximi 3178 . . . 4 (∃𝑦 ∈ (𝐵 ∖ {𝑥})(((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → ∃𝑦 ∈ (𝐵 ∖ {𝑥})(𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
33 ssrexv 3988 . . . 4 ((𝐵 ∖ {𝑥}) ⊆ 𝐵 → (∃𝑦 ∈ (𝐵 ∖ {𝑥})(𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦) → ∃𝑦𝐵 (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦)))
3426, 32, 33mpsyl 68 . . 3 (∃𝑦 ∈ (𝐵 ∖ {𝑥})(((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → ∃𝑦𝐵 (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
3534reximi 3178 . 2 (∃𝑥𝐵𝑦 ∈ (𝐵 ∖ {𝑥})(((𝑥𝐿𝑦) = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∧ 𝑥𝑦) ∧ 𝐴 = {𝑧𝐵 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) → ∃𝑥𝐵𝑦𝐵 (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
3625, 35syl 17 1 (𝜑 → ∃𝑥𝐵𝑦𝐵 (𝐴 = (𝑥𝐿𝑦) ∧ 𝑥𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3o 1085   = wceq 1539  wcel 2106  wne 2943  wrex 3065  {crab 3068  cdif 3884  wss 3887  {csn 4561  ran crn 5590  cfv 6433  (class class class)co 7275  cmpo 7277  Basecbs 16912  TarskiGcstrkg 26788  Itvcitv 26794  LineGclng 26795
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-iota 6391  df-fun 6435  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-trkg 26814
This theorem is referenced by:  tglnne  26989  tglndim0  26990  tglinethru  26997  tglnne0  27001  tglnpt2  27002  footexALT  27079  footex  27082  opptgdim2  27106
  Copyright terms: Public domain W3C validator