![]() |
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 6920), 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 6920 | . . . 4 ⊢ (𝐹‘𝐴) ∈ V | |
2 | eleq1a 2834 | . . . 4 ⊢ ((𝐹‘𝐴) ∈ V → (V = (𝐹‘𝐴) → V ∈ V)) | |
3 | 1, 2 | ax-mp 5 | . . 3 ⊢ (V = (𝐹‘𝐴) → V ∈ V) |
4 | vprc 5321 | . . . 4 ⊢ ¬ V ∈ V | |
5 | 4 | pm2.21i 119 | . . 3 ⊢ (V ∈ V → (𝐹‘𝐴) = 𝐵) |
6 | 3, 5 | syl 17 | . 2 ⊢ (V = (𝐹‘𝐴) → (𝐹‘𝐴) = 𝐵) |
7 | 6 | eqcoms 2743 | 1 ⊢ ((𝐹‘𝐴) = V → (𝐹‘𝐴) = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2106 Vcvv 3478 ‘cfv 6563 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 ax-sep 5302 ax-nul 5312 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-ne 2939 df-v 3480 df-dif 3966 df-un 3968 df-ss 3980 df-nul 4340 df-sn 4632 df-pr 4634 df-uni 4913 df-iota 6516 df-fv 6571 |
This theorem is referenced by: afvpcfv0 47096 |
Copyright terms: Public domain | W3C validator |