Theorem f1ompt 7044

Description: Express bijection for a mapping operation. (Contributed by Mario Carneiro, 30-May-2015.) (Revised by Mario Carneiro, 4-Dec-2016.)

Hypothesis

Ref	Expression
fmpt.1	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)

Assertion

Ref	Expression
f1ompt	⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑦 = 𝐶))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑦,𝐶   𝑦,𝐹

Allowed substitution hints:   𝐶(𝑥)   𝐹(𝑥)

Proof of Theorem f1ompt

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ffn 6651	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
2		dff1o4 6771	. . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ◡𝐹 Fn 𝐵))
3	2	baib 535	. . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝐹:𝐴–1-1-onto→𝐵 ↔ ◡𝐹 Fn 𝐵))
4	1, 3	syl 17	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹:𝐴–1-1-onto→𝐵 ↔ ◡𝐹 Fn 𝐵))
5		fnres 6608	. . . . . 6 ⊢ ((◡𝐹 ↾ 𝐵) Fn 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃!𝑧 𝑦◡𝐹𝑧)
6		nfcv 2894	. . . . . . . . . 10 ⊢ Ⅎ𝑥𝑧
7		fmpt.1	. . . . . . . . . . 11 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
8		nfmpt1 5190	. . . . . . . . . . 11 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐶)
9	7, 8	nfcxfr 2892	. . . . . . . . . 10 ⊢ Ⅎ𝑥𝐹
10		nfcv 2894	. . . . . . . . . 10 ⊢ Ⅎ𝑥𝑦
11	6, 9, 10	nfbr 5138	. . . . . . . . 9 ⊢ Ⅎ𝑥 𝑧𝐹𝑦
12		nfv 1915	. . . . . . . . 9 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)
13		breq1 5094	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (𝑧𝐹𝑦 ↔ 𝑥𝐹𝑦))
14		df-mpt 5173	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐶) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)}
15	7, 14	eqtri 2754	. . . . . . . . . . . 12 ⊢ 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)}
16	15	breqi 5097	. . . . . . . . . . 11 ⊢ (𝑥𝐹𝑦 ↔ 𝑥{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)}𝑦)
17		df-br 5092	. . . . . . . . . . . 12 ⊢ (𝑥{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)}𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)})
18		opabidw 5464	. . . . . . . . . . . 12 ⊢ (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)} ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶))
19	17, 18	bitri 275	. . . . . . . . . . 11 ⊢ (𝑥{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)}𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶))
20	16, 19	bitri 275	. . . . . . . . . 10 ⊢ (𝑥𝐹𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶))
21	13, 20	bitrdi 287	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (𝑧𝐹𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)))
22	11, 12, 21	cbveuw 2601	. . . . . . . 8 ⊢ (∃!𝑧 𝑧𝐹𝑦 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶))
23		vex 3440	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
24		vex 3440	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
25	23, 24	brcnv 5822	. . . . . . . . 9 ⊢ (𝑦◡𝐹𝑧 ↔ 𝑧𝐹𝑦)
26	25	eubii 2580	. . . . . . . 8 ⊢ (∃!𝑧 𝑦◡𝐹𝑧 ↔ ∃!𝑧 𝑧𝐹𝑦)
27		df-reu 3347	. . . . . . . 8 ⊢ (∃!𝑥 ∈ 𝐴 𝑦 = 𝐶 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶))
28	22, 26, 27	3bitr4i 303	. . . . . . 7 ⊢ (∃!𝑧 𝑦◡𝐹𝑧 ↔ ∃!𝑥 ∈ 𝐴 𝑦 = 𝐶)
29	28	ralbii 3078	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐵 ∃!𝑧 𝑦◡𝐹𝑧 ↔ ∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑦 = 𝐶)
30	5, 29	bitri 275	. . . . 5 ⊢ ((◡𝐹 ↾ 𝐵) Fn 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑦 = 𝐶)
31		relcnv 6053	. . . . . . 7 ⊢ Rel ◡𝐹
32		df-rn 5627	. . . . . . . 8 ⊢ ran 𝐹 = dom ◡𝐹
33		frn 6658	. . . . . . . 8 ⊢ (𝐹:𝐴⟶𝐵 → ran 𝐹 ⊆ 𝐵)
34	32, 33	eqsstrrid 3974	. . . . . . 7 ⊢ (𝐹:𝐴⟶𝐵 → dom ◡𝐹 ⊆ 𝐵)
35		relssres 5971	. . . . . . 7 ⊢ ((Rel ◡𝐹 ∧ dom ◡𝐹 ⊆ 𝐵) → (◡𝐹 ↾ 𝐵) = ◡𝐹)
36	31, 34, 35	sylancr 587	. . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → (◡𝐹 ↾ 𝐵) = ◡𝐹)
37	36	fneq1d 6574	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → ((◡𝐹 ↾ 𝐵) Fn 𝐵 ↔ ◡𝐹 Fn 𝐵))
38	30, 37	bitr3id 285	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → (∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑦 = 𝐶 ↔ ◡𝐹 Fn 𝐵))
39	4, 38	bitr4d 282	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹:𝐴–1-1-onto→𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑦 = 𝐶))
40	39	pm5.32i 574	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐹:𝐴–1-1-onto→𝐵) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑦 = 𝐶))
41		f1of 6763	. . 3 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → 𝐹:𝐴⟶𝐵)
42	41	pm4.71ri 560	. 2 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ 𝐹:𝐴–1-1-onto→𝐵))
43	7	fmpt 7043	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ↔ 𝐹:𝐴⟶𝐵)
44	43	anbi1i 624	. 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑦 = 𝐶) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑦 = 𝐶))
45	40, 42, 44	3bitr4i 303	1 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃!𝑥 ∈ 𝐴 𝑦 = 𝐶))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2111  ∃!weu 2563  ∀wral 3047  ∃!wreu 3344   ⊆ wss 3902  ⟨cop 4582   class class class wbr 5091  {copab 5153   ↦ cmpt 5172  ^◡ccnv 5615  dom cdm 5616  ran crn 5617   ↾ cres 5618  Rel wrel 5621   Fn wfn 6476  ⟶wf 6477  –1-1-onto→wf1o 6480

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-sn 4577  df-pr 4579  df-op 4583  df-br 5092  df-opab 5154  df-mpt 5173  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488

This theorem is referenced by:  oaf1o  8478  xpf1o  9052  icoshftf1o  13374  fprodser  15856  dfod2  19477  gsummptf1o  19876  nbusgrf1o0  29348  cusgrfilem2  29436  numclwlk2lem2f1o  30357  f1mptrn  32615  ccatws1f1o  32930  gsummptfsf1o  33032  xrmulc1cn  33941  poimirlem4  37670  poimirlem16  37682  poimirlem17  37683  poimirlem19  37685  poimirlem20  37686  isuspgrim0lem  47930  isuspgrim0  47931  isuspgrimlem  47932