| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cchhllem | Structured version Visualization version GIF version | ||
| Description: Lemma for chlbas and chlvsca . (Contributed by Thierry Arnoux, 15-Apr-2019.) (Revised by AV, 29-Oct-2024.) |
| Ref | Expression |
|---|---|
| cchhl.c | ⊢ 𝐶 = (((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉) |
| cchhllem.1 | ⊢ 𝐸 = Slot (𝐸‘ndx) |
| cchhllem.2 | ⊢ (Scalar‘ndx) ≠ (𝐸‘ndx) |
| cchhllem.3 | ⊢ ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx) |
| cchhllem.4 | ⊢ (·𝑖‘ndx) ≠ (𝐸‘ndx) |
| Ref | Expression |
|---|---|
| cchhllem | ⊢ (𝐸‘ℂfld) = (𝐸‘𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cchhllem.1 | . . 3 ⊢ 𝐸 = Slot (𝐸‘ndx) | |
| 2 | cchhllem.4 | . . . 4 ⊢ (·𝑖‘ndx) ≠ (𝐸‘ndx) | |
| 3 | 2 | necomi 2987 | . . 3 ⊢ (𝐸‘ndx) ≠ (·𝑖‘ndx) |
| 4 | 1, 3 | setsnid 17172 | . 2 ⊢ (𝐸‘((subringAlg ‘ℂfld)‘ℝ)) = (𝐸‘(((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉)) |
| 5 | eqidd 2738 | . . . 4 ⊢ (⊤ → ((subringAlg ‘ℂfld)‘ℝ) = ((subringAlg ‘ℂfld)‘ℝ)) | |
| 6 | ax-resscn 11089 | . . . . . 6 ⊢ ℝ ⊆ ℂ | |
| 7 | cnfldbas 21351 | . . . . . 6 ⊢ ℂ = (Base‘ℂfld) | |
| 8 | 6, 7 | sseqtri 3971 | . . . . 5 ⊢ ℝ ⊆ (Base‘ℂfld) |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (⊤ → ℝ ⊆ (Base‘ℂfld)) |
| 10 | cchhllem.2 | . . . 4 ⊢ (Scalar‘ndx) ≠ (𝐸‘ndx) | |
| 11 | cchhllem.3 | . . . 4 ⊢ ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx) | |
| 12 | 5, 9, 1, 10, 11, 2 | sralem 21166 | . . 3 ⊢ (⊤ → (𝐸‘ℂfld) = (𝐸‘((subringAlg ‘ℂfld)‘ℝ))) |
| 13 | 12 | mptru 1549 | . 2 ⊢ (𝐸‘ℂfld) = (𝐸‘((subringAlg ‘ℂfld)‘ℝ)) |
| 14 | cchhl.c | . . 3 ⊢ 𝐶 = (((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉) | |
| 15 | 14 | fveq2i 6838 | . 2 ⊢ (𝐸‘𝐶) = (𝐸‘(((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉)) |
| 16 | 4, 13, 15 | 3eqtr4i 2770 | 1 ⊢ (𝐸‘ℂfld) = (𝐸‘𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ⊤wtru 1543 ≠ wne 2933 ⊆ wss 3890 〈cop 4574 ‘cfv 6493 (class class class)co 7361 ∈ cmpo 7363 ℂcc 11030 ℝcr 11031 · cmul 11037 ∗ccj 15052 sSet csts 17127 Slot cslot 17145 ndxcnx 17157 Basecbs 17173 Scalarcsca 17217 ·𝑠 cvsca 17218 ·𝑖cip 17219 subringAlg csra 21161 ℂfldccnfld 21347 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-nn 12169 df-2 12238 df-3 12239 df-4 12240 df-5 12241 df-6 12242 df-7 12243 df-8 12244 df-9 12245 df-n0 12432 df-z 12519 df-dec 12639 df-uz 12783 df-fz 13456 df-struct 17111 df-sets 17128 df-slot 17146 df-ndx 17158 df-base 17174 df-plusg 17227 df-mulr 17228 df-starv 17229 df-tset 17233 df-ple 17234 df-ds 17236 df-unif 17237 df-sra 21163 df-cnfld 21348 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |