![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > hlhilslemOLD | Structured version Visualization version GIF version |
Description: Obsolete version of hlhilslem 41921 as of 6-Nov-2024. Lemma for hlhilsbase 41923. (Contributed by Mario Carneiro, 28-Jun-2015.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
hlhilslem.h | ⊢ 𝐻 = (LHyp‘𝐾) |
hlhilslem.e | ⊢ 𝐸 = ((EDRing‘𝐾)‘𝑊) |
hlhilslem.u | ⊢ 𝑈 = ((HLHil‘𝐾)‘𝑊) |
hlhilslem.r | ⊢ 𝑅 = (Scalar‘𝑈) |
hlhilslem.k | ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) |
hlhilslemOLD.f | ⊢ 𝐹 = Slot 𝑁 |
hlhilslemOLD.1 | ⊢ 𝑁 ∈ ℕ |
hlhilslemOLD.2 | ⊢ 𝑁 < 4 |
hlhilslemOLD.c | ⊢ 𝐶 = (𝐹‘𝐸) |
Ref | Expression |
---|---|
hlhilslemOLD | ⊢ (𝜑 → 𝐶 = (𝐹‘𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hlhilslemOLD.c | . . 3 ⊢ 𝐶 = (𝐹‘𝐸) | |
2 | hlhilslemOLD.f | . . . . 5 ⊢ 𝐹 = Slot 𝑁 | |
3 | hlhilslemOLD.1 | . . . . 5 ⊢ 𝑁 ∈ ℕ | |
4 | 2, 3 | ndxid 17231 | . . . 4 ⊢ 𝐹 = Slot (𝐹‘ndx) |
5 | 3 | nnrei 12273 | . . . . . 6 ⊢ 𝑁 ∈ ℝ |
6 | hlhilslemOLD.2 | . . . . . 6 ⊢ 𝑁 < 4 | |
7 | 5, 6 | ltneii 11372 | . . . . 5 ⊢ 𝑁 ≠ 4 |
8 | 2, 3 | ndxarg 17230 | . . . . . 6 ⊢ (𝐹‘ndx) = 𝑁 |
9 | starvndx 17348 | . . . . . 6 ⊢ (*𝑟‘ndx) = 4 | |
10 | 8, 9 | neeq12i 3005 | . . . . 5 ⊢ ((𝐹‘ndx) ≠ (*𝑟‘ndx) ↔ 𝑁 ≠ 4) |
11 | 7, 10 | mpbir 231 | . . . 4 ⊢ (𝐹‘ndx) ≠ (*𝑟‘ndx) |
12 | 4, 11 | setsnid 17243 | . . 3 ⊢ (𝐹‘𝐸) = (𝐹‘(𝐸 sSet 〈(*𝑟‘ndx), ((HGMap‘𝐾)‘𝑊)〉)) |
13 | 1, 12 | eqtri 2763 | . 2 ⊢ 𝐶 = (𝐹‘(𝐸 sSet 〈(*𝑟‘ndx), ((HGMap‘𝐾)‘𝑊)〉)) |
14 | hlhilslem.h | . . . . 5 ⊢ 𝐻 = (LHyp‘𝐾) | |
15 | hlhilslem.u | . . . . 5 ⊢ 𝑈 = ((HLHil‘𝐾)‘𝑊) | |
16 | hlhilslem.k | . . . . 5 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
17 | hlhilslem.e | . . . . 5 ⊢ 𝐸 = ((EDRing‘𝐾)‘𝑊) | |
18 | eqid 2735 | . . . . 5 ⊢ ((HGMap‘𝐾)‘𝑊) = ((HGMap‘𝐾)‘𝑊) | |
19 | eqid 2735 | . . . . 5 ⊢ (𝐸 sSet 〈(*𝑟‘ndx), ((HGMap‘𝐾)‘𝑊)〉) = (𝐸 sSet 〈(*𝑟‘ndx), ((HGMap‘𝐾)‘𝑊)〉) | |
20 | 14, 15, 16, 17, 18, 19 | hlhilsca 41918 | . . . 4 ⊢ (𝜑 → (𝐸 sSet 〈(*𝑟‘ndx), ((HGMap‘𝐾)‘𝑊)〉) = (Scalar‘𝑈)) |
21 | hlhilslem.r | . . . 4 ⊢ 𝑅 = (Scalar‘𝑈) | |
22 | 20, 21 | eqtr4di 2793 | . . 3 ⊢ (𝜑 → (𝐸 sSet 〈(*𝑟‘ndx), ((HGMap‘𝐾)‘𝑊)〉) = 𝑅) |
23 | 22 | fveq2d 6911 | . 2 ⊢ (𝜑 → (𝐹‘(𝐸 sSet 〈(*𝑟‘ndx), ((HGMap‘𝐾)‘𝑊)〉)) = (𝐹‘𝑅)) |
24 | 13, 23 | eqtrid 2787 | 1 ⊢ (𝜑 → 𝐶 = (𝐹‘𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ≠ wne 2938 〈cop 4637 class class class wbr 5148 ‘cfv 6563 (class class class)co 7431 < clt 11293 ℕcn 12264 4c4 12321 sSet csts 17197 Slot cslot 17215 ndxcnx 17227 *𝑟cstv 17300 Scalarcsca 17301 HLchlt 39332 LHypclh 39967 EDRingcedring 40736 HGMapchg 41866 HLHilchlh 41915 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-tp 4636 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-n0 12525 df-z 12612 df-uz 12877 df-fz 13545 df-struct 17181 df-sets 17198 df-slot 17216 df-ndx 17228 df-base 17246 df-plusg 17311 df-starv 17313 df-sca 17314 df-vsca 17315 df-ip 17316 df-hlhil 41916 |
This theorem is referenced by: hlhilsbaseOLD 41924 hlhilsplusOLD 41926 hlhilsmulOLD 41928 |
Copyright terms: Public domain | W3C validator |