![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cchhllemOLD | Structured version Visualization version GIF version |
Description: Obsolete version of cchhllem 28820 as of 29-Oct-2024. Lemma for chlbas and chlvsca . (Contributed by Thierry Arnoux, 15-Apr-2019.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cchhl.c | ⊢ 𝐶 = (((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉) |
cchhllemOLD.2 | ⊢ 𝐸 = Slot 𝑁 |
cchhllemOLD.3 | ⊢ 𝑁 ∈ ℕ |
cchhllemOLD.4 | ⊢ (𝑁 < 5 ∨ 8 < 𝑁) |
Ref | Expression |
---|---|
cchhllemOLD | ⊢ (𝐸‘ℂfld) = (𝐸‘𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cchhllemOLD.2 | . . . 4 ⊢ 𝐸 = Slot 𝑁 | |
2 | cchhllemOLD.3 | . . . 4 ⊢ 𝑁 ∈ ℕ | |
3 | 1, 2 | ndxid 17199 | . . 3 ⊢ 𝐸 = Slot (𝐸‘ndx) |
4 | cchhllemOLD.4 | . . . . 5 ⊢ (𝑁 < 5 ∨ 8 < 𝑁) | |
5 | 5lt8 12458 | . . . . . . . . 9 ⊢ 5 < 8 | |
6 | 2 | nnrei 12273 | . . . . . . . . . 10 ⊢ 𝑁 ∈ ℝ |
7 | 5re 12351 | . . . . . . . . . 10 ⊢ 5 ∈ ℝ | |
8 | 8re 12360 | . . . . . . . . . 10 ⊢ 8 ∈ ℝ | |
9 | 6, 7, 8 | lttri 11390 | . . . . . . . . 9 ⊢ ((𝑁 < 5 ∧ 5 < 8) → 𝑁 < 8) |
10 | 5, 9 | mpan2 689 | . . . . . . . 8 ⊢ (𝑁 < 5 → 𝑁 < 8) |
11 | 6, 8 | ltnei 11388 | . . . . . . . 8 ⊢ (𝑁 < 8 → 8 ≠ 𝑁) |
12 | 10, 11 | syl 17 | . . . . . . 7 ⊢ (𝑁 < 5 → 8 ≠ 𝑁) |
13 | 12 | necomd 2986 | . . . . . 6 ⊢ (𝑁 < 5 → 𝑁 ≠ 8) |
14 | 8, 6 | ltnei 11388 | . . . . . 6 ⊢ (8 < 𝑁 → 𝑁 ≠ 8) |
15 | 13, 14 | jaoi 855 | . . . . 5 ⊢ ((𝑁 < 5 ∨ 8 < 𝑁) → 𝑁 ≠ 8) |
16 | 4, 15 | ax-mp 5 | . . . 4 ⊢ 𝑁 ≠ 8 |
17 | 1, 2 | ndxarg 17198 | . . . . 5 ⊢ (𝐸‘ndx) = 𝑁 |
18 | ipndx 17344 | . . . . 5 ⊢ (·𝑖‘ndx) = 8 | |
19 | 17, 18 | neeq12i 2997 | . . . 4 ⊢ ((𝐸‘ndx) ≠ (·𝑖‘ndx) ↔ 𝑁 ≠ 8) |
20 | 16, 19 | mpbir 230 | . . 3 ⊢ (𝐸‘ndx) ≠ (·𝑖‘ndx) |
21 | 3, 20 | setsnid 17211 | . 2 ⊢ (𝐸‘((subringAlg ‘ℂfld)‘ℝ)) = (𝐸‘(((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉)) |
22 | eqidd 2727 | . . . 4 ⊢ (⊤ → ((subringAlg ‘ℂfld)‘ℝ) = ((subringAlg ‘ℂfld)‘ℝ)) | |
23 | ax-resscn 11215 | . . . . . 6 ⊢ ℝ ⊆ ℂ | |
24 | cnfldbas 21347 | . . . . . 6 ⊢ ℂ = (Base‘ℂfld) | |
25 | 23, 24 | sseqtri 4016 | . . . . 5 ⊢ ℝ ⊆ (Base‘ℂfld) |
26 | 25 | a1i 11 | . . . 4 ⊢ (⊤ → ℝ ⊆ (Base‘ℂfld)) |
27 | 22, 26, 1, 2, 4 | sralemOLD 21155 | . . 3 ⊢ (⊤ → (𝐸‘ℂfld) = (𝐸‘((subringAlg ‘ℂfld)‘ℝ))) |
28 | 27 | mptru 1541 | . 2 ⊢ (𝐸‘ℂfld) = (𝐸‘((subringAlg ‘ℂfld)‘ℝ)) |
29 | cchhl.c | . . 3 ⊢ 𝐶 = (((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉) | |
30 | 29 | fveq2i 6904 | . 2 ⊢ (𝐸‘𝐶) = (𝐸‘(((subringAlg ‘ℂfld)‘ℝ) sSet 〈(·𝑖‘ndx), (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · (∗‘𝑦)))〉)) |
31 | 21, 28, 30 | 3eqtr4i 2764 | 1 ⊢ (𝐸‘ℂfld) = (𝐸‘𝐶) |
Colors of variables: wff setvar class |
Syntax hints: ∨ wo 845 = wceq 1534 ⊤wtru 1535 ∈ wcel 2099 ≠ wne 2930 ⊆ wss 3947 〈cop 4639 class class class wbr 5153 ‘cfv 6554 (class class class)co 7424 ∈ cmpo 7426 ℂcc 11156 ℝcr 11157 · cmul 11163 < clt 11298 ℕcn 12264 5c5 12322 8c8 12325 ∗ccj 15101 sSet csts 17165 Slot cslot 17183 ndxcnx 17195 Basecbs 17213 ·𝑖cip 17271 subringAlg csra 21149 ℂfldccnfld 21343 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-rep 5290 ax-sep 5304 ax-nul 5311 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-cnex 11214 ax-resscn 11215 ax-1cn 11216 ax-icn 11217 ax-addcl 11218 ax-addrcl 11219 ax-mulcl 11220 ax-mulrcl 11221 ax-mulcom 11222 ax-addass 11223 ax-mulass 11224 ax-distr 11225 ax-i2m1 11226 ax-1ne0 11227 ax-1rid 11228 ax-rnegex 11229 ax-rrecex 11230 ax-cnre 11231 ax-pre-lttri 11232 ax-pre-lttrn 11233 ax-pre-ltadd 11234 ax-pre-mulgt0 11235 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3365 df-rab 3420 df-v 3464 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3967 df-nul 4326 df-if 4534 df-pw 4609 df-sn 4634 df-pr 4636 df-tp 4638 df-op 4640 df-uni 4914 df-iun 5003 df-br 5154 df-opab 5216 df-mpt 5237 df-tr 5271 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6312 df-ord 6379 df-on 6380 df-lim 6381 df-suc 6382 df-iota 6506 df-fun 6556 df-fn 6557 df-f 6558 df-f1 6559 df-fo 6560 df-f1o 6561 df-fv 6562 df-riota 7380 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7877 df-1st 8003 df-2nd 8004 df-frecs 8296 df-wrecs 8327 df-recs 8401 df-rdg 8440 df-1o 8496 df-er 8734 df-en 8975 df-dom 8976 df-sdom 8977 df-fin 8978 df-pnf 11300 df-mnf 11301 df-xr 11302 df-ltxr 11303 df-le 11304 df-sub 11496 df-neg 11497 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-9 12334 df-n0 12525 df-z 12611 df-dec 12730 df-uz 12875 df-fz 13539 df-struct 17149 df-sets 17166 df-slot 17184 df-ndx 17196 df-base 17214 df-plusg 17279 df-mulr 17280 df-starv 17281 df-sca 17282 df-vsca 17283 df-ip 17284 df-tset 17285 df-ple 17286 df-ds 17288 df-unif 17289 df-sra 21151 df-cnfld 21344 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |