| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fvunsng | GIF version | ||
| Description: Remove an ordered pair not participating in a function value. (Contributed by Jim Kingdon, 7-Jan-2019.) |
| Ref | Expression |
|---|---|
| fvunsng | ⊢ ((𝐷 ∈ 𝑉 ∧ 𝐵 ≠ 𝐷) → ((𝐴 ∪ {〈𝐵, 𝐶〉})‘𝐷) = (𝐴‘𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snidg 3734 | . . . 4 ⊢ (𝐷 ∈ 𝑉 → 𝐷 ∈ {𝐷}) | |
| 2 | fvres 5714 | . . . 4 ⊢ (𝐷 ∈ {𝐷} → (((𝐴 ∪ {〈𝐵, 𝐶〉}) ↾ {𝐷})‘𝐷) = ((𝐴 ∪ {〈𝐵, 𝐶〉})‘𝐷)) | |
| 3 | 1, 2 | syl 14 | . . 3 ⊢ (𝐷 ∈ 𝑉 → (((𝐴 ∪ {〈𝐵, 𝐶〉}) ↾ {𝐷})‘𝐷) = ((𝐴 ∪ {〈𝐵, 𝐶〉})‘𝐷)) |
| 4 | resundir 5072 | . . . . 5 ⊢ ((𝐴 ∪ {〈𝐵, 𝐶〉}) ↾ {𝐷}) = ((𝐴 ↾ {𝐷}) ∪ ({〈𝐵, 𝐶〉} ↾ {𝐷})) | |
| 5 | elsni 3723 | . . . . . . . . 9 ⊢ (𝐵 ∈ {𝐷} → 𝐵 = 𝐷) | |
| 6 | 5 | necon3ai 2469 | . . . . . . . 8 ⊢ (𝐵 ≠ 𝐷 → ¬ 𝐵 ∈ {𝐷}) |
| 7 | ressnop0 5887 | . . . . . . . 8 ⊢ (¬ 𝐵 ∈ {𝐷} → ({〈𝐵, 𝐶〉} ↾ {𝐷}) = ∅) | |
| 8 | 6, 7 | syl 14 | . . . . . . 7 ⊢ (𝐵 ≠ 𝐷 → ({〈𝐵, 𝐶〉} ↾ {𝐷}) = ∅) |
| 9 | 8 | uneq2d 3383 | . . . . . 6 ⊢ (𝐵 ≠ 𝐷 → ((𝐴 ↾ {𝐷}) ∪ ({〈𝐵, 𝐶〉} ↾ {𝐷})) = ((𝐴 ↾ {𝐷}) ∪ ∅)) |
| 10 | un0 3556 | . . . . . 6 ⊢ ((𝐴 ↾ {𝐷}) ∪ ∅) = (𝐴 ↾ {𝐷}) | |
| 11 | 9, 10 | eqtrdi 2287 | . . . . 5 ⊢ (𝐵 ≠ 𝐷 → ((𝐴 ↾ {𝐷}) ∪ ({〈𝐵, 𝐶〉} ↾ {𝐷})) = (𝐴 ↾ {𝐷})) |
| 12 | 4, 11 | eqtrid 2283 | . . . 4 ⊢ (𝐵 ≠ 𝐷 → ((𝐴 ∪ {〈𝐵, 𝐶〉}) ↾ {𝐷}) = (𝐴 ↾ {𝐷})) |
| 13 | 12 | fveq1d 5692 | . . 3 ⊢ (𝐵 ≠ 𝐷 → (((𝐴 ∪ {〈𝐵, 𝐶〉}) ↾ {𝐷})‘𝐷) = ((𝐴 ↾ {𝐷})‘𝐷)) |
| 14 | 3, 13 | sylan9req 2292 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝐵 ≠ 𝐷) → ((𝐴 ∪ {〈𝐵, 𝐶〉})‘𝐷) = ((𝐴 ↾ {𝐷})‘𝐷)) |
| 15 | fvres 5714 | . . . 4 ⊢ (𝐷 ∈ {𝐷} → ((𝐴 ↾ {𝐷})‘𝐷) = (𝐴‘𝐷)) | |
| 16 | 1, 15 | syl 14 | . . 3 ⊢ (𝐷 ∈ 𝑉 → ((𝐴 ↾ {𝐷})‘𝐷) = (𝐴‘𝐷)) |
| 17 | 16 | adantr 276 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝐵 ≠ 𝐷) → ((𝐴 ↾ {𝐷})‘𝐷) = (𝐴‘𝐷)) |
| 18 | 14, 17 | eqtrd 2271 | 1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝐵 ≠ 𝐷) → ((𝐴 ∪ {〈𝐵, 𝐶〉})‘𝐷) = (𝐴‘𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 ∪ cun 3218 ∅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-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-v 2823 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-xp 4775 df-res 4781 df-iota 5332 df-fv 5380 |
| This theorem is referenced by: fvpr1 5910 fvpr1g 5912 fvpr2g 5913 fvtp1g 5914 tfrlemisucaccv 6586 tfr1onlemsucaccv 6602 tfrcllemsucaccv 6615 ac6sfi 7192 0tonninf 10855 1tonninf 10856 hashennn 11197 zfz1isolemiso 11269 cats1un 11471 nninfctlemfo 12795 |
| Copyright terms: Public domain | W3C validator |