Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > tnglem | Structured version Visualization version GIF version |
Description: Lemma for tngbas 23244 and similar theorems. (Contributed by Mario Carneiro, 2-Oct-2015.) |
Ref | Expression |
---|---|
tngbas.t | ⊢ 𝑇 = (𝐺 toNrmGrp 𝑁) |
tnglem.2 | ⊢ 𝐸 = Slot 𝐾 |
tnglem.3 | ⊢ 𝐾 ∈ ℕ |
tnglem.4 | ⊢ 𝐾 < 9 |
Ref | Expression |
---|---|
tnglem | ⊢ (𝑁 ∈ 𝑉 → (𝐸‘𝐺) = (𝐸‘𝑇)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tngbas.t | . . . . 5 ⊢ 𝑇 = (𝐺 toNrmGrp 𝑁) | |
2 | eqid 2821 | . . . . 5 ⊢ (-g‘𝐺) = (-g‘𝐺) | |
3 | eqid 2821 | . . . . 5 ⊢ (𝑁 ∘ (-g‘𝐺)) = (𝑁 ∘ (-g‘𝐺)) | |
4 | eqid 2821 | . . . . 5 ⊢ (MetOpen‘(𝑁 ∘ (-g‘𝐺))) = (MetOpen‘(𝑁 ∘ (-g‘𝐺))) | |
5 | 1, 2, 3, 4 | tngval 23242 | . . . 4 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → 𝑇 = ((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉)) |
6 | 5 | fveq2d 6668 | . . 3 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝑇) = (𝐸‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉))) |
7 | tnglem.2 | . . . . . 6 ⊢ 𝐸 = Slot 𝐾 | |
8 | tnglem.3 | . . . . . 6 ⊢ 𝐾 ∈ ℕ | |
9 | 7, 8 | ndxid 16503 | . . . . 5 ⊢ 𝐸 = Slot (𝐸‘ndx) |
10 | 7, 8 | ndxarg 16502 | . . . . . . . 8 ⊢ (𝐸‘ndx) = 𝐾 |
11 | 8 | nnrei 11641 | . . . . . . . 8 ⊢ 𝐾 ∈ ℝ |
12 | 10, 11 | eqeltri 2909 | . . . . . . 7 ⊢ (𝐸‘ndx) ∈ ℝ |
13 | tnglem.4 | . . . . . . . . 9 ⊢ 𝐾 < 9 | |
14 | 10, 13 | eqbrtri 5079 | . . . . . . . 8 ⊢ (𝐸‘ndx) < 9 |
15 | 1nn 11643 | . . . . . . . . 9 ⊢ 1 ∈ ℕ | |
16 | 2nn0 11908 | . . . . . . . . 9 ⊢ 2 ∈ ℕ0 | |
17 | 9nn0 11915 | . . . . . . . . 9 ⊢ 9 ∈ ℕ0 | |
18 | 9lt10 12223 | . . . . . . . . 9 ⊢ 9 < ;10 | |
19 | 15, 16, 17, 18 | declti 12130 | . . . . . . . 8 ⊢ 9 < ;12 |
20 | 9re 11730 | . . . . . . . . 9 ⊢ 9 ∈ ℝ | |
21 | 1nn0 11907 | . . . . . . . . . . 11 ⊢ 1 ∈ ℕ0 | |
22 | 21, 16 | deccl 12107 | . . . . . . . . . 10 ⊢ ;12 ∈ ℕ0 |
23 | 22 | nn0rei 11902 | . . . . . . . . 9 ⊢ ;12 ∈ ℝ |
24 | 12, 20, 23 | lttri 10760 | . . . . . . . 8 ⊢ (((𝐸‘ndx) < 9 ∧ 9 < ;12) → (𝐸‘ndx) < ;12) |
25 | 14, 19, 24 | mp2an 690 | . . . . . . 7 ⊢ (𝐸‘ndx) < ;12 |
26 | 12, 25 | ltneii 10747 | . . . . . 6 ⊢ (𝐸‘ndx) ≠ ;12 |
27 | dsndx 16669 | . . . . . 6 ⊢ (dist‘ndx) = ;12 | |
28 | 26, 27 | neeqtrri 3089 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (dist‘ndx) |
29 | 9, 28 | setsnid 16533 | . . . 4 ⊢ (𝐸‘𝐺) = (𝐸‘(𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉)) |
30 | 12, 14 | ltneii 10747 | . . . . . 6 ⊢ (𝐸‘ndx) ≠ 9 |
31 | tsetndx 16653 | . . . . . 6 ⊢ (TopSet‘ndx) = 9 | |
32 | 30, 31 | neeqtrri 3089 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (TopSet‘ndx) |
33 | 9, 32 | setsnid 16533 | . . . 4 ⊢ (𝐸‘(𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉)) = (𝐸‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉)) |
34 | 29, 33 | eqtri 2844 | . . 3 ⊢ (𝐸‘𝐺) = (𝐸‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉)) |
35 | 6, 34 | syl6reqr 2875 | . 2 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝐺) = (𝐸‘𝑇)) |
36 | 7 | str0 16529 | . . 3 ⊢ ∅ = (𝐸‘∅) |
37 | fvprc 6657 | . . . 4 ⊢ (¬ 𝐺 ∈ V → (𝐸‘𝐺) = ∅) | |
38 | 37 | adantr 483 | . . 3 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝐺) = ∅) |
39 | reldmtng 23241 | . . . . . . 7 ⊢ Rel dom toNrmGrp | |
40 | 39 | ovprc1 7189 | . . . . . 6 ⊢ (¬ 𝐺 ∈ V → (𝐺 toNrmGrp 𝑁) = ∅) |
41 | 40 | adantr 483 | . . . . 5 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐺 toNrmGrp 𝑁) = ∅) |
42 | 1, 41 | syl5eq 2868 | . . . 4 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → 𝑇 = ∅) |
43 | 42 | fveq2d 6668 | . . 3 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝑇) = (𝐸‘∅)) |
44 | 36, 38, 43 | 3eqtr4a 2882 | . 2 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝐺) = (𝐸‘𝑇)) |
45 | 35, 44 | pm2.61ian 810 | 1 ⊢ (𝑁 ∈ 𝑉 → (𝐸‘𝐺) = (𝐸‘𝑇)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 Vcvv 3494 ∅c0 4290 〈cop 4566 class class class wbr 5058 ∘ ccom 5553 ‘cfv 6349 (class class class)co 7150 ℝcr 10530 1c1 10532 < clt 10669 ℕcn 11632 2c2 11686 9c9 11693 ;cdc 12092 ndxcnx 16474 sSet csts 16475 Slot cslot 16476 TopSetcts 16565 distcds 16568 -gcsg 18099 MetOpencmopn 20529 toNrmGrp ctng 23182 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-3 11695 df-4 11696 df-5 11697 df-6 11698 df-7 11699 df-8 11700 df-9 11701 df-n0 11892 df-z 11976 df-dec 12093 df-ndx 16480 df-slot 16481 df-sets 16484 df-tset 16578 df-ds 16581 df-tng 23188 |
This theorem is referenced by: tngbas 23244 tngplusg 23245 tngmulr 23247 tngsca 23248 tngvsca 23249 tngip 23250 |
Copyright terms: Public domain | W3C validator |