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

Theorem fvsnun2 5618
Description: The value of a function with one of its ordered pairs replaced, at arguments other than the replaced one. See also fvsnun1 5617. (Contributed by NM, 23-Sep-2007.)
Hypotheses
Ref Expression
fvsnun.1 𝐴 ∈ V
fvsnun.2 𝐵 ∈ V
fvsnun.3 𝐺 = ({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴})))
Assertion
Ref Expression
fvsnun2 (𝐷 ∈ (𝐶 ∖ {𝐴}) → (𝐺𝐷) = (𝐹𝐷))

Proof of Theorem fvsnun2
StepHypRef Expression
1 fvsnun.3 . . . . 5 𝐺 = ({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴})))
21reseq1i 4815 . . . 4 (𝐺 ↾ (𝐶 ∖ {𝐴})) = (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴}))
3 resundir 4833 . . . 4 (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴})) = (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴})))
4 disjdif 3435 . . . . . . 7 ({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅
5 fvsnun.1 . . . . . . . . 9 𝐴 ∈ V
6 fvsnun.2 . . . . . . . . 9 𝐵 ∈ V
75, 6fnsn 5177 . . . . . . . 8 {⟨𝐴, 𝐵⟩} Fn {𝐴}
8 fnresdisj 5233 . . . . . . . 8 ({⟨𝐴, 𝐵⟩} Fn {𝐴} → (({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅ ↔ ({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) = ∅))
97, 8ax-mp 5 . . . . . . 7 (({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅ ↔ ({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) = ∅)
104, 9mpbi 144 . . . . . 6 ({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) = ∅
11 residm 4851 . . . . . 6 ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴})) = (𝐹 ↾ (𝐶 ∖ {𝐴}))
1210, 11uneq12i 3228 . . . . 5 (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴}))) = (∅ ∪ (𝐹 ↾ (𝐶 ∖ {𝐴})))
13 uncom 3220 . . . . 5 (∅ ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) = ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅)
14 un0 3396 . . . . 5 ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅) = (𝐹 ↾ (𝐶 ∖ {𝐴}))
1512, 13, 143eqtri 2164 . . . 4 (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴}))) = (𝐹 ↾ (𝐶 ∖ {𝐴}))
162, 3, 153eqtri 2164 . . 3 (𝐺 ↾ (𝐶 ∖ {𝐴})) = (𝐹 ↾ (𝐶 ∖ {𝐴}))
1716fveq1i 5422 . 2 ((𝐺 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = ((𝐹 ↾ (𝐶 ∖ {𝐴}))‘𝐷)
18 fvres 5445 . 2 (𝐷 ∈ (𝐶 ∖ {𝐴}) → ((𝐺 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = (𝐺𝐷))
19 fvres 5445 . 2 (𝐷 ∈ (𝐶 ∖ {𝐴}) → ((𝐹 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = (𝐹𝐷))
2017, 18, 193eqtr3a 2196 1 (𝐷 ∈ (𝐶 ∖ {𝐴}) → (𝐺𝐷) = (𝐹𝐷))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 104   = wceq 1331  wcel 1480  Vcvv 2686  cdif 3068  cun 3069  cin 3070  c0 3363  {csn 3527  cop 3530  cres 4541   Fn wfn 5118  cfv 5123
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-res 4551  df-iota 5088  df-fun 5125  df-fn 5126  df-fv 5131
This theorem is referenced by:  facnn  10473
  Copyright terms: Public domain W3C validator