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

Theorem rngqiprngimfv 21594
Description: The value of the function 𝐹 at an element of (the base set of) a non-unital ring. (Contributed by AV, 24-Feb-2025.)
Hypotheses
Ref Expression
rng2idlring.r (𝜑 → 𝑅 ∈ Rng)
rng2idlring.i (𝜑 → 𝐼 ∈ (2Ideal‘𝑅))
rng2idlring.j 𝐽 = (𝑅 ↾s 𝐼)
rng2idlring.u (𝜑 → 𝐽 ∈ Ring)
rng2idlring.b 𝐵 = (Base‘𝑅)
rng2idlring.t · = (.r‘𝑅)
rng2idlring.1 1 = (1r‘𝐽)
rngqiprngim.g ∼ = (𝑅 ~QG 𝐼)
rngqiprngim.q 𝑄 = (𝑅 /s ∼ )
rngqiprngim.c 𝐶 = (Base‘𝑄)
rngqiprngim.p 𝑃 = (𝑄 ×s 𝐽)
rngqiprngim.f 𝐹 = (𝑥 ∈ 𝐵 ↦ ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩)
Assertion
Ref Expression
rngqiprngimfv ((𝜑 ∧ 𝐴 ∈ 𝐵) → (𝐹‘𝐴) = ⟨[𝐴] ∼ , ( 1 · 𝐴)⟩)
Distinct variable groups:   𝑥,𝐶   𝑥,𝐼   𝑥,𝐵   𝜑,𝑥   𝑥,𝐴   𝑥, ∼   𝑥, 1   𝑥, ·
Allowed substitution hints:   𝑃(𝑥)   𝑄(𝑥)   𝑅(𝑥)   𝐹(𝑥)   𝐽(𝑥)

Proof of Theorem rngqiprngimfv
StepHypRef Expression
1 rngqiprngim.f . . 3 𝐹 = (𝑥 ∈ 𝐵 ↦ ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩)
21a1i 11 . 2 ((𝜑 ∧ 𝐴 ∈ 𝐵) → 𝐹 = (𝑥 ∈ 𝐵 ↦ ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩))
3 eceq1 8757 . . . 4 (𝑥 = 𝐴 → [𝑥] ∼ = [𝐴] ∼ )
4 oveq2 7428 . . . 4 (𝑥 = 𝐴 → ( 1 · 𝑥) = ( 1 · 𝐴))
53, 4opeq12d 4841 . . 3 (𝑥 = 𝐴 → ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩ = ⟨[𝐴] ∼ , ( 1 · 𝐴)⟩)
65adantl 487 . 2 (((𝜑 ∧ 𝐴 ∈ 𝐵) ∧ 𝑥 = 𝐴) → ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩ = ⟨[𝐴] ∼ , ( 1 · 𝐴)⟩)
7 simpr 490 . 2 ((𝜑 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ 𝐵)
8 opex 5432 . . 3 ⟨[𝐴] ∼ , ( 1 · 𝐴)⟩ ∈ V
98a1i 11 . 2 ((𝜑 ∧ 𝐴 ∈ 𝐵) → ⟨[𝐴] ∼ , ( 1 · 𝐴)⟩ ∈ V)
102, 6, 7, 9fvmptd 7001 1 ((𝜑 ∧ 𝐴 ∈ 𝐵) → (𝐹‘𝐴) = ⟨[𝐴] ∼ , ( 1 · 𝐴)⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ⟨cop 4590   ↦ cmpt 5186  ‘cfv 6538  (class class class)co 7420  [cec 8715  Basecbs 17387   ↾s cress 17408  .rcmulr 17429   /s cqus 17677   ×s cxps 17678   ~QG cqg 19332  Rngcrng 20374  1rcur 20407  Ringcrg 20459  2Idealc2idl 21542
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-ec 8719
This theorem is used by:  rngqiprngghm  21595  rngqiprngimf1  21596  rngqiprngimfo  21597  rngqiprnglin  21598  rngqiprngfu  21613
  Copyright terms: Public domain W3C validator