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

Theorem fmptap 7206
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 7203 . . . . 5 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {⟨𝐴, 𝐵⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵))
41, 2, 3mp2an 705 . . . 4 {⟨𝐴, 𝐵⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵)
5 elsni 4601 . . . . . 6 (𝑥 ∈ {𝐴} → 𝑥 = 𝐴)
6 fmptap.2 . . . . . 6 (𝑥 = 𝐴 → 𝐶 = 𝐵)
75, 6syl 18 . . . . 5 (𝑥 ∈ {𝐴} → 𝐶 = 𝐵)
87mpteq2ia 5206 . . . 4 (𝑥 ∈ {𝐴} ↦ 𝐶) = (𝑥 ∈ {𝐴} ↦ 𝐵)
94, 8eqtr4i 2789 . . 3 {⟨𝐴, 𝐵⟩} = (𝑥 ∈ {𝐴} ↦ 𝐶)
109uneq2i 4167 . 2 ((𝑥 ∈ 𝑅 ↦ 𝐶) ∪ {⟨𝐴, 𝐵⟩}) = ((𝑥 ∈ 𝑅 ↦ 𝐶) ∪ (𝑥 ∈ {𝐴} ↦ 𝐶))
11 mptun 6715 . 2 (𝑥 ∈ (𝑅 ∪ {𝐴}) ↦ 𝐶) = ((𝑥 ∈ 𝑅 ↦ 𝐶) ∪ (𝑥 ∈ {𝐴} ↦ 𝐶))
12 fmptap.1 . . 3 (𝑅 ∪ {𝐴}) = 𝑆
1312mpteq1i 5202 . 2 (𝑥 ∈ (𝑅 ∪ {𝐴}) ↦ 𝐶) = (𝑥 ∈ 𝑆 ↦ 𝐶)
1410, 11, 133eqtr2i 2792 1 ((𝑥 ∈ 𝑅 ↦ 𝐶) ∪ {⟨𝐴, 𝐵⟩}) = (𝑥 ∈ 𝑆 ↦ 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∪ cun 4152  {csn 4588  ⟨cop 4840   ↦ cmpt 5192
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  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 4841  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator