| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mpteq2dv | GIF version | ||
| Description: An equality inference for the maps-to notation. (Contributed by Mario Carneiro, 23-Aug-2014.) |
| Ref | Expression |
|---|---|
| mpteq2dv.1 | ⊢ (𝜑 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| mpteq2dv | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mpteq2dv.1 | . . 3 ⊢ (𝜑 → 𝐵 = 𝐶) | |
| 2 | 1 | adantr 276 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) |
| 3 | 2 | mpteq2dva 4184 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2202 ↦ cmpt 4155 |
| 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-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-11 1555 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-ral 2516 df-opab 4156 df-mpt 4157 |
| This theorem is referenced by: ofeqd 6246 ofeq 6247 rdgeq1 6580 rdgeq2 6581 omv 6666 oeiv 6667 0tonninf 10748 1tonninf 10749 iseqf1olemjpcl 10816 iseqf1olemqpcl 10817 iseqf1olemfvp 10818 seq3f1olemqsum 10821 seq3f1olemp 10823 summodc 12007 zsumdc 12008 fsum3 12011 prodeq2w 12180 prodmodc 12202 zproddc 12203 fprodseq 12207 nninfctlemfo 12674 1arithlem1 12999 sloteq 13150 prdsplusgval 13429 prdsmulrval 13431 qusex 13471 grplactfval 13747 cnprcl2k 15000 fsumcncntop 15361 expcn 15363 expcncf 15403 dvexp 15505 dvexp2 15506 dvmptfsum 15519 elply2 15529 elplyr 15534 elplyd 15535 plycolemc 15552 dvply2g 15560 lgsval 15806 incistruhgr 16014 peano4nninf 16715 peano3nninf 16716 nninfalllem1 16717 nninfsellemdc 16719 nninfsellemeq 16723 nninfsellemqall 16724 nninfsellemeqinf 16725 nninfomni 16728 nnnninfex 16731 gfsumsn 16797 |
| Copyright terms: Public domain | W3C validator |