Metamath Proof Explorer


Theorem resf1ext2b

Description: Extension of an injection which is a restriction of a function. (Contributed by AV, 3-Oct-2025)

Ref Expression
Assertion resf1ext2b ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → Fun ⁡ F ↾ C -1 ∧ F ⁡ X ∉ F C ↔ Fun ⁡ F ↾ C ∪ X -1

Proof

Step Hyp Ref Expression
1 fssres ⊢ F : A ⟶ B ∧ C ⊆ A → F ↾ C : C ⟶ B
2 1 3adant2 ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → F ↾ C : C ⟶ B
3 df-f1 ⊢ F ↾ C : C ⟶ 1-1 B ↔ F ↾ C : C ⟶ B ∧ Fun ⁡ F ↾ C -1
4 resf1extb ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → F ↾ C : C ⟶ 1-1 B ∧ F ⁡ X ∉ F C ↔ F ↾ C ∪ X : C ∪ X ⟶ 1-1 B
5 df-f1 ⊢ F ↾ C ∪ X : C ∪ X ⟶ 1-1 B ↔ F ↾ C ∪ X : C ∪ X ⟶ B ∧ Fun ⁡ F ↾ C ∪ X -1
6 5 simprbi ⊢ F ↾ C ∪ X : C ∪ X ⟶ 1-1 B → Fun ⁡ F ↾ C ∪ X -1
7 4 6 biimtrdi ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → F ↾ C : C ⟶ 1-1 B ∧ F ⁡ X ∉ F C → Fun ⁡ F ↾ C ∪ X -1
8 7 expd ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → F ↾ C : C ⟶ 1-1 B → F ⁡ X ∉ F C → Fun ⁡ F ↾ C ∪ X -1
9 3 8 biimtrrid ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → F ↾ C : C ⟶ B ∧ Fun ⁡ F ↾ C -1 → F ⁡ X ∉ F C → Fun ⁡ F ↾ C ∪ X -1
10 2 9 mpand ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → Fun ⁡ F ↾ C -1 → F ⁡ X ∉ F C → Fun ⁡ F ↾ C ∪ X -1
11 10 impd ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → Fun ⁡ F ↾ C -1 ∧ F ⁡ X ∉ F C → Fun ⁡ F ↾ C ∪ X -1
12 simp1 ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → F : A ⟶ B
13 simp3 ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → C ⊆ A
14 eldifi ⊢ X ∈ A ∖ C → X ∈ A
15 14 snssd ⊢ X ∈ A ∖ C → X ⊆ A
16 15 3ad2ant2 ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → X ⊆ A
17 13 16 unssd ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → C ∪ X ⊆ A
18 12 17 fssresd ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → F ↾ C ∪ X : C ∪ X ⟶ B
19 3 simprbi ⊢ F ↾ C : C ⟶ 1-1 B → Fun ⁡ F ↾ C -1
20 19 anim1i ⊢ F ↾ C : C ⟶ 1-1 B ∧ F ⁡ X ∉ F C → Fun ⁡ F ↾ C -1 ∧ F ⁡ X ∉ F C
21 4 20 biimtrrdi ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → F ↾ C ∪ X : C ∪ X ⟶ 1-1 B → Fun ⁡ F ↾ C -1 ∧ F ⁡ X ∉ F C
22 5 21 biimtrrid ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → F ↾ C ∪ X : C ∪ X ⟶ B ∧ Fun ⁡ F ↾ C ∪ X -1 → Fun ⁡ F ↾ C -1 ∧ F ⁡ X ∉ F C
23 18 22 mpand ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → Fun ⁡ F ↾ C ∪ X -1 → Fun ⁡ F ↾ C -1 ∧ F ⁡ X ∉ F C
24 11 23 impbid ⊢ F : A ⟶ B ∧ X ∈ A ∖ C ∧ C ⊆ A → Fun ⁡ F ↾ C -1 ∧ F ⁡ X ∉ F C ↔ Fun ⁡ F ↾ C ∪ X -1