ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fmptap GIF version

Theorem fmptap 5381
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 5380 . . . . 5 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {⟨𝐴, 𝐵⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵))
41, 2, 3mp2an 410 . . . 4 {⟨𝐴, 𝐵⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵)
5 elsni 3421 . . . . . 6 (𝑥 ∈ {𝐴} → 𝑥 = 𝐴)
6 fmptap.2 . . . . . 6 (𝑥 = 𝐴𝐶 = 𝐵)
75, 6syl 14 . . . . 5 (𝑥 ∈ {𝐴} → 𝐶 = 𝐵)
87mpteq2ia 3871 . . . 4 (𝑥 ∈ {𝐴} ↦ 𝐶) = (𝑥 ∈ {𝐴} ↦ 𝐵)
94, 8eqtr4i 2079 . . 3 {⟨𝐴, 𝐵⟩} = (𝑥 ∈ {𝐴} ↦ 𝐶)
109uneq2i 3122 . 2 ((𝑥𝑅𝐶) ∪ {⟨𝐴, 𝐵⟩}) = ((𝑥𝑅𝐶) ∪ (𝑥 ∈ {𝐴} ↦ 𝐶))
11 mptun 5057 . 2 (𝑥 ∈ (𝑅 ∪ {𝐴}) ↦ 𝐶) = ((𝑥𝑅𝐶) ∪ (𝑥 ∈ {𝐴} ↦ 𝐶))
12 fmptap.1 . . 3 (𝑅 ∪ {𝐴}) = 𝑆
13 mpteq1 3869 . . 3 ((𝑅 ∪ {𝐴}) = 𝑆 → (𝑥 ∈ (𝑅 ∪ {𝐴}) ↦ 𝐶) = (𝑥𝑆𝐶))
1412, 13ax-mp 7 . 2 (𝑥 ∈ (𝑅 ∪ {𝐴}) ↦ 𝐶) = (𝑥𝑆𝐶)
1510, 11, 143eqtr2i 2082 1 ((𝑥𝑅𝐶) ∪ {⟨𝐴, 𝐵⟩}) = (𝑥𝑆𝐶)
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1259  wcel 1409  Vcvv 2574  cun 2943  {csn 3403  cop 3406  cmpt 3846
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3903  ax-pow 3955  ax-pr 3972
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-reu 2330  df-v 2576  df-un 2950  df-in 2952  df-ss 2959  df-pw 3389  df-sn 3409  df-pr 3410  df-op 3412  df-br 3793  df-opab 3847  df-mpt 3848  df-id 4058  df-xp 4379  df-rel 4380  df-cnv 4381  df-co 4382  df-dm 4383  df-rn 4384  df-fun 4932  df-fn 4933  df-f 4934  df-f1 4935  df-fo 4936  df-f1o 4937
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator