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

Theorem rngqiprngimfv 21251
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 8672 . . . 4 (𝑥 = 𝐴 → [𝑥] = [𝐴] )
4 oveq2 7364 . . . 4 (𝑥 = 𝐴 → ( 1 · 𝑥) = ( 1 · 𝐴))
53, 4opeq12d 4835 . . 3 (𝑥 = 𝐴 → ⟨[𝑥] , ( 1 · 𝑥)⟩ = ⟨[𝐴] , ( 1 · 𝐴)⟩)
65adantl 481 . 2 (((𝜑𝐴𝐵) ∧ 𝑥 = 𝐴) → ⟨[𝑥] , ( 1 · 𝑥)⟩ = ⟨[𝐴] , ( 1 · 𝐴)⟩)
7 simpr 484 . 2 ((𝜑𝐴𝐵) → 𝐴𝐵)
8 opex 5410 . . 3 ⟨[𝐴] , ( 1 · 𝐴)⟩ ∈ V
98a1i 11 . 2 ((𝜑𝐴𝐵) → ⟨[𝐴] , ( 1 · 𝐴)⟩ ∈ V)
102, 6, 7, 9fvmptd 6946 1 ((𝜑𝐴𝐵) → (𝐹𝐴) = ⟨[𝐴] , ( 1 · 𝐴)⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  Vcvv 3438  cop 4584  cmpt 5177  cfv 6490  (class class class)co 7356  [cec 8631  Basecbs 17134  s cress 17155  .rcmulr 17176   /s cqus 17424   ×s cxps 17425   ~QG cqg 19050  Rngcrng 20085  1rcur 20114  Ringcrg 20166  2Idealc2idl 21202
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 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375
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 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fv 6498  df-ov 7359  df-ec 8635
This theorem is referenced by:  rngqiprngghm  21252  rngqiprngimf1  21253  rngqiprngimfo  21254  rngqiprnglin  21255  rngqiprngfu  21270
  Copyright terms: Public domain W3C validator