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

Theorem tglnfn 25187
Description: Lines as functions. (Contributed by Thierry Arnoux, 25-May-2019.)
Hypotheses
Ref Expression
tglng.p 𝑃 = (Base‘𝐺)
tglng.l 𝐿 = (LineG‘𝐺)
tglng.i 𝐼 = (Itv‘𝐺)
Assertion
Ref Expression
tglnfn (𝐺 ∈ TarskiG → 𝐿 Fn ((𝑃 × 𝑃) ∖ I ))

Proof of Theorem tglnfn
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tglng.p . . . . . . . 8 𝑃 = (Base‘𝐺)
2 fvex 6097 . . . . . . . 8 (Base‘𝐺) ∈ V
31, 2eqeltri 2683 . . . . . . 7 𝑃 ∈ V
43rabex 4734 . . . . . 6 {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∈ V
54rgen2w 2908 . . . . 5 𝑥𝑃𝑦 ∈ (𝑃 ∖ {𝑥}){𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∈ V
6 eqid 2609 . . . . . 6 (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) = (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})
76fmpt2x 7102 . . . . 5 (∀𝑥𝑃𝑦 ∈ (𝑃 ∖ {𝑥}){𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))} ∈ V ↔ (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}): 𝑥𝑃 ({𝑥} × (𝑃 ∖ {𝑥}))⟶V)
85, 7mpbi 218 . . . 4 (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}): 𝑥𝑃 ({𝑥} × (𝑃 ∖ {𝑥}))⟶V
9 ffn 5943 . . . 4 ((𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}): 𝑥𝑃 ({𝑥} × (𝑃 ∖ {𝑥}))⟶V → (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) Fn 𝑥𝑃 ({𝑥} × (𝑃 ∖ {𝑥})))
108, 9ax-mp 5 . . 3 (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) Fn 𝑥𝑃 ({𝑥} × (𝑃 ∖ {𝑥}))
11 xpdifid 5466 . . . 4 𝑥𝑃 ({𝑥} × (𝑃 ∖ {𝑥})) = ((𝑃 × 𝑃) ∖ I )
1211fneq2i 5885 . . 3 ((𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) Fn 𝑥𝑃 ({𝑥} × (𝑃 ∖ {𝑥})) ↔ (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) Fn ((𝑃 × 𝑃) ∖ I ))
1310, 12mpbi 218 . 2 (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) Fn ((𝑃 × 𝑃) ∖ I )
14 tglng.l . . . 4 𝐿 = (LineG‘𝐺)
15 tglng.i . . . 4 𝐼 = (Itv‘𝐺)
161, 14, 15tglng 25186 . . 3 (𝐺 ∈ TarskiG → 𝐿 = (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}))
1716fneq1d 5880 . 2 (𝐺 ∈ TarskiG → (𝐿 Fn ((𝑃 × 𝑃) ∖ I ) ↔ (𝑥𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑧𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))}) Fn ((𝑃 × 𝑃) ∖ I )))
1813, 17mpbiri 246 1 (𝐺 ∈ TarskiG → 𝐿 Fn ((𝑃 × 𝑃) ∖ I ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3o 1029   = wceq 1474  wcel 1976  wral 2895  {crab 2899  Vcvv 3172  cdif 3536  {csn 4124   ciun 4449   I cid 4937   × cxp 5025   Fn wfn 5784  wf 5785  cfv 5789  (class class class)co 6526  cmpt2 6528  Basecbs 15643  TarskiGcstrkg 25073  Itvcitv 25079  LineGclng 25080
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-8 1978  ax-9 1985  ax-10 2005  ax-11 2020  ax-12 2033  ax-13 2233  ax-ext 2589  ax-sep 4703  ax-nul 4711  ax-pow 4763  ax-pr 4827  ax-un 6824
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3or 1031  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1867  df-eu 2461  df-mo 2462  df-clab 2596  df-cleq 2602  df-clel 2605  df-nfc 2739  df-ne 2781  df-ral 2900  df-rex 2901  df-rab 2904  df-v 3174  df-sbc 3402  df-csb 3499  df-dif 3542  df-un 3544  df-in 3546  df-ss 3553  df-nul 3874  df-if 4036  df-sn 4125  df-pr 4127  df-op 4131  df-uni 4367  df-iun 4451  df-br 4578  df-opab 4638  df-mpt 4639  df-id 4942  df-xp 5033  df-rel 5034  df-cnv 5035  df-co 5036  df-dm 5037  df-rn 5038  df-res 5039  df-ima 5040  df-iota 5753  df-fun 5791  df-fn 5792  df-f 5793  df-fv 5797  df-ov 6529  df-oprab 6530  df-mpt2 6531  df-1st 7036  df-2nd 7037  df-trkg 25096
This theorem is referenced by:  tglngne  25190  tgelrnln  25270
  Copyright terms: Public domain W3C validator