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

Theorem fmptap 6909
Description: Append an additional value to a function. (Contributed by NM, 6-Jun-2006.) (Revised by Mario Carneiro, 31-Aug-2015.)
Hypotheses
Ref Expression
fmptap.0a 𝐴 ∈ V
fmptap.0b 𝐵 ∈ V
fmptap.1 (𝑅 ∪ {𝐴}) = 𝑆
fmptap.2 (𝑥 = 𝐴𝐶 = 𝐵)
Assertion
Ref Expression
fmptap ((𝑥𝑅𝐶) ∪ {⟨𝐴, 𝐵⟩}) = (𝑥𝑆𝐶)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑅   𝑥,𝑆
Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem fmptap
StepHypRef Expression
1 fmptap.0a . . . . 5 𝐴 ∈ V
2 fmptap.0b . . . . 5 𝐵 ∈ V
3 fmptsn 6906 . . . . 5 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {⟨𝐴, 𝐵⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵))
41, 2, 3mp2an 691 . . . 4 {⟨𝐴, 𝐵⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵)
5 elsni 4542 . . . . . 6 (𝑥 ∈ {𝐴} → 𝑥 = 𝐴)
6 fmptap.2 . . . . . 6 (𝑥 = 𝐴𝐶 = 𝐵)
75, 6syl 17 . . . . 5 (𝑥 ∈ {𝐴} → 𝐶 = 𝐵)
87mpteq2ia 5121 . . . 4 (𝑥 ∈ {𝐴} ↦ 𝐶) = (𝑥 ∈ {𝐴} ↦ 𝐵)
94, 8eqtr4i 2824 . . 3 {⟨𝐴, 𝐵⟩} = (𝑥 ∈ {𝐴} ↦ 𝐶)
109uneq2i 4087 . 2 ((𝑥𝑅𝐶) ∪ {⟨𝐴, 𝐵⟩}) = ((𝑥𝑅𝐶) ∪ (𝑥 ∈ {𝐴} ↦ 𝐶))
11 mptun 6466 . 2 (𝑥 ∈ (𝑅 ∪ {𝐴}) ↦ 𝐶) = ((𝑥𝑅𝐶) ∪ (𝑥 ∈ {𝐴} ↦ 𝐶))
12 fmptap.1 . . 3 (𝑅 ∪ {𝐴}) = 𝑆
1312mpteq1i 5120 . 2 (𝑥 ∈ (𝑅 ∪ {𝐴}) ↦ 𝐶) = (𝑥𝑆𝐶)
1410, 11, 133eqtr2i 2827 1 ((𝑥𝑅𝐶) ∪ {⟨𝐴, 𝐵⟩}) = (𝑥𝑆𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1538  wcel 2111  Vcvv 3441  cun 3879  {csn 4525  cop 4531  cmpt 5110
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator