Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > zlmtsetOLD | Structured version Visualization version GIF version |
Description: Obsolete proof of zlmtset 31902 as of 11-Nov-2024. Topology in a ℤ -module (if present). (Contributed by Thierry Arnoux, 8-Nov-2017.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
zlmlem2.1 | ⊢ 𝑊 = (ℤMod‘𝐺) |
zlmtset.1 | ⊢ 𝐽 = (TopSet‘𝐺) |
Ref | Expression |
---|---|
zlmtsetOLD | ⊢ (𝐺 ∈ 𝑉 → 𝐽 = (TopSet‘𝑊)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zlmtset.1 | . . 3 ⊢ 𝐽 = (TopSet‘𝐺) | |
2 | tsetid 17053 | . . . 4 ⊢ TopSet = Slot (TopSet‘ndx) | |
3 | 5re 12052 | . . . . . 6 ⊢ 5 ∈ ℝ | |
4 | 5lt9 12167 | . . . . . 6 ⊢ 5 < 9 | |
5 | 3, 4 | gtneii 11079 | . . . . 5 ⊢ 9 ≠ 5 |
6 | tsetndx 17052 | . . . . . 6 ⊢ (TopSet‘ndx) = 9 | |
7 | scandx 17014 | . . . . . 6 ⊢ (Scalar‘ndx) = 5 | |
8 | 6, 7 | neeq12i 3012 | . . . . 5 ⊢ ((TopSet‘ndx) ≠ (Scalar‘ndx) ↔ 9 ≠ 5) |
9 | 5, 8 | mpbir 230 | . . . 4 ⊢ (TopSet‘ndx) ≠ (Scalar‘ndx) |
10 | 2, 9 | setsnid 16900 | . . 3 ⊢ (TopSet‘𝐺) = (TopSet‘(𝐺 sSet 〈(Scalar‘ndx), ℤring〉)) |
11 | 6re 12055 | . . . . . 6 ⊢ 6 ∈ ℝ | |
12 | 6lt9 12166 | . . . . . 6 ⊢ 6 < 9 | |
13 | 11, 12 | gtneii 11079 | . . . . 5 ⊢ 9 ≠ 6 |
14 | vscandx 17019 | . . . . . 6 ⊢ ( ·𝑠 ‘ndx) = 6 | |
15 | 6, 14 | neeq12i 3012 | . . . . 5 ⊢ ((TopSet‘ndx) ≠ ( ·𝑠 ‘ndx) ↔ 9 ≠ 6) |
16 | 13, 15 | mpbir 230 | . . . 4 ⊢ (TopSet‘ndx) ≠ ( ·𝑠 ‘ndx) |
17 | 2, 16 | setsnid 16900 | . . 3 ⊢ (TopSet‘(𝐺 sSet 〈(Scalar‘ndx), ℤring〉)) = (TopSet‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
18 | 1, 10, 17 | 3eqtri 2772 | . 2 ⊢ 𝐽 = (TopSet‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
19 | zlmlem2.1 | . . . 4 ⊢ 𝑊 = (ℤMod‘𝐺) | |
20 | eqid 2740 | . . . 4 ⊢ (.g‘𝐺) = (.g‘𝐺) | |
21 | 19, 20 | zlmval 20707 | . . 3 ⊢ (𝐺 ∈ 𝑉 → 𝑊 = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
22 | 21 | fveq2d 6773 | . 2 ⊢ (𝐺 ∈ 𝑉 → (TopSet‘𝑊) = (TopSet‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉))) |
23 | 18, 22 | eqtr4id 2799 | 1 ⊢ (𝐺 ∈ 𝑉 → 𝐽 = (TopSet‘𝑊)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2110 ≠ wne 2945 〈cop 4573 ‘cfv 6431 (class class class)co 7269 5c5 12023 6c6 12024 9c9 12027 sSet csts 16854 ndxcnx 16884 Scalarcsca 16955 ·𝑠 cvsca 16956 TopSetcts 16958 .gcmg 18690 ℤringczring 20660 ℤModczlm 20692 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7580 ax-cnex 10920 ax-resscn 10921 ax-1cn 10922 ax-icn 10923 ax-addcl 10924 ax-addrcl 10925 ax-mulcl 10926 ax-mulrcl 10927 ax-mulcom 10928 ax-addass 10929 ax-mulass 10930 ax-distr 10931 ax-i2m1 10932 ax-1ne0 10933 ax-1rid 10934 ax-rnegex 10935 ax-rrecex 10936 ax-cnre 10937 ax-pre-lttri 10938 ax-pre-lttrn 10939 ax-pre-ltadd 10940 ax-pre-mulgt0 10941 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ne 2946 df-nel 3052 df-ral 3071 df-rex 3072 df-reu 3073 df-rab 3075 df-v 3433 df-sbc 3721 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4846 df-iun 4932 df-br 5080 df-opab 5142 df-mpt 5163 df-tr 5197 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6200 df-ord 6267 df-on 6268 df-lim 6269 df-suc 6270 df-iota 6389 df-fun 6433 df-fn 6434 df-f 6435 df-f1 6436 df-fo 6437 df-f1o 6438 df-fv 6439 df-riota 7226 df-ov 7272 df-oprab 7273 df-mpo 7274 df-om 7702 df-2nd 7819 df-frecs 8082 df-wrecs 8113 df-recs 8187 df-rdg 8226 df-er 8473 df-en 8709 df-dom 8710 df-sdom 8711 df-pnf 11004 df-mnf 11005 df-xr 11006 df-ltxr 11007 df-le 11008 df-sub 11199 df-neg 11200 df-nn 11966 df-2 12028 df-3 12029 df-4 12030 df-5 12031 df-6 12032 df-7 12033 df-8 12034 df-9 12035 df-sets 16855 df-slot 16873 df-ndx 16885 df-sca 16968 df-vsca 16969 df-tset 16971 df-zlm 20696 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |