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

Theorem rngqiprngimfv 21609
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 8771 . . . 4 (𝑥 = 𝐴 → [𝑥] ∼ = [𝐴] ∼ )
4 oveq2 7438 . . . 4 (𝑥 = 𝐴 → ( 1 · 𝑥) = ( 1 · 𝐴))
53, 4opeq12d 4851 . . 3 (𝑥 = 𝐴 → ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩ = ⟨[𝐴] ∼ , ( 1 · 𝐴)⟩)
65adantl 487 . 2 (((𝜑 ∧ 𝐴 ∈ 𝐵) ∧ 𝑥 = 𝐴) → ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩ = ⟨[𝐴] ∼ , ( 1 · 𝐴)⟩)
7 simpr 490 . 2 ((𝜑 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ 𝐵)
8 opex 5436 . . 3 ⟨[𝐴] ∼ , ( 1 · 𝐴)⟩ ∈ V
98a1i 11 . 2 ((𝜑 ∧ 𝐴 ∈ 𝐵) → ⟨[𝐴] ∼ , ( 1 · 𝐴)⟩ ∈ V)
102, 6, 7, 9fvmptd 7012 1 ((𝜑 ∧ 𝐴 ∈ 𝐵) → (𝐹‘𝐴) = ⟨[𝐴] ∼ , ( 1 · 𝐴)⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  Vcvv 3454  ⟨cop 4838   ↦ cmpt 5189  ‘cfv 6547  (class class class)co 7430  [cec 8729  Basecbs 17402   ↾s cress 17423  .rcmulr 17444   /s cqus 17692   ×s cxps 17693   ~QG cqg 19347  Rngcrng 20389  1rcur 20422  Ringcrg 20474  2Idealc2idl 21557
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6501  df-fun 6549  df-fv 6555  df-ov 7433  df-ec 8733
This theorem is used by:  rngqiprngghm  21610  rngqiprngimf1  21611  rngqiprngimfo  21612  rngqiprnglin  21613  rngqiprngfu  21628
  Copyright terms: Public domain W3C validator