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 2997 | . . 3 ⊢ (𝐸‘ndx) ≠ (·𝑖‘ndx) |
4 | 1, 3 | setsnid 16838 | . 2 ⊢ (𝐸‘((subringAlg ‘ℂfld)‘ℝ)) = (𝐸‘(((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉)) |
5 | eqidd 2739 | . . . 4 ⊢ (⊤ → ((subringAlg ‘ℂfld)‘ℝ) = ((subringAlg ‘ℂfld)‘ℝ)) | |
6 | ax-resscn 10859 | . . . . . 6 ⊢ ℝ ⊆ ℂ | |
7 | cnfldbas 20514 | . . . . . 6 ⊢ ℂ = (Base‘ℂfld) | |
8 | 6, 7 | sseqtri 3953 | . . . . 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 20354 | . . 3 ⊢ (⊤ → (𝐸‘ℂfld) = (𝐸‘((subringAlg ‘ℂfld)‘ℝ))) |
13 | 12 | mptru 1546 | . 2 ⊢ (𝐸‘ℂfld) = (𝐸‘((subringAlg ‘ℂfld)‘ℝ)) |
14 | cchhl.c | . . 3 ⊢ 𝐶 = (((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉) | |
15 | 14 | fveq2i 6759 | . 2 ⊢ (𝐸‘𝐶) = (𝐸‘(((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉)) |
16 | 4, 13, 15 | 3eqtr4i 2776 | 1 ⊢ (𝐸‘ℂfld) = (𝐸‘𝐶) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 ⊤wtru 1540 ≠ wne 2942 ⊆ wss 3883 〈cop 4564 ‘cfv 6418 (class class class)co 7255 ∈ cmpo 7257 ℂcc 10800 ℝcr 10801 · cmul 10807 ∗ccj 14735 sSet csts 16792 Slot cslot 16810 ndxcnx 16822 Basecbs 16840 Scalarcsca 16891 ·𝑠 cvsca 16892 ·𝑖cip 16893 subringAlg csra 20345 ℂfldccnfld 20510 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-6 11970 df-7 11971 df-8 11972 df-9 11973 df-n0 12164 df-z 12250 df-dec 12367 df-uz 12512 df-fz 13169 df-struct 16776 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-plusg 16901 df-mulr 16902 df-starv 16903 df-tset 16907 df-ple 16908 df-ds 16910 df-unif 16911 df-sra 20349 df-cnfld 20511 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |