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

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

Proof of Theorem fvsnun1
StepHypRef Expression
1 fvsnun.3 . . . . 5 𝐺 = ({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴})))
21reseq1i 5054 . . . 4 (𝐺 ↾ {𝐴}) = (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴})
3 resundir 5072 . . . . 5 (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}))
4 incom 3421 . . . . . . . . 9 ((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ({𝐴} ∩ (𝐶 ∖ {𝐴}))
5 disjdif 3596 . . . . . . . . 9 ({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅
64, 5eqtri 2259 . . . . . . . 8 ((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅
7 resdisj 5211 . . . . . . . 8 (((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅ → ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅)
86, 7ax-mp 5 . . . . . . 7 ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅
98uneq2i 3380 . . . . . 6 (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ∅)
10 un0 3556 . . . . . 6 (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ∅) = ({⟨𝐴, 𝐵⟩} ↾ {𝐴})
119, 10eqtri 2259 . . . . 5 (({⟨𝐴, 𝐵⟩} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = ({⟨𝐴, 𝐵⟩} ↾ {𝐴})
123, 11eqtri 2259 . . . 4 (({⟨𝐴, 𝐵⟩} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = ({⟨𝐴, 𝐵⟩} ↾ {𝐴})
132, 12eqtri 2259 . . 3 (𝐺 ↾ {𝐴}) = ({⟨𝐴, 𝐵⟩} ↾ {𝐴})
1413fveq1i 5691 . 2 ((𝐺 ↾ {𝐴})‘𝐴) = (({⟨𝐴, 𝐵⟩} ↾ {𝐴})‘𝐴)
15 fvsnun.1 . . . 4 𝐴 ∈ V
1615snid 3736 . . 3 𝐴 ∈ {𝐴}
17 fvres 5714 . . 3 (𝐴 ∈ {𝐴} → ((𝐺 ↾ {𝐴})‘𝐴) = (𝐺𝐴))
1816, 17ax-mp 5 . 2 ((𝐺 ↾ {𝐴})‘𝐴) = (𝐺𝐴)
19 fvres 5714 . . . 4 (𝐴 ∈ {𝐴} → (({⟨𝐴, 𝐵⟩} ↾ {𝐴})‘𝐴) = ({⟨𝐴, 𝐵⟩}‘𝐴))
2016, 19ax-mp 5 . . 3 (({⟨𝐴, 𝐵⟩} ↾ {𝐴})‘𝐴) = ({⟨𝐴, 𝐵⟩}‘𝐴)
21 fvsnun.2 . . . 4 𝐵 ∈ V
2215, 21fvsn 5901 . . 3 ({⟨𝐴, 𝐵⟩}‘𝐴) = 𝐵
2320, 22eqtri 2259 . 2 (({⟨𝐴, 𝐵⟩} ↾ {𝐴})‘𝐴) = 𝐵
2414, 18, 233eqtr3i 2267 1 (𝐺𝐴) = 𝐵
Colors of variables: wff set class
Syntax hints:   = wceq 1402  wcel 2209  Vcvv 2821  cdif 3217  cun 3218  cin 3219  c0 3520  {csn 3705  cop 3708  cres 4771  cfv 5372
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-res 4781  df-iota 5332  df-fun 5374  df-fv 5380
This theorem is referenced by:  fac0  11144
  Copyright terms: Public domain W3C validator