| 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 13261 | . 2 ⊢ (𝜑 → 𝐴 Struct 〈1, 8〉) |
| 9 | basendxnn 13140 | . . . . 5 ⊢ (Base‘ndx) ∈ ℕ | |
| 10 | opexg 4320 | . . . . 5 ⊢ (((Base‘ndx) ∈ ℕ ∧ 𝐵 ∈ 𝑉) → 〈(Base‘ndx), 𝐵〉 ∈ V) | |
| 11 | 9, 2, 10 | sylancr 414 | . . . 4 ⊢ (𝜑 → 〈(Base‘ndx), 𝐵〉 ∈ V) |
| 12 | tpid1g 3784 | . . . 4 ⊢ (〈(Base‘ndx), 𝐵〉 ∈ V → 〈(Base‘ndx), 𝐵〉 ∈ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉}) | |
| 13 | elun1 3374 | . . . 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 2325 | . 2 ⊢ (𝜑 → 〈(Base‘ndx), 𝐵〉 ∈ 𝐴) |
| 16 | 8, 2, 15 | opelstrbas 13200 | 1 ⊢ (𝜑 → 𝐵 = (Base‘𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∈ wcel 2202 Vcvv 2802 ∪ cun 3198 {ctp 3671 〈cop 3672 ‘cfv 5326 1c1 8033 ℕcn 9143 8c8 9200 ndxcnx 13081 Basecbs 13084 +gcplusg 13162 .rcmulr 13163 Scalarcsca 13165 ·𝑠 cvsca 13166 ·𝑖cip 13167 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-tp 3677 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-5 9205 df-6 9206 df-7 9207 df-8 9208 df-n0 9403 df-z 9480 df-uz 9756 df-fz 10244 df-struct 13086 df-ndx 13087 df-slot 13088 df-base 13090 df-plusg 13175 df-mulr 13176 df-sca 13178 df-vsca 13179 df-ip 13180 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |