Theorem f1oresf1o2 45643

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 6789	. . . . . . . . . . 11 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴⟶𝐵)
4	1, 3	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
5	4	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐹:𝐴⟶𝐵)
6	2	sselda 3947	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝑥 ∈ 𝐴)
7	5, 6	jca 512	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴))
8	7	3adant3 1132	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → (𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴))
9		ffvelcdm 7037	. . . . . . 7 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵)
10	8, 9	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → (𝐹‘𝑥) ∈ 𝐵)
11		eleq1 2820	. . . . . . 7 ⊢ ((𝐹‘𝑥) = 𝑦 → ((𝐹‘𝑥) ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
12	11	3ad2ant3 1135	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → ((𝐹‘𝑥) ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
13	10, 12	mpbid 231	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → 𝑦 ∈ 𝐵)
14		eqcom 2738	. . . . . . . 8 ⊢ ((𝐹‘𝑥) = 𝑦 ↔ 𝑦 = (𝐹‘𝑥))
15		f1oresf1o2.3	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑥 ∈ 𝐷 ↔ 𝜒))
16	15	biimpd 228	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑥 ∈ 𝐷 → 𝜒))
17	16	ex 413	. . . . . . . 8 ⊢ (𝜑 → (𝑦 = (𝐹‘𝑥) → (𝑥 ∈ 𝐷 → 𝜒)))
18	14, 17	biimtrid 241	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝑥) = 𝑦 → (𝑥 ∈ 𝐷 → 𝜒)))
19	18	com23 86	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐷 → ((𝐹‘𝑥) = 𝑦 → 𝜒)))
20	19	3imp 1111	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → 𝜒)
21	13, 20	jca 512	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → (𝑦 ∈ 𝐵 ∧ 𝜒))
22	21	rexlimdv3a 3152	. . 3 ⊢ (𝜑 → (∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦 → (𝑦 ∈ 𝐵 ∧ 𝜒)))
23		f1ofo 6796	. . . . . . . 8 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴–onto→𝐵)
24	1, 23	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴–onto→𝐵)
25		foelcdmi 6909	. . . . . . 7 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
26	24, 25	sylan 580	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
27	26	ex 413	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦))
28		nfv 1917	. . . . . 6 ⊢ Ⅎ𝑥𝜑
29		nfv 1917	. . . . . . 7 ⊢ Ⅎ𝑥𝜒
30		nfre1 3266	. . . . . . 7 ⊢ Ⅎ𝑥∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦
31	29, 30	nfim 1899	. . . . . 6 ⊢ Ⅎ𝑥(𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)
32		rspe 3230	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)
33	32	expcom 414	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑥) = 𝑦 → (𝑥 ∈ 𝐷 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
34	33	eqcoms 2739	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝐹‘𝑥) → (𝑥 ∈ 𝐷 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
35	34	adantl 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑥 ∈ 𝐷 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
36	15, 35	sylbird 259	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
37	36	ex 413	. . . . . . . . 9 ⊢ (𝜑 → (𝑦 = (𝐹‘𝑥) → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
38	37	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 = (𝐹‘𝑥) → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
39	14, 38	biimtrid 241	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝑦 → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
40	39	ex 413	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → ((𝐹‘𝑥) = 𝑦 → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))))
41	28, 31, 40	rexlimd 3247	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
42	27, 41	syld 47	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐵 → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
43	42	impd 411	. . 3 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ 𝜒) → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
44	22, 43	impbid 211	. 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦 ↔ (𝑦 ∈ 𝐵 ∧ 𝜒)))
45	1, 2, 44	f1oresf1o 45642	1 ⊢ (𝜑 → (𝐹 ↾ 𝐷):𝐷–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∃wrex 3069  {crab 3405   ⊆ wss 3913   ↾ cres 5640  ⟶wf 6497  –onto→wfo 6499  –1-1-onto→wf1o 6500  ‘cfv 6501

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-sep 5261  ax-nul 5268  ax-pr 5389

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3406  df-v 3448  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-br 5111  df-opab 5173  df-mpt 5194  df-id 5536  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 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509

This theorem is referenced by: (None)