MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tnglem Structured version   Visualization version   GIF version

Theorem tnglem 24584
Description: Lemma for tngbas 24585 and similar theorems. (Contributed by Mario Carneiro, 2-Oct-2015.) (Revised by AV, 31-Oct-2024.)
Hypotheses
Ref Expression
tngbas.t 𝑇 = (𝐺 toNrmGrp 𝑁)
tnglem.e 𝐸 = Slot (𝐸‘ndx)
tnglem.t (𝐸‘ndx) ≠ (TopSet‘ndx)
tnglem.d (𝐸‘ndx) ≠ (dist‘ndx)
Assertion
Ref Expression
tnglem (𝑁𝑉 → (𝐸𝐺) = (𝐸𝑇))

Proof of Theorem tnglem
StepHypRef Expression
1 tnglem.e . . . . 5 𝐸 = Slot (𝐸‘ndx)
2 tnglem.d . . . . 5 (𝐸‘ndx) ≠ (dist‘ndx)
31, 2setsnid 17135 . . . 4 (𝐸𝐺) = (𝐸‘(𝐺 sSet ⟨(dist‘ndx), (𝑁 ∘ (-g𝐺))⟩))
4 tnglem.t . . . . 5 (𝐸‘ndx) ≠ (TopSet‘ndx)
51, 4setsnid 17135 . . . 4 (𝐸‘(𝐺 sSet ⟨(dist‘ndx), (𝑁 ∘ (-g𝐺))⟩)) = (𝐸‘((𝐺 sSet ⟨(dist‘ndx), (𝑁 ∘ (-g𝐺))⟩) sSet ⟨(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g𝐺)))⟩))
63, 5eqtri 2759 . . 3 (𝐸𝐺) = (𝐸‘((𝐺 sSet ⟨(dist‘ndx), (𝑁 ∘ (-g𝐺))⟩) sSet ⟨(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g𝐺)))⟩))
7 tngbas.t . . . . 5 𝑇 = (𝐺 toNrmGrp 𝑁)
8 eqid 2736 . . . . 5 (-g𝐺) = (-g𝐺)
9 eqid 2736 . . . . 5 (𝑁 ∘ (-g𝐺)) = (𝑁 ∘ (-g𝐺))
10 eqid 2736 . . . . 5 (MetOpen‘(𝑁 ∘ (-g𝐺))) = (MetOpen‘(𝑁 ∘ (-g𝐺)))
117, 8, 9, 10tngval 24583 . . . 4 ((𝐺 ∈ V ∧ 𝑁𝑉) → 𝑇 = ((𝐺 sSet ⟨(dist‘ndx), (𝑁 ∘ (-g𝐺))⟩) sSet ⟨(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g𝐺)))⟩))
1211fveq2d 6838 . . 3 ((𝐺 ∈ V ∧ 𝑁𝑉) → (𝐸𝑇) = (𝐸‘((𝐺 sSet ⟨(dist‘ndx), (𝑁 ∘ (-g𝐺))⟩) sSet ⟨(TopSet‘ndx), (MetOpen‘(𝑁 ∘ (-g𝐺)))⟩)))
136, 12eqtr4id 2790 . 2 ((𝐺 ∈ V ∧ 𝑁𝑉) → (𝐸𝐺) = (𝐸𝑇))
141str0 17116 . . . . 5 ∅ = (𝐸‘∅)
1514eqcomi 2745 . . . 4 (𝐸‘∅) = ∅
16 reldmtng 24582 . . . 4 Rel dom toNrmGrp
1715, 7, 16oveqprc 17119 . . 3 𝐺 ∈ V → (𝐸𝐺) = (𝐸𝑇))
1817adantr 480 . 2 ((¬ 𝐺 ∈ V ∧ 𝑁𝑉) → (𝐸𝐺) = (𝐸𝑇))
1913, 18pm2.61ian 811 1 (𝑁𝑉 → (𝐸𝐺) = (𝐸𝑇))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1541  wcel 2113  wne 2932  Vcvv 3440  c0 4285  cop 4586  ccom 5628  cfv 6492  (class class class)co 7358   sSet csts 17090  Slot cslot 17108  ndxcnx 17120  TopSetcts 17183  distcds 17186  -gcsg 18865  MetOpencmopn 21299   toNrmGrp ctng 24522
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-res 5636  df-iota 6448  df-fun 6494  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-sets 17091  df-slot 17109  df-tng 24528
This theorem is referenced by:  tngbas  24585  tngplusg  24586  tngmulr  24588  tngsca  24589  tngvsca  24590  tngip  24591
  Copyright terms: Public domain W3C validator