![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > tnglemOLD | Structured version Visualization version GIF version |
Description: Obsolete version of tnglem 24668 as of 31-Oct-2024. Lemma for tngbas 24670 and similar theorems. (Contributed by Mario Carneiro, 2-Oct-2015.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
tngbas.t | ⊢ 𝑇 = (𝐺 toNrmGrp 𝑁) |
tnglemOLD.2 | ⊢ 𝐸 = Slot 𝐾 |
tnglemOLD.3 | ⊢ 𝐾 ∈ ℕ |
tnglemOLD.4 | ⊢ 𝐾 < 9 |
Ref | Expression |
---|---|
tnglemOLD | ⊢ (𝑁 ∈ 𝑉 → (𝐸‘𝐺) = (𝐸‘𝑇)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tnglemOLD.2 | . . . . . 6 ⊢ 𝐸 = Slot 𝐾 | |
2 | tnglemOLD.3 | . . . . . 6 ⊢ 𝐾 ∈ ℕ | |
3 | 1, 2 | ndxid 17230 | . . . . 5 ⊢ 𝐸 = Slot (𝐸‘ndx) |
4 | 1, 2 | ndxarg 17229 | . . . . . . . 8 ⊢ (𝐸‘ndx) = 𝐾 |
5 | 2 | nnrei 12272 | . . . . . . . 8 ⊢ 𝐾 ∈ ℝ |
6 | 4, 5 | eqeltri 2834 | . . . . . . 7 ⊢ (𝐸‘ndx) ∈ ℝ |
7 | tnglemOLD.4 | . . . . . . . . 9 ⊢ 𝐾 < 9 | |
8 | 4, 7 | eqbrtri 5168 | . . . . . . . 8 ⊢ (𝐸‘ndx) < 9 |
9 | 1nn 12274 | . . . . . . . . 9 ⊢ 1 ∈ ℕ | |
10 | 2nn0 12540 | . . . . . . . . 9 ⊢ 2 ∈ ℕ0 | |
11 | 9nn0 12547 | . . . . . . . . 9 ⊢ 9 ∈ ℕ0 | |
12 | 9lt10 12861 | . . . . . . . . 9 ⊢ 9 < ;10 | |
13 | 9, 10, 11, 12 | declti 12768 | . . . . . . . 8 ⊢ 9 < ;12 |
14 | 9re 12362 | . . . . . . . . 9 ⊢ 9 ∈ ℝ | |
15 | 1nn0 12539 | . . . . . . . . . . 11 ⊢ 1 ∈ ℕ0 | |
16 | 15, 10 | deccl 12745 | . . . . . . . . . 10 ⊢ ;12 ∈ ℕ0 |
17 | 16 | nn0rei 12534 | . . . . . . . . 9 ⊢ ;12 ∈ ℝ |
18 | 6, 14, 17 | lttri 11384 | . . . . . . . 8 ⊢ (((𝐸‘ndx) < 9 ∧ 9 < ;12) → (𝐸‘ndx) < ;12) |
19 | 8, 13, 18 | mp2an 692 | . . . . . . 7 ⊢ (𝐸‘ndx) < ;12 |
20 | 6, 19 | ltneii 11371 | . . . . . 6 ⊢ (𝐸‘ndx) ≠ ;12 |
21 | dsndx 17430 | . . . . . 6 ⊢ (dist‘ndx) = ;12 | |
22 | 20, 21 | neeqtrri 3011 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (dist‘ndx) |
23 | 3, 22 | setsnid 17242 | . . . 4 ⊢ (𝐸‘𝐺) = (𝐸‘(𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉)) |
24 | 6, 8 | ltneii 11371 | . . . . . 6 ⊢ (𝐸‘ndx) ≠ 9 |
25 | tsetndx 17397 | . . . . . 6 ⊢ (TopSet‘ndx) = 9 | |
26 | 24, 25 | neeqtrri 3011 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (TopSet‘ndx) |
27 | 3, 26 | setsnid 17242 | . . . 4 ⊢ (𝐸‘(𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉)) = (𝐸‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉)) |
28 | 23, 27 | eqtri 2762 | . . 3 ⊢ (𝐸‘𝐺) = (𝐸‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉)) |
29 | tngbas.t | . . . . 5 ⊢ 𝑇 = (𝐺 toNrmGrp 𝑁) | |
30 | eqid 2734 | . . . . 5 ⊢ (-g‘𝐺) = (-g‘𝐺) | |
31 | eqid 2734 | . . . . 5 ⊢ (𝑁 ∘ (-g‘𝐺)) = (𝑁 ∘ (-g‘𝐺)) | |
32 | eqid 2734 | . . . . 5 ⊢ (MetOpen‘(𝑁 ∘ (-g‘𝐺))) = (MetOpen‘(𝑁 ∘ (-g‘𝐺))) | |
33 | 29, 30, 31, 32 | tngval 24667 | . . . 4 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → 𝑇 = ((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉)) |
34 | 33 | fveq2d 6910 | . . 3 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝑇) = (𝐸‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉))) |
35 | 28, 34 | eqtr4id 2793 | . 2 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝐺) = (𝐸‘𝑇)) |
36 | 1 | str0 17222 | . . 3 ⊢ ∅ = (𝐸‘∅) |
37 | fvprc 6898 | . . . 4 ⊢ (¬ 𝐺 ∈ V → (𝐸‘𝐺) = ∅) | |
38 | 37 | adantr 480 | . . 3 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝐺) = ∅) |
39 | reldmtng 24666 | . . . . . . 7 ⊢ Rel dom toNrmGrp | |
40 | 39 | ovprc1 7469 | . . . . . 6 ⊢ (¬ 𝐺 ∈ V → (𝐺 toNrmGrp 𝑁) = ∅) |
41 | 40 | adantr 480 | . . . . 5 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐺 toNrmGrp 𝑁) = ∅) |
42 | 29, 41 | eqtrid 2786 | . . . 4 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → 𝑇 = ∅) |
43 | 42 | fveq2d 6910 | . . 3 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝑇) = (𝐸‘∅)) |
44 | 36, 38, 43 | 3eqtr4a 2800 | . 2 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝐺) = (𝐸‘𝑇)) |
45 | 35, 44 | pm2.61ian 812 | 1 ⊢ (𝑁 ∈ 𝑉 → (𝐸‘𝐺) = (𝐸‘𝑇)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1536 ∈ wcel 2105 Vcvv 3477 ∅c0 4338 〈cop 4636 class class class wbr 5147 ∘ ccom 5692 ‘cfv 6562 (class class class)co 7430 ℝcr 11151 1c1 11153 < clt 11292 ℕcn 12263 2c2 12318 9c9 12325 ;cdc 12730 sSet csts 17196 Slot cslot 17214 ndxcnx 17226 TopSetcts 17303 distcds 17306 -gcsg 18965 MetOpencmopn 21371 toNrmGrp ctng 24606 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 ax-cnex 11208 ax-resscn 11209 ax-1cn 11210 ax-icn 11211 ax-addcl 11212 ax-addrcl 11213 ax-mulcl 11214 ax-mulrcl 11215 ax-mulcom 11216 ax-addass 11217 ax-mulass 11218 ax-distr 11219 ax-i2m1 11220 ax-1ne0 11221 ax-1rid 11222 ax-rnegex 11223 ax-rrecex 11224 ax-cnre 11225 ax-pre-lttri 11226 ax-pre-lttrn 11227 ax-pre-ltadd 11228 ax-pre-mulgt0 11229 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7887 df-2nd 8013 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-er 8743 df-en 8984 df-dom 8985 df-sdom 8986 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11491 df-neg 11492 df-nn 12264 df-2 12326 df-3 12327 df-4 12328 df-5 12329 df-6 12330 df-7 12331 df-8 12332 df-9 12333 df-n0 12524 df-z 12611 df-dec 12731 df-sets 17197 df-slot 17215 df-ndx 17227 df-tset 17316 df-ds 17319 df-tng 24612 |
This theorem is referenced by: tngbasOLD 24671 tngplusgOLD 24673 tngmulrOLD 24676 tngscaOLD 24678 tngvscaOLD 24680 tngipOLD 24682 |
Copyright terms: Public domain | W3C validator |