Proof of Theorem fnex
| Step | Hyp | Ref
| Expression |
| 1 | | fndm 2723 |
. . . . . . 7
⊢ (F Fn
A → dom F = A) |
| 2 | 1 | eleq1d 1155 |
. . . . . 6
⊢ (F Fn
A → (dom F ∈ B
↔ A ∈ B)) |
| 3 | 2 | biimprd 136 |
. . . . 5
⊢ (F Fn
A → (A ∈ B
→ dom F ∈ B)) |
| 4 | | funimaexg 2715 |
. . . . . . . 8
⊢ (A
∈ B → (Fun F → (F
“ A) ∈ V)) |
| 5 | | fnfun 2721 |
. . . . . . . 8
⊢ (F Fn
A → Fun F) |
| 6 | 4, 5 | syl5 22 |
. . . . . . 7
⊢ (A
∈ B → (F Fn A →
(F “ A) ∈ V)) |
| 7 | 6 | com12 13 |
. . . . . 6
⊢ (F Fn
A → (A ∈ B
→ (F “ A) ∈ V)) |
| 8 | | imaeq2 2603 |
. . . . . . . . 9
⊢ (dom F
= A → (F “ dom F)
= (F “ A)) |
| 9 | 1, 8 | syl 12 |
. . . . . . . 8
⊢ (F Fn
A → (F “ dom F)
= (F “ A)) |
| 10 | | imadmrn 2610 |
. . . . . . . 8
⊢ (F
“ dom F) = ran F |
| 11 | 9, 10 | syl5eqr 1138 |
. . . . . . 7
⊢ (F Fn
A → ran F = (F “
A)) |
| 12 | 11 | eleq1d 1155 |
. . . . . 6
⊢ (F Fn
A → (ran F ∈ V ↔ (F “ A)
∈ V)) |
| 13 | 7, 12 | sylibrd 179 |
. . . . 5
⊢ (F Fn
A → (A ∈ B
→ ran F ∈ V)) |
| 14 | 3, 13 | jcad 455 |
. . . 4
⊢ (F Fn
A → (A ∈ B
→ (dom F ∈ B ∧ ran F
∈ V))) |
| 15 | | xpexg 2489 |
. . . 4
⊢ ((dom F ∈ B ∧
ran F ∈ V) → (dom F × ran F)
∈ V) |
| 16 | 14, 15 | syl6 23 |
. . 3
⊢ (F Fn
A → (A ∈ B
→ (dom F × ran F) ∈ V)) |
| 17 | | ssexg 1702 |
. . . . 5
⊢ ((dom F × ran F)
∈ V → (F ⊆ (dom
F × ran F) → F
∈ V)) |
| 18 | | fnrel 2722 |
. . . . . 6
⊢ (F Fn
A → Rel F) |
| 19 | | relssdr 2668 |
. . . . . 6
⊢ (Rel F
→ F ⊆ (dom F × ran F)) |
| 20 | 18, 19 | syl 12 |
. . . . 5
⊢ (F Fn
A → F ⊆ (dom F
× ran F)) |
| 21 | 17, 20 | syl5 22 |
. . . 4
⊢ ((dom F × ran F)
∈ V → (F Fn A → F
∈ V)) |
| 22 | 21 | com12 13 |
. . 3
⊢ (F Fn
A → ((dom F × ran F)
∈ V → F ∈
V)) |
| 23 | 16, 22 | syld 27 |
. 2
⊢ (F Fn
A → (A ∈ B
→ F ∈ V)) |
| 24 | 23 | com12 13 |
1
⊢ (A
∈ B → (F Fn A →
F ∈ V)) |