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

Theorem istrkgl 25402
 Description: Building lines from the segment property. (Contributed by Thierry Arnoux, 14-Mar-2019.)
Hypotheses
Ref Expression
istrkg.p 𝑃 = (Base‘𝐺)
istrkg.d = (dist‘𝐺)
istrkg.i 𝐼 = (Itv‘𝐺)
Assertion
Ref Expression
istrkgl (𝐺 ∈ {𝑓[(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](LineG‘𝑓) = (𝑥𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))})} ↔ (𝐺 ∈ V ∧ (LineG‘𝐺) = (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})))
Distinct variable groups:   𝑓,𝑖,𝑝,𝐺   𝑥,𝑓,𝑦,𝑧,𝐼,𝑖,𝑝   𝑃,𝑓,𝑖,𝑝,𝑥,𝑦,𝑧   ,𝑓,𝑖,𝑝,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐺(𝑥,𝑦,𝑧)

Proof of Theorem istrkgl
StepHypRef Expression
1 istrkg.p . . . 4 𝑃 = (Base‘𝐺)
2 istrkg.i . . . 4 𝐼 = (Itv‘𝐺)
3 simpl 472 . . . . . . 7 ((𝑝 = 𝑃𝑖 = 𝐼) → 𝑝 = 𝑃)
43eqcomd 2657 . . . . . 6 ((𝑝 = 𝑃𝑖 = 𝐼) → 𝑃 = 𝑝)
54adantr 480 . . . . . . 7 (((𝑝 = 𝑃𝑖 = 𝐼) ∧ 𝑥𝑃) → 𝑃 = 𝑝)
65difeq1d 3760 . . . . . 6 (((𝑝 = 𝑃𝑖 = 𝐼) ∧ 𝑥𝑃) → (𝑃 ∖ {𝑥}) = (𝑝 ∖ {𝑥}))
7 simpr 476 . . . . . . . . . . . 12 ((𝑝 = 𝑃𝑖 = 𝐼) → 𝑖 = 𝐼)
87eqcomd 2657 . . . . . . . . . . 11 ((𝑝 = 𝑃𝑖 = 𝐼) → 𝐼 = 𝑖)
98oveqd 6707 . . . . . . . . . 10 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑥𝐼𝑦) = (𝑥𝑖𝑦))
109eleq2d 2716 . . . . . . . . 9 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑧 ∈ (𝑥𝐼𝑦) ↔ 𝑧 ∈ (𝑥𝑖𝑦)))
118oveqd 6707 . . . . . . . . . 10 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑧𝐼𝑦) = (𝑧𝑖𝑦))
1211eleq2d 2716 . . . . . . . . 9 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑥 ∈ (𝑧𝐼𝑦) ↔ 𝑥 ∈ (𝑧𝑖𝑦)))
138oveqd 6707 . . . . . . . . . 10 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑥𝐼𝑧) = (𝑥𝑖𝑧))
1413eleq2d 2716 . . . . . . . . 9 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑦 ∈ (𝑥𝐼𝑧) ↔ 𝑦 ∈ (𝑥𝑖𝑧)))
1510, 12, 143orbi123d 1438 . . . . . . . 8 ((𝑝 = 𝑃𝑖 = 𝐼) → ((𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧)) ↔ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))))
164, 15rabeqbidv 3226 . . . . . . 7 ((𝑝 = 𝑃𝑖 = 𝐼) → {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} = {𝑧𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))})
1716adantr 480 . . . . . 6 (((𝑝 = 𝑃𝑖 = 𝐼) ∧ (𝑥𝑃𝑦 ∈ (𝑃 ∖ {𝑥}))) → {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} = {𝑧𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))})
184, 6, 17mpt2eq123dva 6758 . . . . 5 ((𝑝 = 𝑃𝑖 = 𝐼) → (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) = (𝑥𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))}))
1918eqeq2d 2661 . . . 4 ((𝑝 = 𝑃𝑖 = 𝐼) → ((LineG‘𝑓) = (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) ↔ (LineG‘𝑓) = (𝑥𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))})))
201, 2, 19sbcie2s 15963 . . 3 (𝑓 = 𝐺 → ([(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](LineG‘𝑓) = (𝑥𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))}) ↔ (LineG‘𝑓) = (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})))
21 fveq2 6229 . . . 4 (𝑓 = 𝐺 → (LineG‘𝑓) = (LineG‘𝐺))
2221eqeq1d 2653 . . 3 (𝑓 = 𝐺 → ((LineG‘𝑓) = (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) ↔ (LineG‘𝐺) = (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})))
2320, 22bitrd 268 . 2 (𝑓 = 𝐺 → ([(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](LineG‘𝑓) = (𝑥𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))}) ↔ (LineG‘𝐺) = (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})))
24 eqid 2651 . 2 {𝑓[(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](LineG‘𝑓) = (𝑥𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))})} = {𝑓[(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](LineG‘𝑓) = (𝑥𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))})}
2523, 24elab4g 3387 1 (𝐺 ∈ {𝑓[(Base‘𝑓) / 𝑝][(Itv‘𝑓) / 𝑖](LineG‘𝑓) = (𝑥𝑝, 𝑦 ∈ (𝑝 ∖ {𝑥}) ↦ {𝑧𝑝 ∣ (𝑧 ∈ (𝑥𝑖𝑦) ∨ 𝑥 ∈ (𝑧𝑖𝑦) ∨ 𝑦 ∈ (𝑥𝑖𝑧))})} ↔ (𝐺 ∈ V ∧ (LineG‘𝐺) = (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 383   ∨ w3o 1053   = wceq 1523   ∈ wcel 2030  {cab 2637  {crab 2945  Vcvv 3231  [wsbc 3468   ∖ cdif 3604  {csn 4210  ‘cfv 5926  (class class class)co 6690   ↦ cmpt2 6692  Basecbs 15904  distcds 15997  Itvcitv 25380  LineGclng 25381 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-nul 4822 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-iota 5889  df-fv 5934  df-ov 6693  df-oprab 6694  df-mpt2 6695 This theorem is referenced by:  tglng  25486  f1otrg  25796  eengtrkg  25910
 Copyright terms: Public domain W3C validator