Theorem f1resrcmplf1d 35077

Description: If a function's restriction to a subclass of its domain and its restriction to the relative complement of that subclass are both one-to-one, and if the ranges of those two restrictions are disjoint, then the function is itself one-to-one. (Contributed by BTernaryTau, 28-Sep-2023.)

Hypotheses

Ref	Expression
f1resrcmplf1d.1	⊢ (𝜑 → 𝐶 ⊆ 𝐴)
f1resrcmplf1d.2	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
f1resrcmplf1d.3	⊢ (𝜑 → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵)
f1resrcmplf1d.4	⊢ (𝜑 → (𝐹 ↾ (𝐴 ∖ 𝐶)):(𝐴 ∖ 𝐶)–1-1→𝐵)
f1resrcmplf1d.5	⊢ (𝜑 → ((𝐹 “ 𝐶) ∩ (𝐹 “ (𝐴 ∖ 𝐶))) = ∅)

Assertion

Ref	Expression
f1resrcmplf1d	⊢ (𝜑 → 𝐹:𝐴–1-1→𝐵)

Proof of Theorem f1resrcmplf1d

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		f1resrcmplf1d.2	. 2 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
2		f1resrcmplf1d.3	. . . . . 6 ⊢ (𝜑 → (𝐹 ↾ 𝐶):𝐶–1-1→𝐵)
3		f1resveqaeq 35075	. . . . . 6 ⊢ (((𝐹 ↾ 𝐶):𝐶–1-1→𝐵 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
4	2, 3	sylan 580	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
5	4	ex 412	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
6		f1resrcmplf1d.1	. . . . 5 ⊢ (𝜑 → 𝐶 ⊆ 𝐴)
7		difssd 4100	. . . . 5 ⊢ (𝜑 → (𝐴 ∖ 𝐶) ⊆ 𝐴)
8		f1resrcmplf1d.5	. . . . 5 ⊢ (𝜑 → ((𝐹 “ 𝐶) ∩ (𝐹 “ (𝐴 ∖ 𝐶))) = ∅)
9	6, 7, 1, 8	f1resrcmplf1dlem 35076	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ (𝐴 ∖ 𝐶)) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
10		incom 4172	. . . . . 6 ⊢ ((𝐹 “ 𝐶) ∩ (𝐹 “ (𝐴 ∖ 𝐶))) = ((𝐹 “ (𝐴 ∖ 𝐶)) ∩ (𝐹 “ 𝐶))
11	10, 8	eqtr3id 2778	. . . . 5 ⊢ (𝜑 → ((𝐹 “ (𝐴 ∖ 𝐶)) ∩ (𝐹 “ 𝐶)) = ∅)
12	7, 6, 1, 11	f1resrcmplf1dlem 35076	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ∖ 𝐶) ∧ 𝑦 ∈ 𝐶) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
13		f1resrcmplf1d.4	. . . . . 6 ⊢ (𝜑 → (𝐹 ↾ (𝐴 ∖ 𝐶)):(𝐴 ∖ 𝐶)–1-1→𝐵)
14		f1resveqaeq 35075	. . . . . 6 ⊢ (((𝐹 ↾ (𝐴 ∖ 𝐶)):(𝐴 ∖ 𝐶)–1-1→𝐵 ∧ (𝑥 ∈ (𝐴 ∖ 𝐶) ∧ 𝑦 ∈ (𝐴 ∖ 𝐶))) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
15	13, 14	sylan 580	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝐴 ∖ 𝐶) ∧ 𝑦 ∈ (𝐴 ∖ 𝐶))) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
16	15	ex 412	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ∖ 𝐶) ∧ 𝑦 ∈ (𝐴 ∖ 𝐶)) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
17	5, 9, 12, 16	prsrcmpltd 35071	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
18	17	ralrimivv 3178	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
19		dff13 7229	. 2 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
20	1, 18, 19	sylanbrc 583	1 ⊢ (𝜑 → 𝐹:𝐴–1-1→𝐵)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044   ∖ cdif 3911   ∩ cin 3913   ⊆ wss 3914  ∅c0 4296   ↾ cres 5640   “ cima 5641  ⟶wf 6507  –1-1→wf1 6508  ‘cfv 6511

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 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fv 6519

This theorem is referenced by:  f1resfz0f1d  35101