Proof of Theorem fconst2
| Step | Hyp | Ref
| Expression |
| 1 | | fvconst 2899 |
. . . . . . 7
⊢ ((F:A–→{B} ∧ x
∈ A) → (F ‘x) =
B) |
| 2 | | fconst2.1 |
. . . . . . . . . 10
⊢ B
∈ V |
| 3 | 2 | fconst 2774 |
. . . . . . . . 9
⊢ (A
× {B}):A–→{B} |
| 4 | | fvconst 2899 |
. . . . . . . . 9
⊢ (((A
× {B}):A–→{B} ∧ x
∈ A) → ((A × {B})
‘x) = B) |
| 5 | 3, 4 | mpan 518 |
. . . . . . . 8
⊢ (x
∈ A → ((A × {B})
‘x) = B) |
| 6 | 5 | adantl 305 |
. . . . . . 7
⊢ ((F:A–→{B} ∧ x
∈ A) → ((A × {B})
‘x) = B) |
| 7 | 1, 6 | eqtr4d 1131 |
. . . . . 6
⊢ ((F:A–→{B} ∧ x
∈ A) → (F ‘x) =
((A × {B}) ‘x)) |
| 8 | 7 | exp 291 |
. . . . 5
⊢ (F:A–→{B} → (x
∈ A → (F ‘x) =
((A × {B}) ‘x))) |
| 9 | 8 | r19.21aiv 1259 |
. . . 4
⊢ (F:A–→{B} → ∀x ∈ A
(F ‘x) = ((A ×
{B}) ‘x)) |
| 10 | | cleqid 1102 |
. . . 4
⊢ A =
A |
| 11 | 9, 10 | jctil 240 |
. . 3
⊢ (F:A–→{B} → (A =
A ∧ ∀x ∈ A
(F ‘x) = ((A ×
{B}) ‘x))) |
| 12 | | ffn 2752 |
. . . 4
⊢ (F:A–→{B} → F Fn
A) |
| 13 | | ffn 2752 |
. . . . . 6
⊢ ((A
× {B}):A–→{B} → (A
× {B}) Fn A) |
| 14 | 3, 13 | ax-mp 6 |
. . . . 5
⊢ (A
× {B}) Fn A |
| 15 | | cleqfv 2880 |
. . . . 5
⊢ ((F Fn
A ∧ (A × {B})
Fn A) → (F = (A ×
{B}) ↔ (A = A ∧
∀x ∈ A (F
‘x) = ((A × {B})
‘x)))) |
| 16 | 14, 15 | mpan2 519 |
. . . 4
⊢ (F Fn
A → (F = (A ×
{B}) ↔ (A = A ∧
∀x ∈ A (F
‘x) = ((A × {B})
‘x)))) |
| 17 | 12, 16 | syl 12 |
. . 3
⊢ (F:A–→{B} → (F =
(A × {B}) ↔ (A =
A ∧ ∀x ∈ A
(F ‘x) = ((A ×
{B}) ‘x)))) |
| 18 | 11, 17 | mpbird 171 |
. 2
⊢ (F:A–→{B} → F =
(A × {B})) |
| 19 | | feq1 2748 |
. . 3
⊢ (F =
(A × {B}) → (F:A–→{B} ↔ (A
× {B}):A–→{B})) |
| 20 | 3, 19 | mpbiri 169 |
. 2
⊢ (F =
(A × {B}) → F:A–→{B}) |
| 21 | 18, 20 | impbi 139 |
1
⊢ (F:A–→{B} ↔ F =
(A × {B})) |