Theorem f1oresf1o2 43847

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

Hypotheses

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

Assertion

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

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

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

Proof of Theorem f1oresf1o2

Step	Hyp	Ref	Expression
1		f1oresf1o2.1	. 2 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)
2		f1oresf1o2.2	. 2 ⊢ (𝜑 → 𝐷 ⊆ 𝐴)
3		f1of 6590	. . . . . . . . . . 11 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴⟶𝐵)
4	1, 3	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
5	4	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐹:𝐴⟶𝐵)
6	2	sselda 3915	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝑥 ∈ 𝐴)
7	5, 6	jca 515	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴))
8	7	3adant3 1129	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → (𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴))
9		ffvelrn 6826	. . . . . . 7 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵)
10	8, 9	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → (𝐹‘𝑥) ∈ 𝐵)
11		eleq1 2877	. . . . . . 7 ⊢ ((𝐹‘𝑥) = 𝑦 → ((𝐹‘𝑥) ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
12	11	3ad2ant3 1132	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → ((𝐹‘𝑥) ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
13	10, 12	mpbid 235	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → 𝑦 ∈ 𝐵)
14		eqcom 2805	. . . . . . . 8 ⊢ ((𝐹‘𝑥) = 𝑦 ↔ 𝑦 = (𝐹‘𝑥))
15		f1oresf1o2.3	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑥 ∈ 𝐷 ↔ 𝜒))
16	15	biimpd 232	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑥 ∈ 𝐷 → 𝜒))
17	16	ex 416	. . . . . . . 8 ⊢ (𝜑 → (𝑦 = (𝐹‘𝑥) → (𝑥 ∈ 𝐷 → 𝜒)))
18	14, 17	syl5bi 245	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝑥) = 𝑦 → (𝑥 ∈ 𝐷 → 𝜒)))
19	18	com23 86	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐷 → ((𝐹‘𝑥) = 𝑦 → 𝜒)))
20	19	3imp 1108	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → 𝜒)
21	13, 20	jca 515	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → (𝑦 ∈ 𝐵 ∧ 𝜒))
22	21	rexlimdv3a 3245	. . 3 ⊢ (𝜑 → (∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦 → (𝑦 ∈ 𝐵 ∧ 𝜒)))
23		f1ofo 6597	. . . . . . . 8 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴–onto→𝐵)
24	1, 23	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴–onto→𝐵)
25		foelrni 6702	. . . . . . 7 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
26	24, 25	sylan 583	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
27	26	ex 416	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦))
28		nfv 1915	. . . . . 6 ⊢ Ⅎ𝑥𝜑
29		nfv 1915	. . . . . . 7 ⊢ Ⅎ𝑥𝜒
30		nfre1 3265	. . . . . . 7 ⊢ Ⅎ𝑥∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦
31	29, 30	nfim 1897	. . . . . 6 ⊢ Ⅎ𝑥(𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)
32		rspe 3263	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)
33	32	expcom 417	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑥) = 𝑦 → (𝑥 ∈ 𝐷 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
34	33	eqcoms 2806	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝐹‘𝑥) → (𝑥 ∈ 𝐷 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
35	34	adantl 485	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑥 ∈ 𝐷 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
36	15, 35	sylbird 263	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
37	36	ex 416	. . . . . . . . 9 ⊢ (𝜑 → (𝑦 = (𝐹‘𝑥) → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
38	37	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 = (𝐹‘𝑥) → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
39	14, 38	syl5bi 245	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝑦 → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
40	39	ex 416	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → ((𝐹‘𝑥) = 𝑦 → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))))
41	28, 31, 40	rexlimd 3276	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
42	27, 41	syld 47	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐵 → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
43	42	impd 414	. . 3 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ 𝜒) → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
44	22, 43	impbid 215	. 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦 ↔ (𝑦 ∈ 𝐵 ∧ 𝜒)))
45	1, 2, 44	f1oresf1o 43846	1 ⊢ (𝜑 → (𝐹 ↾ 𝐷):𝐷–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  ∃wrex 3107  {crab 3110   ⊆ wss 3881   ↾ cres 5521  ⟶wf 6320  –onto→wfo 6322  –1-1-onto→wf1o 6323  ‘cfv 6324

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332

This theorem is referenced by: (None)