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

Theorem fvsnun2 5847
Description: The value of a function with one of its ordered pairs replaced, at arguments other than the replaced one. See also fvsnun1 5846. (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 5007 . . . 4 (𝐺 ↾ (𝐶 ∖ {𝐴})) = (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴}))
3 resundir 5025 . . . 4 (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴})) = (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴})))
4 disjdif 3565 . . . . . . 7 ({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅
5 fvsnun.1 . . . . . . . . 9 𝐴 ∈ V
6 fvsnun.2 . . . . . . . . 9 𝐵 ∈ V
75, 6fnsn 5381 . . . . . . . 8 {⟨𝐴, 𝐵⟩} Fn {𝐴}
8 fnresdisj 5439 . . . . . . . 8 ({⟨𝐴, 𝐵⟩} Fn {𝐴} → (({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅ ↔ ({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) = ∅))
97, 8ax-mp 5 . . . . . . 7 (({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅ ↔ ({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) = ∅)
104, 9mpbi 145 . . . . . 6 ({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) = ∅
11 residm 5043 . . . . . 6 ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴})) = (𝐹 ↾ (𝐶 ∖ {𝐴}))
1210, 11uneq12i 3357 . . . . 5 (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴}))) = (∅ ∪ (𝐹 ↾ (𝐶 ∖ {𝐴})))
13 uncom 3349 . . . . 5 (∅ ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) = ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅)
14 un0 3526 . . . . 5 ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅) = (𝐹 ↾ (𝐶 ∖ {𝐴}))
1512, 13, 143eqtri 2254 . . . 4 (({⟨𝐴, 𝐵⟩} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴}))) = (𝐹 ↾ (𝐶 ∖ {𝐴}))
162, 3, 153eqtri 2254 . . 3 (𝐺 ↾ (𝐶 ∖ {𝐴})) = (𝐹 ↾ (𝐶 ∖ {𝐴}))
1716fveq1i 5636 . 2 ((𝐺 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = ((𝐹 ↾ (𝐶 ∖ {𝐴}))‘𝐷)
18 fvres 5659 . 2 (𝐷 ∈ (𝐶 ∖ {𝐴}) → ((𝐺 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = (𝐺𝐷))
19 fvres 5659 . 2 (𝐷 ∈ (𝐶 ∖ {𝐴}) → ((𝐹 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = (𝐹𝐷))
2017, 18, 193eqtr3a 2286 1 (𝐷 ∈ (𝐶 ∖ {𝐴}) → (𝐺𝐷) = (𝐹𝐷))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1395  wcel 2200  Vcvv 2800  cdif 3195  cun 3196  cin 3197  c0 3492  {csn 3667  cop 3670  cres 4725   Fn wfn 5319  cfv 5324
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-res 4735  df-iota 5284  df-fun 5326  df-fn 5327  df-fv 5332
This theorem is referenced by:  facnn  10979
  Copyright terms: Public domain W3C validator