Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > tnglem | Structured version Visualization version GIF version |
Description: Lemma for tngbas 22255 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 2610 | . . . . 5 ⊢ (-g‘𝐺) = (-g‘𝐺) | |
3 | eqid 2610 | . . . . 5 ⊢ (𝑁 ∘ (-g‘𝐺)) = (𝑁 ∘ (-g‘𝐺)) | |
4 | eqid 2610 | . . . . 5 ⊢ (MetOpen‘(𝑁 ∘ (-g‘𝐺))) = (MetOpen‘(𝑁 ∘ (-g‘𝐺))) | |
5 | 1, 2, 3, 4 | tngval 22253 | . . . 4 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → 𝑇 = ((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉)) |
6 | 5 | fveq2d 6107 | . . 3 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝑇) = (𝐸‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉))) |
7 | tnglem.2 | . . . . . 6 ⊢ 𝐸 = Slot 𝐾 | |
8 | tnglem.3 | . . . . . 6 ⊢ 𝐾 ∈ ℕ | |
9 | 7, 8 | ndxid 15716 | . . . . 5 ⊢ 𝐸 = Slot (𝐸‘ndx) |
10 | 7, 8 | ndxarg 15715 | . . . . . . . 8 ⊢ (𝐸‘ndx) = 𝐾 |
11 | 8 | nnrei 10906 | . . . . . . . 8 ⊢ 𝐾 ∈ ℝ |
12 | 10, 11 | eqeltri 2684 | . . . . . . 7 ⊢ (𝐸‘ndx) ∈ ℝ |
13 | tnglem.4 | . . . . . . . . 9 ⊢ 𝐾 < 9 | |
14 | 10, 13 | eqbrtri 4604 | . . . . . . . 8 ⊢ (𝐸‘ndx) < 9 |
15 | 1nn 10908 | . . . . . . . . 9 ⊢ 1 ∈ ℕ | |
16 | 2nn0 11186 | . . . . . . . . 9 ⊢ 2 ∈ ℕ0 | |
17 | 9nn0 11193 | . . . . . . . . 9 ⊢ 9 ∈ ℕ0 | |
18 | 9lt10 11549 | . . . . . . . . 9 ⊢ 9 < ;10 | |
19 | 15, 16, 17, 18 | declti 11422 | . . . . . . . 8 ⊢ 9 < ;12 |
20 | 9re 10984 | . . . . . . . . 9 ⊢ 9 ∈ ℝ | |
21 | 1nn0 11185 | . . . . . . . . . . 11 ⊢ 1 ∈ ℕ0 | |
22 | 21, 16 | deccl 11388 | . . . . . . . . . 10 ⊢ ;12 ∈ ℕ0 |
23 | 22 | nn0rei 11180 | . . . . . . . . 9 ⊢ ;12 ∈ ℝ |
24 | 12, 20, 23 | lttri 10042 | . . . . . . . 8 ⊢ (((𝐸‘ndx) < 9 ∧ 9 < ;12) → (𝐸‘ndx) < ;12) |
25 | 14, 19, 24 | mp2an 704 | . . . . . . 7 ⊢ (𝐸‘ndx) < ;12 |
26 | 12, 25 | ltneii 10029 | . . . . . 6 ⊢ (𝐸‘ndx) ≠ ;12 |
27 | dsndx 15885 | . . . . . 6 ⊢ (dist‘ndx) = ;12 | |
28 | 26, 27 | neeqtrri 2855 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (dist‘ndx) |
29 | 9, 28 | setsnid 15743 | . . . 4 ⊢ (𝐸‘𝐺) = (𝐸‘(𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉)) |
30 | 12, 14 | ltneii 10029 | . . . . . 6 ⊢ (𝐸‘ndx) ≠ 9 |
31 | tsetndx 15863 | . . . . . 6 ⊢ (TopSet‘ndx) = 9 | |
32 | 30, 31 | neeqtrri 2855 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (TopSet‘ndx) |
33 | 9, 32 | setsnid 15743 | . . . 4 ⊢ (𝐸‘(𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉)) = (𝐸‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉)) |
34 | 29, 33 | eqtri 2632 | . . 3 ⊢ (𝐸‘𝐺) = (𝐸‘((𝐺 sSet 〈(dist‘ndx), (𝑁 ∘ (-g‘𝐺))〉) sSet 〈(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g‘𝐺)))〉)) |
35 | 6, 34 | syl6reqr 2663 | . 2 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝐺) = (𝐸‘𝑇)) |
36 | 7 | str0 15739 | . . 3 ⊢ ∅ = (𝐸‘∅) |
37 | fvprc 6097 | . . . 4 ⊢ (¬ 𝐺 ∈ V → (𝐸‘𝐺) = ∅) | |
38 | 37 | adantr 480 | . . 3 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝐺) = ∅) |
39 | reldmtng 22252 | . . . . . . 7 ⊢ Rel dom toNrmGrp | |
40 | 39 | ovprc1 6582 | . . . . . 6 ⊢ (¬ 𝐺 ∈ V → (𝐺 toNrmGrp 𝑁) = ∅) |
41 | 40 | adantr 480 | . . . . 5 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐺 toNrmGrp 𝑁) = ∅) |
42 | 1, 41 | syl5eq 2656 | . . . 4 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → 𝑇 = ∅) |
43 | 42 | fveq2d 6107 | . . 3 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝑇) = (𝐸‘∅)) |
44 | 36, 38, 43 | 3eqtr4a 2670 | . 2 ⊢ ((¬ 𝐺 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝐸‘𝐺) = (𝐸‘𝑇)) |
45 | 35, 44 | pm2.61ian 827 | 1 ⊢ (𝑁 ∈ 𝑉 → (𝐸‘𝐺) = (𝐸‘𝑇)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 Vcvv 3173 ∅c0 3874 〈cop 4131 class class class wbr 4583 ∘ ccom 5042 ‘cfv 5804 (class class class)co 6549 ℝcr 9814 1c1 9816 < clt 9953 ℕcn 10897 2c2 10947 9c9 10954 ;cdc 11369 ndxcnx 15692 sSet csts 15693 Slot cslot 15694 TopSetcts 15774 distcds 15777 -gcsg 17247 MetOpencmopn 19557 toNrmGrp ctng 22193 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-3 10957 df-4 10958 df-5 10959 df-6 10960 df-7 10961 df-8 10962 df-9 10963 df-n0 11170 df-z 11255 df-dec 11370 df-ndx 15698 df-slot 15699 df-sets 15701 df-tset 15787 df-ds 15791 df-tng 22199 |
This theorem is referenced by: tngbas 22255 tngplusg 22256 tngmulr 22258 tngsca 22259 tngvsca 22260 tngip 22261 |
Copyright terms: Public domain | W3C validator |