Theorem f1oresf1o 48186

Description: Build a bijection by restricting the domain of a bijection. (Contributed by AV, 31-Jul-2022.)

Hypotheses

Ref	Expression
f1oresf1o.1	⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)
f1oresf1o.2	⊢ (𝜑 → 𝐷 ⊆ 𝐴)
f1oresf1o.3	⊢ (𝜑 → (∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦 ↔ (𝑦 ∈ 𝐵 ∧ 𝜒)))

Assertion

Ref	Expression
f1oresf1o	⊢ (𝜑 → (𝐹 ↾ 𝐷):𝐷–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑦,𝐷   𝑥,𝐹,𝑦   𝜑,𝑥,𝑦   𝜒,𝑥

Allowed substitution hints:   𝜒(𝑦)   𝐴(𝑦)   𝐵(𝑦)

Proof of Theorem f1oresf1o

Step	Hyp	Ref	Expression
1		f1oresf1o.1	. . . 4 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)
2		f1of1 6820	. . . 4 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴–1-1→𝐵)
3	1, 2	syl 18	. . 3 ⊢ (𝜑 → 𝐹:𝐴–1-1→𝐵)
4		f1oresf1o.2	. . 3 ⊢ (𝜑 → 𝐷 ⊆ 𝐴)
5		f1ores 6836	. . 3 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐷 ⊆ 𝐴) → (𝐹 ↾ 𝐷):𝐷–1-1-onto→(𝐹 “ 𝐷))
6	3, 4, 5	syl2anc 596	. 2 ⊢ (𝜑 → (𝐹 ↾ 𝐷):𝐷–1-1-onto→(𝐹 “ 𝐷))
7		f1ofun 6823	. . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → Fun 𝐹)
8	1, 7	syl 18	. . . . 5 ⊢ (𝜑 → Fun 𝐹)
9		f1odm 6825	. . . . . . 7 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → dom 𝐹 = 𝐴)
10	1, 9	syl 18	. . . . . 6 ⊢ (𝜑 → dom 𝐹 = 𝐴)
11	4, 10	sseqtrrd 3971	. . . . 5 ⊢ (𝜑 → 𝐷 ⊆ dom 𝐹)
12		dfimafn 6944	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐷 ⊆ dom 𝐹) → (𝐹 “ 𝐷) = {𝑦 ∣ ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦})
13	8, 11, 12	syl2anc 596	. . . 4 ⊢ (𝜑 → (𝐹 “ 𝐷) = {𝑦 ∣ ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦})
14		f1oresf1o.3	. . . . . 6 ⊢ (𝜑 → (∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦 ↔ (𝑦 ∈ 𝐵 ∧ 𝜒)))
15	14	abbidv 2828	. . . . 5 ⊢ (𝜑 → {𝑦 ∣ ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜒)})
16		df-rab 3415	. . . . 5 ⊢ {𝑦 ∈ 𝐵 ∣ 𝜒} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜒)}
17	15, 16	eqtr4di 2815	. . . 4 ⊢ (𝜑 → {𝑦 ∣ ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦} = {𝑦 ∈ 𝐵 ∣ 𝜒})
18	13, 17	eqtr2d 2798	. . 3 ⊢ (𝜑 → {𝑦 ∈ 𝐵 ∣ 𝜒} = (𝐹 “ 𝐷))
19	18	f1oeq3d 6818	. 2 ⊢ (𝜑 → ((𝐹 ↾ 𝐷):𝐷–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒} ↔ (𝐹 ↾ 𝐷):𝐷–1-1-onto→(𝐹 “ 𝐷)))
20	6, 19	mpbird 260	1 ⊢ (𝜑 → (𝐹 ↾ 𝐷):𝐷–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2740  ∃wrex 3088  {crab 3414   ⊆ wss 3902  dom cdm 5659   ↾ cres 5661   “ cima 5662  Fun wfun 6531  –1-1→wf1 6534  –1-1-onto→wf1o 6536  ‘cfv 6537

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  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 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545

This theorem is used by:  f1oresf1o2  48187