| 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 2986 | . . 3 ⊢ (𝐸‘ndx) ≠ (·𝑖‘ndx) |
| 4 | 1, 3 | setsnid 17135 | . 2 ⊢ (𝐸‘((subringAlg ‘ℂfld)‘ℝ)) = (𝐸‘(((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉)) |
| 5 | eqidd 2737 | . . . 4 ⊢ (⊤ → ((subringAlg ‘ℂfld)‘ℝ) = ((subringAlg ‘ℂfld)‘ℝ)) | |
| 6 | ax-resscn 11083 | . . . . . 6 ⊢ ℝ ⊆ ℂ | |
| 7 | cnfldbas 21313 | . . . . . 6 ⊢ ℂ = (Base‘ℂfld) | |
| 8 | 6, 7 | sseqtri 3982 | . . . . 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 21128 | . . 3 ⊢ (⊤ → (𝐸‘ℂfld) = (𝐸‘((subringAlg ‘ℂfld)‘ℝ))) |
| 13 | 12 | mptru 1548 | . 2 ⊢ (𝐸‘ℂfld) = (𝐸‘((subringAlg ‘ℂfld)‘ℝ)) |
| 14 | cchhl.c | . . 3 ⊢ 𝐶 = (((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉) | |
| 15 | 14 | fveq2i 6837 | . 2 ⊢ (𝐸‘𝐶) = (𝐸‘(((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉)) |
| 16 | 4, 13, 15 | 3eqtr4i 2769 | 1 ⊢ (𝐸‘ℂfld) = (𝐸‘𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 ⊤wtru 1542 ≠ wne 2932 ⊆ wss 3901 〈cop 4586 ‘cfv 6492 (class class class)co 7358 ∈ cmpo 7360 ℂcc 11024 ℝcr 11025 · cmul 11031 ∗ccj 15019 sSet csts 17090 Slot cslot 17108 ndxcnx 17120 Basecbs 17136 Scalarcsca 17180 ·𝑠 cvsca 17181 ·𝑖cip 17182 subringAlg csra 21123 ℂfldccnfld 21309 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-5 12211 df-6 12212 df-7 12213 df-8 12214 df-9 12215 df-n0 12402 df-z 12489 df-dec 12608 df-uz 12752 df-fz 13424 df-struct 17074 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-plusg 17190 df-mulr 17191 df-starv 17192 df-tset 17196 df-ple 17197 df-ds 17199 df-unif 17200 df-sra 21125 df-cnfld 21310 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |