| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fveqvfvv | Structured version Visualization version GIF version | ||
| Description: If a function's value at an argument is the universal class (which can never be the case because of fvex 6845), the function's value at this argument is any set (especially the empty set). In short "If a function's value is a proper class, it is a set", which sounds strange/contradictory, but which is a consequence of that a contradiction implies anything (see pm2.21i 119). (Contributed by Alexander van der Vekens, 26-May-2017.) |
| Ref | Expression |
|---|---|
| fveqvfvv | ⊢ ((𝐹‘𝐴) = V → (𝐹‘𝐴) = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvex 6845 | . . . 4 ⊢ (𝐹‘𝐴) ∈ V | |
| 2 | eleq1a 2829 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ V → (V = (𝐹‘𝐴) → V ∈ V)) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ (V = (𝐹‘𝐴) → V ∈ V) |
| 4 | vprc 5258 | . . . 4 ⊢ ¬ V ∈ V | |
| 5 | 4 | pm2.21i 119 | . . 3 ⊢ (V ∈ V → (𝐹‘𝐴) = 𝐵) |
| 6 | 3, 5 | syl 17 | . 2 ⊢ (V = (𝐹‘𝐴) → (𝐹‘𝐴) = 𝐵) |
| 7 | 6 | eqcoms 2742 | 1 ⊢ ((𝐹‘𝐴) = V → (𝐹‘𝐴) = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 Vcvv 3438 ‘cfv 6490 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 ax-sep 5239 ax-nul 5249 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-ne 2931 df-v 3440 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4284 df-sn 4579 df-pr 4581 df-uni 4862 df-iota 6446 df-fv 6498 |
| This theorem is referenced by: afvpcfv0 47334 |
| Copyright terms: Public domain | W3C validator |