Theorem fveqvfvv 48051

Description: If a function's value at an argument is the universal class (which can never be the case because of fvex 6890), 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.)

Assertion

Ref	Expression
fveqvfvv	⊢ ((𝐹‘𝐴) = V → (𝐹‘𝐴) = 𝐵)

Proof of Theorem fveqvfvv

Step	Hyp	Ref	Expression
1		fvex 6890	. . . 4 ⊢ (𝐹‘𝐴) ∈ V
2		eleq1a 2856	. . . 4 ⊢ ((𝐹‘𝐴) ∈ V → (V = (𝐹‘𝐴) → V ∈ V))
3	1, 2	ax-mp 5	. . 3 ⊢ (V = (𝐹‘𝐴) → V ∈ V)
4		vprc 5274	. . . 4 ⊢ ¬ V ∈ V
5	4	pm2.21i 120	. . 3 ⊢ (V ∈ V → (𝐹‘𝐴) = 𝐵)
6	3, 5	syl 18	. 2 ⊢ (V = (𝐹‘𝐴) → (𝐹‘𝐴) = 𝐵)
7	6	eqcoms 2769	1 ⊢ ((𝐹‘𝐴) = V → (𝐹‘𝐴) = 𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ‘cfv 6531

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 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-nul 5260

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-sn 4585  df-pr 4587  df-uni 4868  df-iota 6487  df-fv 6539

This theorem is used by:  afvpcfv0  48157