| Intuitionistic Logic Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > fvsnun2 | GIF version | ||
| Description: The value of a function with one of its ordered pairs replaced, at arguments other than the replaced one. See also fvsnun1 5759. (Contributed by NM, 23-Sep-2007.) | 
| Ref | Expression | 
|---|---|
| fvsnun.1 | ⊢ 𝐴 ∈ V | 
| fvsnun.2 | ⊢ 𝐵 ∈ V | 
| fvsnun.3 | ⊢ 𝐺 = ({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) | 
| Ref | Expression | 
|---|---|
| fvsnun2 | ⊢ (𝐷 ∈ (𝐶 ∖ {𝐴}) → (𝐺‘𝐷) = (𝐹‘𝐷)) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | fvsnun.3 | . . . . 5 ⊢ 𝐺 = ({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) | |
| 2 | 1 | reseq1i 4942 | . . . 4 ⊢ (𝐺 ↾ (𝐶 ∖ {𝐴})) = (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴})) | 
| 3 | resundir 4960 | . . . 4 ⊢ (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ (𝐶 ∖ {𝐴})) = (({〈𝐴, 𝐵〉} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴}))) | |
| 4 | disjdif 3523 | . . . . . . 7 ⊢ ({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅ | |
| 5 | fvsnun.1 | . . . . . . . . 9 ⊢ 𝐴 ∈ V | |
| 6 | fvsnun.2 | . . . . . . . . 9 ⊢ 𝐵 ∈ V | |
| 7 | 5, 6 | fnsn 5312 | . . . . . . . 8 ⊢ {〈𝐴, 𝐵〉} Fn {𝐴} | 
| 8 | fnresdisj 5368 | . . . . . . . 8 ⊢ ({〈𝐴, 𝐵〉} Fn {𝐴} → (({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅ ↔ ({〈𝐴, 𝐵〉} ↾ (𝐶 ∖ {𝐴})) = ∅)) | |
| 9 | 7, 8 | ax-mp 5 | . . . . . . 7 ⊢ (({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅ ↔ ({〈𝐴, 𝐵〉} ↾ (𝐶 ∖ {𝐴})) = ∅) | 
| 10 | 4, 9 | mpbi 145 | . . . . . 6 ⊢ ({〈𝐴, 𝐵〉} ↾ (𝐶 ∖ {𝐴})) = ∅ | 
| 11 | residm 4978 | . . . . . 6 ⊢ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴})) = (𝐹 ↾ (𝐶 ∖ {𝐴})) | |
| 12 | 10, 11 | uneq12i 3315 | . . . . 5 ⊢ (({〈𝐴, 𝐵〉} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴}))) = (∅ ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) | 
| 13 | uncom 3307 | . . . . 5 ⊢ (∅ ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) = ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅) | |
| 14 | un0 3484 | . . . . 5 ⊢ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ∪ ∅) = (𝐹 ↾ (𝐶 ∖ {𝐴})) | |
| 15 | 12, 13, 14 | 3eqtri 2221 | . . . 4 ⊢ (({〈𝐴, 𝐵〉} ↾ (𝐶 ∖ {𝐴})) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ (𝐶 ∖ {𝐴}))) = (𝐹 ↾ (𝐶 ∖ {𝐴})) | 
| 16 | 2, 3, 15 | 3eqtri 2221 | . . 3 ⊢ (𝐺 ↾ (𝐶 ∖ {𝐴})) = (𝐹 ↾ (𝐶 ∖ {𝐴})) | 
| 17 | 16 | fveq1i 5559 | . 2 ⊢ ((𝐺 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = ((𝐹 ↾ (𝐶 ∖ {𝐴}))‘𝐷) | 
| 18 | fvres 5582 | . 2 ⊢ (𝐷 ∈ (𝐶 ∖ {𝐴}) → ((𝐺 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = (𝐺‘𝐷)) | |
| 19 | fvres 5582 | . 2 ⊢ (𝐷 ∈ (𝐶 ∖ {𝐴}) → ((𝐹 ↾ (𝐶 ∖ {𝐴}))‘𝐷) = (𝐹‘𝐷)) | |
| 20 | 17, 18, 19 | 3eqtr3a 2253 | 1 ⊢ (𝐷 ∈ (𝐶 ∖ {𝐴}) → (𝐺‘𝐷) = (𝐹‘𝐷)) | 
| Colors of variables: wff set class | 
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1364 ∈ wcel 2167 Vcvv 2763 ∖ cdif 3154 ∪ cun 3155 ∩ cin 3156 ∅c0 3450 {csn 3622 〈cop 3625 ↾ cres 4665 Fn wfn 5253 ‘cfv 5258 | 
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-14 2170 ax-ext 2178 ax-sep 4151 ax-pow 4207 ax-pr 4242 | 
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rex 2481 df-v 2765 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3451 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-uni 3840 df-br 4034 df-opab 4095 df-id 4328 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-dm 4673 df-res 4675 df-iota 5219 df-fun 5260 df-fn 5261 df-fv 5266 | 
| This theorem is referenced by: facnn 10819 | 
| Copyright terms: Public domain | W3C validator |