Theorem f1oresrab 7147

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 6851	. . . 4 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → Fun 𝐹)
3		funcnvcnv 6635	. . . 4 ⊢ (Fun 𝐹 → Fun ◡◡𝐹)
4	1, 2, 3	3syl 18	. . 3 ⊢ (𝜑 → Fun ◡◡𝐹)
5		f1ocnv 6861	. . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴)
6		f1of1 6848	. . . . . 6 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡𝐹:𝐵–1-1→𝐴)
7	1, 5, 6	3syl 18	. . . . 5 ⊢ (𝜑 → ◡𝐹:𝐵–1-1→𝐴)
8		ssrab2 4090	. . . . 5 ⊢ {𝑦 ∈ 𝐵 ∣ 𝜒} ⊆ 𝐵
9		f1ores 6863	. . . . 5 ⊢ ((◡𝐹:𝐵–1-1→𝐴 ∧ {𝑦 ∈ 𝐵 ∣ 𝜒} ⊆ 𝐵) → (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→(◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}))
10	7, 8, 9	sylancl 586	. . . 4 ⊢ (𝜑 → (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→(◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}))
11		f1oresrab.1	. . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
12	11	mptpreima 6260	. . . . . 6 ⊢ (◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}) = {𝑥 ∈ 𝐴 ∣ 𝐶 ∈ {𝑦 ∈ 𝐵 ∣ 𝜒}}
13		f1oresrab.3	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → (𝜒 ↔ 𝜓))
14	13	3expia 1120	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 = 𝐶 → (𝜒 ↔ 𝜓)))
15	14	alrimiv 1925	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑦(𝑦 = 𝐶 → (𝜒 ↔ 𝜓)))
16		f1of 6849	. . . . . . . . . . 11 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴⟶𝐵)
17	1, 16	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
18	11	fmpt 7130	. . . . . . . . . 10 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ↔ 𝐹:𝐴⟶𝐵)
19	17, 18	sylibr 234	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵)
20	19	r19.21bi 3249	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝐵)
21		elrab3t 3694	. . . . . . . 8 ⊢ ((∀𝑦(𝑦 = 𝐶 → (𝜒 ↔ 𝜓)) ∧ 𝐶 ∈ 𝐵) → (𝐶 ∈ {𝑦 ∈ 𝐵 ∣ 𝜒} ↔ 𝜓))
22	15, 20, 21	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐶 ∈ {𝑦 ∈ 𝐵 ∣ 𝜒} ↔ 𝜓))
23	22	rabbidva 3440	. . . . . 6 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝐶 ∈ {𝑦 ∈ 𝐵 ∣ 𝜒}} = {𝑥 ∈ 𝐴 ∣ 𝜓})
24	12, 23	eqtrid 2787	. . . . 5 ⊢ (𝜑 → (◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}) = {𝑥 ∈ 𝐴 ∣ 𝜓})
25	24	f1oeq3d 6846	. . . 4 ⊢ (𝜑 → ((◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→(◡𝐹 “ {𝑦 ∈ 𝐵 ∣ 𝜒}) ↔ (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→{𝑥 ∈ 𝐴 ∣ 𝜓}))
26	10, 25	mpbid 232	. . 3 ⊢ (𝜑 → (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→{𝑥 ∈ 𝐴 ∣ 𝜓})
27		f1orescnv 6864	. . 3 ⊢ ((Fun ◡◡𝐹 ∧ (◡𝐹 ↾ {𝑦 ∈ 𝐵 ∣ 𝜒}):{𝑦 ∈ 𝐵 ∣ 𝜒}–1-1-onto→{𝑥 ∈ 𝐴 ∣ 𝜓}) → (◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})
28	4, 26, 27	syl2anc 584	. 2 ⊢ (𝜑 → (◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})
29		rescnvcnv 6226	. . 3 ⊢ (◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}) = (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓})
30		f1oeq1 6837	. . 3 ⊢ ((◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}) = (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}) → ((◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒} ↔ (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒}))
31	29, 30	ax-mp 5	. 2 ⊢ ((◡◡𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒} ↔ (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})
32	28, 31	sylib 218	1 ⊢ (𝜑 → (𝐹 ↾ {𝑥 ∈ 𝐴 ∣ 𝜓}):{𝑥 ∈ 𝐴 ∣ 𝜓}–1-1-onto→{𝑦 ∈ 𝐵 ∣ 𝜒})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086  ∀wal 1535   = wceq 1537   ∈ wcel 2106  ∀wral 3059  {crab 3433   ⊆ wss 3963   ↦ cmpt 5231  ^◡ccnv 5688   ↾ cres 5691   “ cima 5692  Fun wfun 6557  ⟶wf 6559  –1-1→wf1 6560  –1-1-onto→wf1o 6562

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570

This theorem is referenced by:  f1ossf1o  7148  wlknwwlksnbij  29918  wlksnwwlknvbij  29938  clwlknf1oclwwlkn  30113  clwwlkvbij  30142  rabfodom  32533  fpwrelmapffs  32752  eulerpartlemn  34363  f1oresf1orab  47239