![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ipsbased | GIF version |
Description: The base set of a constructed inner product space. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Jim Kingdon, 7-Feb-2023.) |
Ref | Expression |
---|---|
ipspart.a | ⊢ 𝐴 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), × ⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), 𝐼⟩}) |
ipsstrd.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
ipsstrd.p | ⊢ (𝜑 → + ∈ 𝑊) |
ipsstrd.r | ⊢ (𝜑 → × ∈ 𝑋) |
ipsstrd.s | ⊢ (𝜑 → 𝑆 ∈ 𝑌) |
ipsstrd.x | ⊢ (𝜑 → · ∈ 𝑄) |
ipsstrd.i | ⊢ (𝜑 → 𝐼 ∈ 𝑍) |
Ref | Expression |
---|---|
ipsbased | ⊢ (𝜑 → 𝐵 = (Base‘𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ipspart.a | . . 3 ⊢ 𝐴 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), × ⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), 𝐼⟩}) | |
2 | ipsstrd.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
3 | ipsstrd.p | . . 3 ⊢ (𝜑 → + ∈ 𝑊) | |
4 | ipsstrd.r | . . 3 ⊢ (𝜑 → × ∈ 𝑋) | |
5 | ipsstrd.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑌) | |
6 | ipsstrd.x | . . 3 ⊢ (𝜑 → · ∈ 𝑄) | |
7 | ipsstrd.i | . . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑍) | |
8 | 1, 2, 3, 4, 5, 6, 7 | ipsstrd 12625 | . 2 ⊢ (𝜑 → 𝐴 Struct ⟨1, 8⟩) |
9 | basendxnn 12509 | . . . . 5 ⊢ (Base‘ndx) ∈ ℕ | |
10 | opexg 4227 | . . . . 5 ⊢ (((Base‘ndx) ∈ ℕ ∧ 𝐵 ∈ 𝑉) → ⟨(Base‘ndx), 𝐵⟩ ∈ V) | |
11 | 9, 2, 10 | sylancr 414 | . . . 4 ⊢ (𝜑 → ⟨(Base‘ndx), 𝐵⟩ ∈ V) |
12 | tpid1g 3704 | . . . 4 ⊢ (⟨(Base‘ndx), 𝐵⟩ ∈ V → ⟨(Base‘ndx), 𝐵⟩ ∈ {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), × ⟩}) | |
13 | elun1 3302 | . . . 4 ⊢ (⟨(Base‘ndx), 𝐵⟩ ∈ {⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), × ⟩} → ⟨(Base‘ndx), 𝐵⟩ ∈ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), × ⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), 𝐼⟩})) | |
14 | 11, 12, 13 | 3syl 17 | . . 3 ⊢ (𝜑 → ⟨(Base‘ndx), 𝐵⟩ ∈ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), + ⟩, ⟨(.r‘ndx), × ⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), · ⟩, ⟨(·𝑖‘ndx), 𝐼⟩})) |
15 | 14, 1 | eleqtrrdi 2271 | . 2 ⊢ (𝜑 → ⟨(Base‘ndx), 𝐵⟩ ∈ 𝐴) |
16 | 8, 2, 15 | opelstrbas 12565 | 1 ⊢ (𝜑 → 𝐵 = (Base‘𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1353 ∈ wcel 2148 Vcvv 2737 ∪ cun 3127 {ctp 3594 ⟨cop 3595 ‘cfv 5214 1c1 7808 ℕcn 8914 8c8 8971 ndxcnx 12450 Basecbs 12453 +gcplusg 12527 .rcmulr 12528 Scalarcsca 12530 ·𝑠 cvsca 12531 ·𝑖cip 12532 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4120 ax-pow 4173 ax-pr 4208 ax-un 4432 ax-setind 4535 ax-cnex 7898 ax-resscn 7899 ax-1cn 7900 ax-1re 7901 ax-icn 7902 ax-addcl 7903 ax-addrcl 7904 ax-mulcl 7905 ax-addcom 7907 ax-addass 7909 ax-distr 7911 ax-i2m1 7912 ax-0lt1 7913 ax-0id 7915 ax-rnegex 7916 ax-cnre 7918 ax-pre-ltirr 7919 ax-pre-ltwlin 7920 ax-pre-lttrn 7921 ax-pre-apti 7922 ax-pre-ltadd 7923 |
This theorem depends on definitions: df-bi 117 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2739 df-sbc 2963 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-pw 3577 df-sn 3598 df-pr 3599 df-tp 3600 df-op 3601 df-uni 3810 df-int 3845 df-br 4003 df-opab 4064 df-mpt 4065 df-id 4292 df-xp 4631 df-rel 4632 df-cnv 4633 df-co 4634 df-dm 4635 df-rn 4636 df-res 4637 df-ima 4638 df-iota 5176 df-fun 5216 df-fn 5217 df-f 5218 df-fv 5222 df-riota 5827 df-ov 5874 df-oprab 5875 df-mpo 5876 df-pnf 7989 df-mnf 7990 df-xr 7991 df-ltxr 7992 df-le 7993 df-sub 8125 df-neg 8126 df-inn 8915 df-2 8973 df-3 8974 df-4 8975 df-5 8976 df-6 8977 df-7 8978 df-8 8979 df-n0 9172 df-z 9249 df-uz 9524 df-fz 10004 df-struct 12455 df-ndx 12456 df-slot 12457 df-base 12459 df-plusg 12540 df-mulr 12541 df-sca 12543 df-vsca 12544 df-ip 12545 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |