| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > funbreq | Structured version Visualization version GIF version | ||
| Description: An equality condition for functions. (Contributed by Scott Fenton, 18-Feb-2013.) |
| Ref | Expression |
|---|---|
| funbreq.1 | ⊢ 𝐴 ∈ V |
| funbreq.2 | ⊢ 𝐵 ∈ V |
| funbreq.3 | ⊢ 𝐶 ∈ V |
| Ref | Expression |
|---|---|
| funbreq | ⊢ ((Fun 𝐹 ∧ 𝐴𝐹𝐵) → (𝐴𝐹𝐶 ↔ 𝐵 = 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | funbreq.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 2 | funbreq.2 | . . . 4 ⊢ 𝐵 ∈ V | |
| 3 | funbreq.3 | . . . 4 ⊢ 𝐶 ∈ V | |
| 4 | 1, 2, 3 | fununiq 36300 | . . 3 ⊢ (Fun 𝐹 → ((𝐴𝐹𝐵 ∧ 𝐴𝐹𝐶) → 𝐵 = 𝐶)) |
| 5 | 4 | expdimp 458 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴𝐹𝐵) → (𝐴𝐹𝐶 → 𝐵 = 𝐶)) |
| 6 | breq2 5115 | . . . 4 ⊢ (𝐵 = 𝐶 → (𝐴𝐹𝐵 ↔ 𝐴𝐹𝐶)) | |
| 7 | 6 | biimpcd 252 | . . 3 ⊢ (𝐴𝐹𝐵 → (𝐵 = 𝐶 → 𝐴𝐹𝐶)) |
| 8 | 7 | adantl 487 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴𝐹𝐵) → (𝐵 = 𝐶 → 𝐴𝐹𝐶)) |
| 9 | 5, 8 | impbid 215 | 1 ⊢ ((Fun 𝐹 ∧ 𝐴𝐹𝐵) → (𝐴𝐹𝐶 ↔ 𝐵 = 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 Vcvv 3457 class class class wbr 5111 Fun wfun 6534 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 ax-sep 5259 ax-pr 5406 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-br 5112 df-opab 5176 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-fun 6542 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |