| 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 13217 | . 2 ⊢ (𝜑 → 𝐴 Struct 〈1, 8〉) |
| 9 | basendxnn 13096 | . . . . 5 ⊢ (Base‘ndx) ∈ ℕ | |
| 10 | opexg 4314 | . . . . 5 ⊢ (((Base‘ndx) ∈ ℕ ∧ 𝐵 ∈ 𝑉) → 〈(Base‘ndx), 𝐵〉 ∈ V) | |
| 11 | 9, 2, 10 | sylancr 414 | . . . 4 ⊢ (𝜑 → 〈(Base‘ndx), 𝐵〉 ∈ V) |
| 12 | tpid1g 3779 | . . . 4 ⊢ (〈(Base‘ndx), 𝐵〉 ∈ V → 〈(Base‘ndx), 𝐵〉 ∈ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(.r‘ndx), × 〉}) | |
| 13 | elun1 3371 | . . . 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 2323 | . 2 ⊢ (𝜑 → 〈(Base‘ndx), 𝐵〉 ∈ 𝐴) |
| 16 | 8, 2, 15 | opelstrbas 13156 | 1 ⊢ (𝜑 → 𝐵 = (Base‘𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 Vcvv 2799 ∪ cun 3195 {ctp 3668 〈cop 3669 ‘cfv 5318 1c1 8008 ℕcn 9118 8c8 9175 ndxcnx 13037 Basecbs 13040 +gcplusg 13118 .rcmulr 13119 Scalarcsca 13121 ·𝑠 cvsca 13122 ·𝑖cip 13123 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8098 ax-resscn 8099 ax-1cn 8100 ax-1re 8101 ax-icn 8102 ax-addcl 8103 ax-addrcl 8104 ax-mulcl 8105 ax-addcom 8107 ax-addass 8109 ax-distr 8111 ax-i2m1 8112 ax-0lt1 8113 ax-0id 8115 ax-rnegex 8116 ax-cnre 8118 ax-pre-ltirr 8119 ax-pre-ltwlin 8120 ax-pre-lttrn 8121 ax-pre-apti 8122 ax-pre-ltadd 8123 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-tp 3674 df-op 3675 df-uni 3889 df-int 3924 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-pnf 8191 df-mnf 8192 df-xr 8193 df-ltxr 8194 df-le 8195 df-sub 8327 df-neg 8328 df-inn 9119 df-2 9177 df-3 9178 df-4 9179 df-5 9180 df-6 9181 df-7 9182 df-8 9183 df-n0 9378 df-z 9455 df-uz 9731 df-fz 10213 df-struct 13042 df-ndx 13043 df-slot 13044 df-base 13046 df-plusg 13131 df-mulr 13132 df-sca 13134 df-vsca 13135 df-ip 13136 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |