Mathbox for Glauco Siliprandi < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rnsnf Structured version   Visualization version   GIF version

Theorem rnsnf 41450
 Description: The range of a function whose domain is a singleton. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
Hypotheses
Ref Expression
rnsnf.1 (𝜑𝐴𝑉)
rnsnf.2 (𝜑𝐹:{𝐴}⟶𝐵)
Assertion
Ref Expression
rnsnf (𝜑 → ran 𝐹 = {(𝐹𝐴)})

Proof of Theorem rnsnf
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elsni 4587 . . . . . 6 (𝑥 ∈ {𝐴} → 𝑥 = 𝐴)
21fveq2d 6677 . . . . 5 (𝑥 ∈ {𝐴} → (𝐹𝑥) = (𝐹𝐴))
32mpteq2ia 5160 . . . 4 (𝑥 ∈ {𝐴} ↦ (𝐹𝑥)) = (𝑥 ∈ {𝐴} ↦ (𝐹𝐴))
4 rnsnf.2 . . . . 5 (𝜑𝐹:{𝐴}⟶𝐵)
54feqmptd 6736 . . . 4 (𝜑𝐹 = (𝑥 ∈ {𝐴} ↦ (𝐹𝑥)))
6 rnsnf.1 . . . . 5 (𝜑𝐴𝑉)
7 fvexd 6688 . . . . 5 (𝜑 → (𝐹𝐴) ∈ V)
8 fmptsn 6932 . . . . 5 ((𝐴𝑉 ∧ (𝐹𝐴) ∈ V) → {⟨𝐴, (𝐹𝐴)⟩} = (𝑥 ∈ {𝐴} ↦ (𝐹𝐴)))
96, 7, 8syl2anc 586 . . . 4 (𝜑 → {⟨𝐴, (𝐹𝐴)⟩} = (𝑥 ∈ {𝐴} ↦ (𝐹𝐴)))
103, 5, 93eqtr4a 2885 . . 3 (𝜑𝐹 = {⟨𝐴, (𝐹𝐴)⟩})
1110rneqd 5811 . 2 (𝜑 → ran 𝐹 = ran {⟨𝐴, (𝐹𝐴)⟩})
12 rnsnopg 6081 . . 3 (𝐴𝑉 → ran {⟨𝐴, (𝐹𝐴)⟩} = {(𝐹𝐴)})
136, 12syl 17 . 2 (𝜑 → ran {⟨𝐴, (𝐹𝐴)⟩} = {(𝐹𝐴)})
1411, 13eqtrd 2859 1 (𝜑 → ran 𝐹 = {(𝐹𝐴)})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1536   ∈ wcel 2113  Vcvv 3497  {csn 4570  ⟨cop 4576   ↦ cmpt 5149  ran crn 5559  ⟶wf 6354  ‘cfv 6358 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pr 5333 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-reu 3148  df-rab 3150  df-v 3499  df-sbc 3776  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366 This theorem is referenced by:  fsneqrn  41480  unirnmapsn  41483  sge0sn  42668
 Copyright terms: Public domain W3C validator