| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rrxlinesc | Structured version Visualization version GIF version | ||
| Description: Definition of lines passing through two different points in a generalized real Euclidean space of finite dimension, expressed by their coordinates. (Contributed by AV, 13-Feb-2023.) |
| Ref | Expression |
|---|---|
| rrxlinesc.e | ⊢ 𝐸 = (ℝ^‘𝐼) |
| rrxlinesc.p | ⊢ 𝑃 = (ℝ ↑m 𝐼) |
| rrxlinesc.l | ⊢ 𝐿 = (LineM‘𝐸) |
| Ref | Expression |
|---|---|
| rrxlinesc | ⊢ (𝐼 ∈ Fin → 𝐿 = (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑝 ∈ 𝑃 ∣ ∃𝑡 ∈ ℝ ∀𝑖 ∈ 𝐼 (𝑝‘𝑖) = (((1 − 𝑡) · (𝑥‘𝑖)) + (𝑡 · (𝑦‘𝑖)))})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rrxlinesc.e | . . 3 ⊢ 𝐸 = (ℝ^‘𝐼) | |
| 2 | rrxlinesc.p | . . 3 ⊢ 𝑃 = (ℝ ↑m 𝐼) | |
| 3 | rrxlinesc.l | . . 3 ⊢ 𝐿 = (LineM‘𝐸) | |
| 4 | eqid 2739 | . . 3 ⊢ ( ·𝑠 ‘𝐸) = ( ·𝑠 ‘𝐸) | |
| 5 | eqid 2739 | . . 3 ⊢ (+g‘𝐸) = (+g‘𝐸) | |
| 6 | 1, 2, 3, 4, 5 | rrxlines 49224 | . 2 ⊢ (𝐼 ∈ Fin → 𝐿 = (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑝 ∈ 𝑃 ∣ ∃𝑡 ∈ ℝ 𝑝 = (((1 − 𝑡)( ·𝑠 ‘𝐸)𝑥)(+g‘𝐸)(𝑡( ·𝑠 ‘𝐸)𝑦))})) |
| 7 | eqid 2739 | . . . . . 6 ⊢ (Base‘𝐸) = (Base‘𝐸) | |
| 8 | simpll1 1219 | . . . . . 6 ⊢ ((((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) ∧ 𝑝 ∈ 𝑃) ∧ 𝑡 ∈ ℝ) → 𝐼 ∈ Fin) | |
| 9 | 1red 11136 | . . . . . . 7 ⊢ ((((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) ∧ 𝑝 ∈ 𝑃) ∧ 𝑡 ∈ ℝ) → 1 ∈ ℝ) | |
| 10 | simpr 485 | . . . . . . 7 ⊢ ((((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) ∧ 𝑝 ∈ 𝑃) ∧ 𝑡 ∈ ℝ) → 𝑡 ∈ ℝ) | |
| 11 | 9, 10 | resubcld 11569 | . . . . . 6 ⊢ ((((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) ∧ 𝑝 ∈ 𝑃) ∧ 𝑡 ∈ ℝ) → (1 − 𝑡) ∈ ℝ) |
| 12 | id 22 | . . . . . . . . . . . 12 ⊢ (𝐼 ∈ Fin → 𝐼 ∈ Fin) | |
| 13 | 12, 1, 7 | rrxbasefi 25395 | . . . . . . . . . . 11 ⊢ (𝐼 ∈ Fin → (Base‘𝐸) = (ℝ ↑m 𝐼)) |
| 14 | 2, 13 | eqtr4id 2793 | . . . . . . . . . 10 ⊢ (𝐼 ∈ Fin → 𝑃 = (Base‘𝐸)) |
| 15 | 14 | eleq2d 2825 | . . . . . . . . 9 ⊢ (𝐼 ∈ Fin → (𝑥 ∈ 𝑃 ↔ 𝑥 ∈ (Base‘𝐸))) |
| 16 | 15 | biimpa 477 | . . . . . . . 8 ⊢ ((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃) → 𝑥 ∈ (Base‘𝐸)) |
| 17 | 16 | 3adant3 1138 | . . . . . . 7 ⊢ ((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) → 𝑥 ∈ (Base‘𝐸)) |
| 18 | 17 | ad2antrr 732 | . . . . . 6 ⊢ ((((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) ∧ 𝑝 ∈ 𝑃) ∧ 𝑡 ∈ ℝ) → 𝑥 ∈ (Base‘𝐸)) |
| 19 | eldifi 4061 | . . . . . . . . . 10 ⊢ (𝑦 ∈ (𝑃 ∖ {𝑥}) → 𝑦 ∈ 𝑃) | |
| 20 | 14 | eleq2d 2825 | . . . . . . . . . 10 ⊢ (𝐼 ∈ Fin → (𝑦 ∈ 𝑃 ↔ 𝑦 ∈ (Base‘𝐸))) |
| 21 | 19, 20 | imbitrid 245 | . . . . . . . . 9 ⊢ (𝐼 ∈ Fin → (𝑦 ∈ (𝑃 ∖ {𝑥}) → 𝑦 ∈ (Base‘𝐸))) |
| 22 | 21 | a1d 25 | . . . . . . . 8 ⊢ (𝐼 ∈ Fin → (𝑥 ∈ 𝑃 → (𝑦 ∈ (𝑃 ∖ {𝑥}) → 𝑦 ∈ (Base‘𝐸)))) |
| 23 | 22 | 3imp 1116 | . . . . . . 7 ⊢ ((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) → 𝑦 ∈ (Base‘𝐸)) |
| 24 | 23 | ad2antrr 732 | . . . . . 6 ⊢ ((((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) ∧ 𝑝 ∈ 𝑃) ∧ 𝑡 ∈ ℝ) → 𝑦 ∈ (Base‘𝐸)) |
| 25 | 14 | 3ad2ant1 1139 | . . . . . . . . 9 ⊢ ((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) → 𝑃 = (Base‘𝐸)) |
| 26 | 25 | eleq2d 2825 | . . . . . . . 8 ⊢ ((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) → (𝑝 ∈ 𝑃 ↔ 𝑝 ∈ (Base‘𝐸))) |
| 27 | 26 | biimpa 477 | . . . . . . 7 ⊢ (((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) ∧ 𝑝 ∈ 𝑃) → 𝑝 ∈ (Base‘𝐸)) |
| 28 | 27 | adantr 481 | . . . . . 6 ⊢ ((((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) ∧ 𝑝 ∈ 𝑃) ∧ 𝑡 ∈ ℝ) → 𝑝 ∈ (Base‘𝐸)) |
| 29 | 1, 7, 4, 8, 11, 18, 24, 28, 5, 10 | rrxplusgvscavalb 25380 | . . . . 5 ⊢ ((((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) ∧ 𝑝 ∈ 𝑃) ∧ 𝑡 ∈ ℝ) → (𝑝 = (((1 − 𝑡)( ·𝑠 ‘𝐸)𝑥)(+g‘𝐸)(𝑡( ·𝑠 ‘𝐸)𝑦)) ↔ ∀𝑖 ∈ 𝐼 (𝑝‘𝑖) = (((1 − 𝑡) · (𝑥‘𝑖)) + (𝑡 · (𝑦‘𝑖))))) |
| 30 | 29 | rexbidva 3161 | . . . 4 ⊢ (((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) ∧ 𝑝 ∈ 𝑃) → (∃𝑡 ∈ ℝ 𝑝 = (((1 − 𝑡)( ·𝑠 ‘𝐸)𝑥)(+g‘𝐸)(𝑡( ·𝑠 ‘𝐸)𝑦)) ↔ ∃𝑡 ∈ ℝ ∀𝑖 ∈ 𝐼 (𝑝‘𝑖) = (((1 − 𝑡) · (𝑥‘𝑖)) + (𝑡 · (𝑦‘𝑖))))) |
| 31 | 30 | rabbidva 3397 | . . 3 ⊢ ((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑃 ∧ 𝑦 ∈ (𝑃 ∖ {𝑥})) → {𝑝 ∈ 𝑃 ∣ ∃𝑡 ∈ ℝ 𝑝 = (((1 − 𝑡)( ·𝑠 ‘𝐸)𝑥)(+g‘𝐸)(𝑡( ·𝑠 ‘𝐸)𝑦))} = {𝑝 ∈ 𝑃 ∣ ∃𝑡 ∈ ℝ ∀𝑖 ∈ 𝐼 (𝑝‘𝑖) = (((1 − 𝑡) · (𝑥‘𝑖)) + (𝑡 · (𝑦‘𝑖)))}) |
| 32 | 31 | mpoeq3dva 7433 | . 2 ⊢ (𝐼 ∈ Fin → (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑝 ∈ 𝑃 ∣ ∃𝑡 ∈ ℝ 𝑝 = (((1 − 𝑡)( ·𝑠 ‘𝐸)𝑥)(+g‘𝐸)(𝑡( ·𝑠 ‘𝐸)𝑦))}) = (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑝 ∈ 𝑃 ∣ ∃𝑡 ∈ ℝ ∀𝑖 ∈ 𝐼 (𝑝‘𝑖) = (((1 − 𝑡) · (𝑥‘𝑖)) + (𝑡 · (𝑦‘𝑖)))})) |
| 33 | 6, 32 | eqtrd 2774 | 1 ⊢ (𝐼 ∈ Fin → 𝐿 = (𝑥 ∈ 𝑃, 𝑦 ∈ (𝑃 ∖ {𝑥}) ↦ {𝑝 ∈ 𝑃 ∣ ∃𝑡 ∈ ℝ ∀𝑖 ∈ 𝐼 (𝑝‘𝑖) = (((1 − 𝑡) · (𝑥‘𝑖)) + (𝑡 · (𝑦‘𝑖)))})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ∀wral 3053 ∃wrex 3063 {crab 3391 ∖ cdif 3880 {csn 4555 ‘cfv 6485 (class class class)co 7356 ∈ cmpo 7358 ↑m cmap 8763 Fincfn 8883 ℝcr 11028 1c1 11030 + caddc 11032 · cmul 11034 − cmin 11368 Basecbs 17170 +gcplusg 17211 ·𝑠 cvsca 17215 ℝ^crrx 25368 LineMcline 49218 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 ax-addf 11108 ax-mulf 11109 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-tp 4560 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-of 7620 df-om 7807 df-1st 7931 df-2nd 7932 df-supp 8101 df-tpos 8166 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8633 df-map 8765 df-ixp 8836 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fsupp 9265 df-sup 9345 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 df-n0 12429 df-z 12516 df-dec 12636 df-uz 12780 df-rp 12934 df-fz 13453 df-seq 13955 df-exp 14015 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-struct 17108 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-mulr 17225 df-starv 17226 df-sca 17227 df-vsca 17228 df-ip 17229 df-tset 17230 df-ple 17231 df-ds 17233 df-unif 17234 df-hom 17235 df-cco 17236 df-0g 17395 df-prds 17401 df-pws 17403 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-mhm 18742 df-grp 18903 df-minusg 18904 df-sbg 18905 df-subg 19090 df-ghm 19179 df-cmn 19748 df-abl 19749 df-mgp 20113 df-rng 20125 df-ur 20154 df-ring 20207 df-cring 20208 df-oppr 20308 df-dvdsr 20328 df-unit 20329 df-invr 20359 df-dvr 20372 df-rhm 20443 df-subrng 20518 df-subrg 20542 df-drng 20703 df-field 20704 df-staf 20811 df-srng 20812 df-lmod 20852 df-lss 20922 df-sra 21163 df-rgmod 21164 df-cnfld 21348 df-refld 21580 df-dsmm 21707 df-frlm 21722 df-tng 24567 df-tcph 25154 df-rrx 25370 df-line 49220 |
| This theorem is referenced by: eenglngeehlnm 49230 |
| Copyright terms: Public domain | W3C validator |