Theorem f1ocnvd 6292

Description: Describe an implicit one-to-one onto function. (Contributed by Mario Carneiro, 30-Apr-2015.)

Hypotheses

Ref	Expression
f1od.1	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
f1od.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑊)
f1od.3	⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝐷 ∈ 𝑋)
f1od.4	⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑥 = 𝐷)))

Assertion

Ref	Expression
f1ocnvd	⊢ (𝜑 → (𝐹:𝐴–1-1-onto→𝐵 ∧ ◡𝐹 = (𝑦 ∈ 𝐵 ↦ 𝐷)))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑦,𝐶   𝑥,𝐷   𝜑,𝑥,𝑦

Allowed substitution hints:   𝐶(𝑥)   𝐷(𝑦)   𝐹(𝑥, 𝑦)   𝑊(𝑥, 𝑦)   𝑋(𝑥, 𝑦)

Proof of Theorem f1ocnvd

Step	Hyp	Ref	Expression
1		f1od.2	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑊)
2	1	ralrimiva 2623	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝑊)
3		f1od.1	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
4	3	fnmpt 5510	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝑊 → 𝐹 Fn 𝐴)
5	2, 4	syl 14	. . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴)
6		f1od.3	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝐷 ∈ 𝑋)
7	6	ralrimiva 2623	. . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 𝐷 ∈ 𝑋)
8		eqid 2238	. . . . . 6 ⊢ (𝑦 ∈ 𝐵 ↦ 𝐷) = (𝑦 ∈ 𝐵 ↦ 𝐷)
9	8	fnmpt 5510	. . . . 5 ⊢ (∀𝑦 ∈ 𝐵 𝐷 ∈ 𝑋 → (𝑦 ∈ 𝐵 ↦ 𝐷) Fn 𝐵)
10	7, 9	syl 14	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ 𝐷) Fn 𝐵)
11		f1od.4	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑥 = 𝐷)))
12	11	opabbidv 4197	. . . . . 6 ⊢ (𝜑 → {⟨𝑦, 𝑥⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)} = {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝐵 ∧ 𝑥 = 𝐷)})
13		df-mpt 4194	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐶) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)}
14	3, 13	eqtri 2259	. . . . . . . 8 ⊢ 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)}
15	14	cnveqi 4955	. . . . . . 7 ⊢ ◡𝐹 = ◡{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)}
16		cnvopab 5189	. . . . . . 7 ⊢ ◡{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)} = {⟨𝑦, 𝑥⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)}
17	15, 16	eqtri 2259	. . . . . 6 ⊢ ◡𝐹 = {⟨𝑦, 𝑥⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)}
18		df-mpt 4194	. . . . . 6 ⊢ (𝑦 ∈ 𝐵 ↦ 𝐷) = {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝐵 ∧ 𝑥 = 𝐷)}
19	12, 17, 18	3eqtr4g 2296	. . . . 5 ⊢ (𝜑 → ◡𝐹 = (𝑦 ∈ 𝐵 ↦ 𝐷))
20	19	fneq1d 5471	. . . 4 ⊢ (𝜑 → (◡𝐹 Fn 𝐵 ↔ (𝑦 ∈ 𝐵 ↦ 𝐷) Fn 𝐵))
21	10, 20	mpbird 167	. . 3 ⊢ (𝜑 → ◡𝐹 Fn 𝐵)
22		dff1o4 5647	. . 3 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ◡𝐹 Fn 𝐵))
23	5, 21, 22	sylanbrc 421	. 2 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)
24	23, 19	jca 306	1 ⊢ (𝜑 → (𝐹:𝐴–1-1-onto→𝐵 ∧ ◡𝐹 = (𝑦 ∈ 𝐵 ↦ 𝐷)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528  {copab 4191   ↦ cmpt 4192  ^◡ccnv 4773   Fn wfn 5372  –1-1-onto→wf1o 5376

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384

This theorem is used by:  f1od  6293  f1ocnv2d  6294