Theorem f1oresrab 5329

Description: Build a bijection between restricted abstract builders, given a bijection between the base classes, deduction version. (Contributed by Thierry Arnoux, 17-Aug-2018.)

Hypotheses

Ref	Expression
f1oresrab.1	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
f1oresrab.2	⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)
f1oresrab.3	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → (𝜒 ↔ 𝜓))

Assertion

Ref	Expression
f1oresrab	⊢ (𝜑 → (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑦,𝐶   𝜑,𝑥,𝑦   𝜓,𝑦   𝜒,𝑥

Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑦)   𝐶(𝑥)   𝐹(𝑥,𝑦)

Proof of Theorem f1oresrab

Step	Hyp	Ref	Expression
1		f1oresrab.2	. . . 4 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)
2		f1ofun 5128	. . . 4 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → Fun 𝐹)
3		funcnvcnv 4958	. . . 4 ⊢ (Fun 𝐹 → Fun ◡◡𝐹)
4	1, 2, 3	3syl 17	. . 3 ⊢ (𝜑 → Fun ◡◡𝐹)
5		f1ocnv 5139	. . . . . . 7 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴)
6	1, 5	syl 14	. . . . . 6 ⊢ (𝜑 → ◡𝐹:𝐵–1-1-onto→𝐴)
7		f1of1 5125	. . . . . 6 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡𝐹:𝐵–1-1→𝐴)
8	6, 7	syl 14	. . . . 5 ⊢ (𝜑 → ◡𝐹:𝐵–1-1→𝐴)
9		ssrab2 3025	. . . . 5 ⊢ {𝑦 ∈ 𝐵 ∣ 𝜒} ⊆ 𝐵
10		f1ores 5141	. . . . 5 ⊢ ((◡𝐹:𝐵–1-1→𝐴 ∧ {𝑦 ∈ 𝐵 ∣ 𝜒} ⊆ 𝐵) → (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→(◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}))
11	8, 9, 10	sylancl 392	. . . 4 ⊢ (𝜑 → (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→(◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}))
12		f1oresrab.1	. . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
13	12	mptpreima 4814	. . . . . 6 ⊢ (◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}) = {𝑥 ∈ 𝐴 ∣ 𝐶 ∈ {𝑦 ∈ 𝐵 ∣ 𝜒}}
14		f1oresrab.3	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → (𝜒 ↔ 𝜓))
15	14	3expia 1106	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 = 𝐶 → (𝜒 ↔ 𝜓)))
16	15	alrimiv 1754	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑦(𝑦 = 𝐶 → (𝜒 ↔ 𝜓)))
17		f1of 5126	. . . . . . . . . . 11 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴⟶𝐵)
18	1, 17	syl 14	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
19	12	fmpt 5319	. . . . . . . . . 10 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ↔ 𝐹:𝐴⟶𝐵)
20	18, 19	sylibr 137	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵)
21	20	r19.21bi 2407	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝐵)
22		elrab3t 2697	. . . . . . . 8 ⊢ ((∀𝑦(𝑦 = 𝐶 → (𝜒 ↔ 𝜓)) ∧ 𝐶 ∈ 𝐵) → (𝐶 ∈ {𝑦 ∈ 𝐵 ∣ 𝜒} ↔ 𝜓))
23	16, 21, 22	syl2anc 391	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 ∈ {𝑦 ∈ 𝐵 ∣ 𝜒} ↔ 𝜓))
24	23	rabbidva 2548	. . . . . 6 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝐶 ∈ {𝑦 ∈ 𝐵 ∣ 𝜒}} = {𝑥 ∈ 𝐴 ∣ 𝜓})
25	13, 24	syl5eq 2084	. . . . 5 ⊢ (𝜑 → (◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}) = {𝑥 ∈ 𝐴 ∣ 𝜓})
26		f1oeq3 5119	. . . . 5 ⊢ ((◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}) = {𝑥 ∈ 𝐴 ∣ 𝜓} → ((◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→(◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}) ↔ (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→{𝑥 ∈ 𝐴 ∣ 𝜓}))
27	25, 26	syl 14	. . . 4 ⊢ (𝜑 → ((◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→(◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}) ↔ (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→{𝑥 ∈ 𝐴 ∣ 𝜓}))
28	11, 27	mpbid 135	. . 3 ⊢ (𝜑 → (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→{𝑥 ∈ 𝐴 ∣ 𝜓})
29		f1orescnv 5142	. . 3 ⊢ ((Fun ◡◡𝐹 ∧ (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→{𝑥 ∈ 𝐴 ∣ 𝜓}) → (◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})
30	4, 28, 29	syl2anc 391	. 2 ⊢ (𝜑 → (◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})
31		rescnvcnv 4783	. . 3 ⊢ (◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}) = (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓})
32		f1oeq1 5117	. . 3 ⊢ ((◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}) = (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}) → ((◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒} ↔ (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒}))
33	31, 32	ax-mp 7	. 2 ⊢ ((◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒} ↔ (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})
34	30, 33	sylib 127	1 ⊢ (𝜑 → (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})

Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98   ∧ w3a 885  ∀wal 1241   = wceq 1243   ∈ wcel 1393  ∀wral 2306  {crab 2310   ⊆ wss 2917   ↦ cmpt 3818  ^◡ccnv 4344   ↾ cres 4347   “ cima 4348  Fun wfun 4896  ⟶wf 4898  –1-1→wf1 4899  –1-1-onto→wf1o 4901

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944

This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-rab 2315  df-v 2559  df-sbc 2765  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910

This theorem is referenced by: (None)