| 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 6884), 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 120). (Contributed by Alexander van der Vekens, 26-May-2017.) |
| Ref | Expression |
|---|---|
| fveqvfvv | ⊢ ((𝐹‘𝐴) = V → (𝐹‘𝐴) = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvex 6884 | . . . 4 ⊢ (𝐹‘𝐴) ∈ V | |
| 2 | eleq1a 2860 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ V → (V = (𝐹‘𝐴) → V ∈ V)) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ (V = (𝐹‘𝐴) → V ∈ V) |
| 4 | vprc 5275 | . . . 4 ⊢ ¬ V ∈ V | |
| 5 | 4 | pm2.21i 120 | . . 3 ⊢ (V ∈ V → (𝐹‘𝐴) = 𝐵) |
| 6 | 3, 5 | syl 18 | . 2 ⊢ (V = (𝐹‘𝐴) → (𝐹‘𝐴) = 𝐵) |
| 7 | 6 | eqcoms 2773 | 1 ⊢ ((𝐹‘𝐴) = V → (𝐹‘𝐴) = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1563 ∈ wcel 2145 Vcvv 3457 ‘cfv 6525 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 ax-sep 5251 ax-nul 5261 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-v 3459 df-dif 3910 df-un 3912 df-ss 3924 df-nul 4289 df-sn 4586 df-pr 4588 df-uni 4869 df-iota 6481 df-fv 6533 |
| This theorem is referenced by: afvpcfv0 47738 |
| Copyright terms: Public domain | W3C validator |