| 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 6843), 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 6843 | . . . 4 ⊢ (𝐹‘𝐴) ∈ V | |
| 2 | eleq1a 2831 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ V → (V = (𝐹‘𝐴) → V ∈ V)) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ (V = (𝐹‘𝐴) → V ∈ V) |
| 4 | vprc 5245 | . . . 4 ⊢ ¬ V ∈ V | |
| 5 | 4 | pm2.21i 119 | . . 3 ⊢ (V ∈ V → (𝐹‘𝐴) = 𝐵) |
| 6 | 3, 5 | syl 17 | . 2 ⊢ (V = (𝐹‘𝐴) → (𝐹‘𝐴) = 𝐵) |
| 7 | 6 | eqcoms 2744 | 1 ⊢ ((𝐹‘𝐴) = V → (𝐹‘𝐴) = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1543 ∈ wcel 2115 Vcvv 3428 ‘cfv 6488 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1970 ax-7 2011 ax-8 2117 ax-9 2125 ax-ext 2708 ax-sep 5221 ax-nul 5231 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 850 df-tru 1546 df-fal 1556 df-ex 1783 df-sb 2070 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2932 df-v 3430 df-dif 3889 df-un 3891 df-ss 3903 df-nul 4265 df-sn 4559 df-pr 4561 df-uni 4842 df-iota 6444 df-fv 6496 |
| This theorem is referenced by: afvpcfv0 47606 |
| Copyright terms: Public domain | W3C validator |