![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > fmptap | GIF version |
Description: Append an additional value to a function. (Contributed by NM, 6-Jun-2006.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Ref | Expression |
---|---|
fmptap.0a | ⊢ 𝐴 ∈ V |
fmptap.0b | ⊢ 𝐵 ∈ V |
fmptap.1 | ⊢ (𝑅 ∪ {𝐴}) = 𝑆 |
fmptap.2 | ⊢ (𝑥 = 𝐴 → 𝐶 = 𝐵) |
Ref | Expression |
---|---|
fmptap | ⊢ ((𝑥 ∈ 𝑅 ↦ 𝐶) ∪ {⟨𝐴, 𝐵⟩}) = (𝑥 ∈ 𝑆 ↦ 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fmptap.0a | . . . . 5 ⊢ 𝐴 ∈ V | |
2 | fmptap.0b | . . . . 5 ⊢ 𝐵 ∈ V | |
3 | fmptsn 5703 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {⟨𝐴, 𝐵⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵)) | |
4 | 1, 2, 3 | mp2an 426 | . . . 4 ⊢ {⟨𝐴, 𝐵⟩} = (𝑥 ∈ {𝐴} ↦ 𝐵) |
5 | elsni 3610 | . . . . . 6 ⊢ (𝑥 ∈ {𝐴} → 𝑥 = 𝐴) | |
6 | fmptap.2 | . . . . . 6 ⊢ (𝑥 = 𝐴 → 𝐶 = 𝐵) | |
7 | 5, 6 | syl 14 | . . . . 5 ⊢ (𝑥 ∈ {𝐴} → 𝐶 = 𝐵) |
8 | 7 | mpteq2ia 4088 | . . . 4 ⊢ (𝑥 ∈ {𝐴} ↦ 𝐶) = (𝑥 ∈ {𝐴} ↦ 𝐵) |
9 | 4, 8 | eqtr4i 2201 | . . 3 ⊢ {⟨𝐴, 𝐵⟩} = (𝑥 ∈ {𝐴} ↦ 𝐶) |
10 | 9 | uneq2i 3286 | . 2 ⊢ ((𝑥 ∈ 𝑅 ↦ 𝐶) ∪ {⟨𝐴, 𝐵⟩}) = ((𝑥 ∈ 𝑅 ↦ 𝐶) ∪ (𝑥 ∈ {𝐴} ↦ 𝐶)) |
11 | mptun 5345 | . 2 ⊢ (𝑥 ∈ (𝑅 ∪ {𝐴}) ↦ 𝐶) = ((𝑥 ∈ 𝑅 ↦ 𝐶) ∪ (𝑥 ∈ {𝐴} ↦ 𝐶)) | |
12 | fmptap.1 | . . 3 ⊢ (𝑅 ∪ {𝐴}) = 𝑆 | |
13 | mpteq1 4086 | . . 3 ⊢ ((𝑅 ∪ {𝐴}) = 𝑆 → (𝑥 ∈ (𝑅 ∪ {𝐴}) ↦ 𝐶) = (𝑥 ∈ 𝑆 ↦ 𝐶)) | |
14 | 12, 13 | ax-mp 5 | . 2 ⊢ (𝑥 ∈ (𝑅 ∪ {𝐴}) ↦ 𝐶) = (𝑥 ∈ 𝑆 ↦ 𝐶) |
15 | 10, 11, 14 | 3eqtr2i 2204 | 1 ⊢ ((𝑥 ∈ 𝑅 ↦ 𝐶) ∪ {⟨𝐴, 𝐵⟩}) = (𝑥 ∈ 𝑆 ↦ 𝐶) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1353 ∈ wcel 2148 Vcvv 2737 ∪ cun 3127 {csn 3592 ⟨cop 3595 ↦ cmpt 4063 |
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-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-14 2151 ax-ext 2159 ax-sep 4120 ax-pow 4173 ax-pr 4208 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-reu 2462 df-v 2739 df-un 3133 df-in 3135 df-ss 3142 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-br 4003 df-opab 4064 df-mpt 4065 df-id 4292 df-xp 4631 df-rel 4632 df-cnv 4633 df-co 4634 df-dm 4635 df-rn 4636 df-fun 5216 df-fn 5217 df-f 5218 df-f1 5219 df-fo 5220 df-f1o 5221 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |