Theorem staffn 21013

Description: The functionalization is equal to the original function, if it is a function on the right base set. (Contributed by Mario Carneiro, 6-Oct-2015.)

Hypotheses

Ref	Expression
staffval.b	⊢ 𝐵 = (Base‘𝑅)
staffval.i	⊢ ∗ = (*𝑟‘𝑅)
staffval.f	⊢ ∙ = (*rf‘𝑅)

Assertion

Ref	Expression
staffn	⊢ ( ∗ Fn 𝐵 → ∙ = ∗ )

Proof of Theorem staffn

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		staffval.b	. . 3 ⊢ 𝐵 = (Base‘𝑅)
2		staffval.i	. . 3 ⊢ ∗ = (*𝑟‘𝑅)
3		staffval.f	. . 3 ⊢ ∙ = (*rf‘𝑅)
4	1, 2, 3	staffval 21011	. 2 ⊢ ∙ = (𝑥 ∈ 𝐵 ↦ ( ∗ ‘𝑥))
5		dffn5 6940	. . 3 ⊢ ( ∗ Fn 𝐵 ↔ ∗ = (𝑥 ∈ 𝐵 ↦ ( ∗ ‘𝑥)))
6	5	biimpi 219	. 2 ⊢ ( ∗ Fn 𝐵 → ∗ = (𝑥 ∈ 𝐵 ↦ ( ∗ ‘𝑥)))
7	4, 6	eqtr4id 2816	1 ⊢ ( ∗ Fn 𝐵 → ∙ = ∗ )

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ↦ cmpt 5190   Fn wfn 6532  ‘cfv 6537  Basecbs 17305  *_𝑟cstv 17348  *_rfcstf 21007

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-staf 21009

This theorem is used by: (None)