Metamath Proof Explorer


Theorem ffoss

Description: Relationship between a mapping and an onto mapping. Figure 38 of Enderton p. 145. (Contributed by NM, 10-May-1998)

Ref Expression
Hypothesis f11o.1 ⊢ F ∈ V
Assertion ffoss ⊢ F : A ⟶ B ↔ ∃ x F : A ⟶ onto x ∧ x ⊆ B

Proof

Step Hyp Ref Expression
1 f11o.1 ⊢ F ∈ V
2 df-f ⊢ F : A ⟶ B ↔ F Fn A ∧ ran ⁡ F ⊆ B
3 dffn4 ⊢ F Fn A ↔ F : A ⟶ onto ran ⁡ F
4 3 anbi1i ⊢ F Fn A ∧ ran ⁡ F ⊆ B ↔ F : A ⟶ onto ran ⁡ F ∧ ran ⁡ F ⊆ B
5 2 4 bitri ⊢ F : A ⟶ B ↔ F : A ⟶ onto ran ⁡ F ∧ ran ⁡ F ⊆ B
6 1 rnex ⊢ ran ⁡ F ∈ V
7 foeq3 ⊢ x = ran ⁡ F → F : A ⟶ onto x ↔ F : A ⟶ onto ran ⁡ F
8 sseq1 ⊢ x = ran ⁡ F → x ⊆ B ↔ ran ⁡ F ⊆ B
9 7 8 anbi12d ⊢ x = ran ⁡ F → F : A ⟶ onto x ∧ x ⊆ B ↔ F : A ⟶ onto ran ⁡ F ∧ ran ⁡ F ⊆ B
10 6 9 spcev ⊢ F : A ⟶ onto ran ⁡ F ∧ ran ⁡ F ⊆ B → ∃ x F : A ⟶ onto x ∧ x ⊆ B
11 5 10 sylbi ⊢ F : A ⟶ B → ∃ x F : A ⟶ onto x ∧ x ⊆ B
12 fof ⊢ F : A ⟶ onto x → F : A ⟶ x
13 fss ⊢ F : A ⟶ x ∧ x ⊆ B → F : A ⟶ B
14 12 13 sylan ⊢ F : A ⟶ onto x ∧ x ⊆ B → F : A ⟶ B
15 14 exlimiv ⊢ ∃ x F : A ⟶ onto x ∧ x ⊆ B → F : A ⟶ B
16 11 15 impbii ⊢ F : A ⟶ B ↔ ∃ x F : A ⟶ onto x ∧ x ⊆ B