Theorem f1oresf1o2 48305

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 6816	. . . . . . . . . . 11 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴⟶𝐵)
4	1, 3	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
5	4	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝐹:𝐴⟶𝐵)
6	2	sselda 3931	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝑥 ∈ 𝐴)
7	5, 6	jca 521	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴))
8	7	3adant3 1150	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → (𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴))
9		ffvelcdm 7073	. . . . . . 7 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵)
10	8, 9	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → (𝐹‘𝑥) ∈ 𝐵)
11		eleq1 2849	. . . . . . 7 ⊢ ((𝐹‘𝑥) = 𝑦 → ((𝐹‘𝑥) ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
12	11	3ad2ant3 1153	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → ((𝐹‘𝑥) ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
13	10, 12	mpbid 235	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → 𝑦 ∈ 𝐵)
14		eqcom 2768	. . . . . . . 8 ⊢ ((𝐹‘𝑥) = 𝑦 ↔ 𝑦 = (𝐹‘𝑥))
15		f1oresf1o2.3	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑥 ∈ 𝐷 ↔ 𝜒))
16	15	biimpd 232	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑥 ∈ 𝐷 → 𝜒))
17	16	ex 418	. . . . . . . 8 ⊢ (𝜑 → (𝑦 = (𝐹‘𝑥) → (𝑥 ∈ 𝐷 → 𝜒)))
18	14, 17	biimtrid 245	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝑥) = 𝑦 → (𝑥 ∈ 𝐷 → 𝜒)))
19	18	com23 87	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐷 → ((𝐹‘𝑥) = 𝑦 → 𝜒)))
20	19	3imp 1128	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → 𝜒)
21	13, 20	jca 521	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → (𝑦 ∈ 𝐵 ∧ 𝜒))
22	21	rexlimdv3a 3168	. . 3 ⊢ (𝜑 → (∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦 → (𝑦 ∈ 𝐵 ∧ 𝜒)))
23		f1ofo 6824	. . . . . . . 8 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴–onto→𝐵)
24	1, 23	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴–onto→𝐵)
25		foelcdmi 6938	. . . . . . 7 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
26	24, 25	sylan 592	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
27	26	ex 418	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦))
28		nfv 1947	. . . . . 6 ⊢ Ⅎ𝑥𝜑
29		nfv 1947	. . . . . . 7 ⊢ Ⅎ𝑥𝜒
30		nfre1 3288	. . . . . . 7 ⊢ Ⅎ𝑥∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦
31	29, 30	nfim 1929	. . . . . 6 ⊢ Ⅎ𝑥(𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)
32		rspe 3253	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝐷 ∧ (𝐹‘𝑥) = 𝑦) → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)
33	32	expcom 419	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑥) = 𝑦 → (𝑥 ∈ 𝐷 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
34	33	eqcoms 2769	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝐹‘𝑥) → (𝑥 ∈ 𝐷 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
35	34	adantl 487	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑥 ∈ 𝐷 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
36	15, 35	sylbird 263	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
37	36	ex 418	. . . . . . . . 9 ⊢ (𝜑 → (𝑦 = (𝐹‘𝑥) → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
38	37	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 = (𝐹‘𝑥) → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
39	14, 38	biimtrid 245	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝑦 → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
40	39	ex 418	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → ((𝐹‘𝑥) = 𝑦 → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))))
41	28, 31, 40	rexlimd 3270	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
42	27, 41	syld 48	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐵 → (𝜒 → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦)))
43	42	impd 416	. . 3 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ 𝜒) → ∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦))
44	22, 43	impbid 215	. 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝐷 (𝐹‘𝑥) = 𝑦 ↔ (𝑦 ∈ 𝐵 ∧ 𝜒)))
45	1, 2, 44	f1oresf1o 48304	1 ⊢ (𝜑 → (𝐹 ↾ 𝐷):𝐷–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  {crab 3413   ⊆ wss 3899   ↾ cres 5653  ⟶wf 6527  –onto→wfo 6529  –1-1-onto→wf1o 6530  ‘cfv 6531

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-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539

This theorem is used by: (None)