Theorem resf1ext2b 7936

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

Assertion

Ref	Expression
resf1ext2b	⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → ((Fun ◡(𝐹 ↾ 𝐶) ∧ (𝐹‘𝑋) ∉ (𝐹 “ 𝐶)) ↔ Fun ◡(𝐹 ↾ (𝐶 ∪ {𝑋}))))

Proof of Theorem resf1ext2b

Step	Hyp	Ref	Expression
1		fssres 6749	. . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶⟶𝐵)
2	1	3adant2 1131	. . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶⟶𝐵)
3		df-f1 6541	. . . . 5 ⊢ ((𝐹 ↾ 𝐶):𝐶–1-1→𝐵 ↔ ((𝐹 ↾ 𝐶):𝐶⟶𝐵 ∧ Fun ◡(𝐹 ↾ 𝐶)))
4		resf1extb 7935	. . . . . . 7 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → (((𝐹 ↾ 𝐶):𝐶–1-1→𝐵 ∧ (𝐹‘𝑋) ∉ (𝐹 “ 𝐶)) ↔ (𝐹 ↾ (𝐶 ∪ {𝑋})):(𝐶 ∪ {𝑋})–1-1→𝐵))
5		df-f1 6541	. . . . . . . 8 ⊢ ((𝐹 ↾ (𝐶 ∪ {𝑋})):(𝐶 ∪ {𝑋})–1-1→𝐵 ↔ ((𝐹 ↾ (𝐶 ∪ {𝑋})):(𝐶 ∪ {𝑋})⟶𝐵 ∧ Fun ◡(𝐹 ↾ (𝐶 ∪ {𝑋}))))
6	5	simprbi 496	. . . . . . 7 ⊢ ((𝐹 ↾ (𝐶 ∪ {𝑋})):(𝐶 ∪ {𝑋})–1-1→𝐵 → Fun ◡(𝐹 ↾ (𝐶 ∪ {𝑋})))
7	4, 6	biimtrdi 253	. . . . . 6 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → (((𝐹 ↾ 𝐶):𝐶–1-1→𝐵 ∧ (𝐹‘𝑋) ∉ (𝐹 “ 𝐶)) → Fun ◡(𝐹 ↾ (𝐶 ∪ {𝑋}))))
8	7	expd 415	. . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → ((𝐹 ↾ 𝐶):𝐶–1-1→𝐵 → ((𝐹‘𝑋) ∉ (𝐹 “ 𝐶) → Fun ◡(𝐹 ↾ (𝐶 ∪ {𝑋})))))
9	3, 8	biimtrrid 243	. . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → (((𝐹 ↾ 𝐶):𝐶⟶𝐵 ∧ Fun ◡(𝐹 ↾ 𝐶)) → ((𝐹‘𝑋) ∉ (𝐹 “ 𝐶) → Fun ◡(𝐹 ↾ (𝐶 ∪ {𝑋})))))
10	2, 9	mpand 695	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → (Fun ◡(𝐹 ↾ 𝐶) → ((𝐹‘𝑋) ∉ (𝐹 “ 𝐶) → Fun ◡(𝐹 ↾ (𝐶 ∪ {𝑋})))))
11	10	impd 410	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → ((Fun ◡(𝐹 ↾ 𝐶) ∧ (𝐹‘𝑋) ∉ (𝐹 “ 𝐶)) → Fun ◡(𝐹 ↾ (𝐶 ∪ {𝑋}))))
12		simp1 1136	. . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → 𝐹:𝐴⟶𝐵)
13		simp3 1138	. . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → 𝐶 ⊆ 𝐴)
14		eldifi 4111	. . . . . . 7 ⊢ (𝑋 ∈ (𝐴 ∖ 𝐶) → 𝑋 ∈ 𝐴)
15	14	snssd 4790	. . . . . 6 ⊢ (𝑋 ∈ (𝐴 ∖ 𝐶) → {𝑋} ⊆ 𝐴)
16	15	3ad2ant2 1134	. . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → {𝑋} ⊆ 𝐴)
17	13, 16	unssd 4172	. . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → (𝐶 ∪ {𝑋}) ⊆ 𝐴)
18	12, 17	fssresd 6750	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ (𝐶 ∪ {𝑋})):(𝐶 ∪ {𝑋})⟶𝐵)
19	3	simprbi 496	. . . . . 6 ⊢ ((𝐹 ↾ 𝐶):𝐶–1-1→𝐵 → Fun ◡(𝐹 ↾ 𝐶))
20	19	anim1i 615	. . . . 5 ⊢ (((𝐹 ↾ 𝐶):𝐶–1-1→𝐵 ∧ (𝐹‘𝑋) ∉ (𝐹 “ 𝐶)) → (Fun ◡(𝐹 ↾ 𝐶) ∧ (𝐹‘𝑋) ∉ (𝐹 “ 𝐶)))
21	4, 20	biimtrrdi 254	. . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → ((𝐹 ↾ (𝐶 ∪ {𝑋})):(𝐶 ∪ {𝑋})–1-1→𝐵 → (Fun ◡(𝐹 ↾ 𝐶) ∧ (𝐹‘𝑋) ∉ (𝐹 “ 𝐶))))
22	5, 21	biimtrrid 243	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → (((𝐹 ↾ (𝐶 ∪ {𝑋})):(𝐶 ∪ {𝑋})⟶𝐵 ∧ Fun ◡(𝐹 ↾ (𝐶 ∪ {𝑋}))) → (Fun ◡(𝐹 ↾ 𝐶) ∧ (𝐹‘𝑋) ∉ (𝐹 “ 𝐶))))
23	18, 22	mpand 695	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → (Fun ◡(𝐹 ↾ (𝐶 ∪ {𝑋})) → (Fun ◡(𝐹 ↾ 𝐶) ∧ (𝐹‘𝑋) ∉ (𝐹 “ 𝐶))))
24	11, 23	impbid 212	1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ (𝐴 ∖ 𝐶) ∧ 𝐶 ⊆ 𝐴) → ((Fun ◡(𝐹 ↾ 𝐶) ∧ (𝐹‘𝑋) ∉ (𝐹 “ 𝐶)) ↔ Fun ◡(𝐹 ↾ (𝐶 ∪ {𝑋}))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   ∈ wcel 2109   ∉ wnel 3037   ∖ cdif 3928   ∪ cun 3929   ⊆ wss 3931  {csn 4606  ^◡ccnv 5658   ↾ cres 5661   “ cima 5662  Fun wfun 6530  ⟶wf 6532  –1-1→wf1 6533  ‘cfv 6536

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-br 5125  df-opab 5187  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fv 6544

This theorem is referenced by:  dfpth2  29716