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

Theorem tglngval 29020
Description: The line going through points 𝑋 and 𝑌. (Contributed by Thierry Arnoux, 28-Mar-2019.)
Hypotheses
Ref Expression
tglngval.p 𝑃 = (Base‘𝐺)
tglngval.l 𝐿 = (LineG‘𝐺)
tglngval.i 𝐼 = (Itv‘𝐺)
tglngval.g (𝜑 → 𝐺 ∈ TarskiG)
tglngval.x (𝜑 → 𝑋 ∈ 𝑃)
tglngval.y (𝜑 → 𝑌 ∈ 𝑃)
tglngval.z (𝜑 → 𝑋 ≠ 𝑌)
Assertion
Ref Expression
tglngval (𝜑 → (𝑋𝐿𝑌) = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))})
Distinct variable groups:   𝑧,𝐺   𝑧,𝐼   𝑧,𝑃   𝑧,𝑋   𝑧,𝑌   𝜑,𝑧
Allowed substitution hint:   𝐿(𝑧)

Proof of Theorem tglngval
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tglngval.g . . . 4 (𝜑 → 𝐺 ∈ TarskiG)
2 tglngval.p . . . . 5 𝑃 = (Base‘𝐺)
3 tglngval.l . . . . 5 𝐿 = (LineG‘𝐺)
4 tglngval.i . . . . 5 𝐼 = (Itv‘𝐺)
52, 3, 4tglng 29015 . . . 4 (𝐺 ∈ TarskiG → 𝐿 = (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
61, 5syl 18 . . 3 (𝜑 → 𝐿 = (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
76oveqd 7438 . 2 (𝜑 → (𝑋𝐿𝑌) = (𝑋(𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})𝑌))
8 tglngval.x . . 3 (𝜑 → 𝑋 ∈ 𝑃)
9 tglngval.y . . . 4 (𝜑 → 𝑌 ∈ 𝑃)
10 tglngval.z . . . . 5 (𝜑 → 𝑋 ≠ 𝑌)
1110necomd 3010 . . . 4 (𝜑 → 𝑌 ≠ 𝑋)
12 eldifsn 4744 . . . 4 (𝑌 ∈ (𝑃 ∖ {𝑋}) ↔ (𝑌 ∈ 𝑃 ∧ 𝑌 ≠ 𝑋))
139, 11, 12sylanbrc 595 . . 3 (𝜑 → 𝑌 ∈ (𝑃 ∖ {𝑋}))
142fvexi 6900 . . . . 5 𝑃 ∈ V
1514rabex 5299 . . . 4 {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))} ∈ V
1615a1i 11 . . 3 (𝜑 → {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))} ∈ V)
17 oveq12 7430 . . . . . . 7 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑥𝐼𝑦) = (𝑋𝐼𝑌))
1817eleq2d 2846 . . . . . 6 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑧 ∈ (𝑥𝐼𝑦) ↔ 𝑧 ∈ (𝑋𝐼𝑌)))
19 simpl 488 . . . . . . 7 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → 𝑥 = 𝑋)
20 simpr 490 . . . . . . . 8 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → 𝑦 = 𝑌)
2120oveq2d 7437 . . . . . . 7 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑧𝐼𝑦) = (𝑧𝐼𝑌))
2219, 21eleq12d 2854 . . . . . 6 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑥 ∈ (𝑧𝐼𝑦) ↔ 𝑋 ∈ (𝑧𝐼𝑌)))
2319oveq1d 7436 . . . . . . 7 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑥𝐼𝑧) = (𝑋𝐼𝑧))
2420, 23eleq12d 2854 . . . . . 6 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑦 ∈ (𝑥𝐼𝑧) ↔ 𝑌 ∈ (𝑋𝐼𝑧)))
2518, 22, 243orbi123d 1463 . . . . 5 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧)) ↔ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))))
2625rabbidv 3419 . . . 4 ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))})
27 sneq 4590 . . . . 5 (𝑥 = 𝑋 → {𝑥} = {𝑋})
2827difeq2d 4063 . . . 4 (𝑥 = 𝑋 → (𝑃 ∖ {𝑥}) = (𝑃 ∖ {𝑋}))
29 eqid 2760 . . . 4 (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) = (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
3026, 28, 29ovmpox 7574 . . 3 ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ (𝑃 ∖ {𝑋}) ∧ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))} ∈ V) → (𝑋(𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})𝑌) = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))})
318, 13, 16, 30syl3anc 1398 . 2 (𝜑 → (𝑋(𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})𝑌) = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))})
327, 31eqtrd 2795 1 (𝜑 → (𝑋𝐿𝑌) = {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ w3o 1102   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  {crab 3412  Vcvv 3450   ∖ cdif 4045  {csn 4584  ‘cfv 6539  (class class class)co 7421   ∈ cmpo 7423  Basecbs 17393  TarskiGcstrkg 28895  Itvcitv 28901  LineGclng 28902
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6541  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-trkg 28921
This theorem is used by:  tglnssp  29021  tgellng  29022  tgisline  29101
  Copyright terms: Public domain W3C validator