Theorem fcnvres 6082

Description: The converse of a restriction of a function. (Contributed by NM, 26-Mar-1998.)

Assertion

Ref	Expression
fcnvres	⊢ (𝐹:𝐴⟶𝐵 → ◡(𝐹 ↾ 𝐴) = (◡𝐹 ↾ 𝐵))

Proof of Theorem fcnvres

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		relcnv 5503	. 2 ⊢ Rel ◡(𝐹 ↾ 𝐴)
2		relres 5426	. 2 ⊢ Rel (◡𝐹 ↾ 𝐵)
3		opelf 6065	. . . . . . 7 ⊢ ((𝐹:𝐴⟶𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
4	3	simpld 475	. . . . . 6 ⊢ ((𝐹:𝐴⟶𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → 𝑥 ∈ 𝐴)
5	4	ex 450	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑥 ∈ 𝐴))
6	5	pm4.71d 666	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ 𝐴)))
7		vex 3203	. . . . . 6 ⊢ 𝑦 ∈ V
8		vex 3203	. . . . . 6 ⊢ 𝑥 ∈ V
9	7, 8	opelcnv 5304	. . . . 5 ⊢ (⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ 𝐴))
10	7	opelres 5401	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ 𝐴) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ 𝐴))
11	9, 10	bitri 264	. . . 4 ⊢ (⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ 𝐴))
12	6, 11	syl6bbr 278	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴)))
13	3	simprd 479	. . . . . 6 ⊢ ((𝐹:𝐴⟶𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → 𝑦 ∈ 𝐵)
14	13	ex 450	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑦 ∈ 𝐵))
15	14	pm4.71d 666	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑦 ∈ 𝐵)))
16	8	opelres 5401	. . . . 5 ⊢ (⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵) ↔ (⟨𝑦, 𝑥⟩ ∈ ◡𝐹 ∧ 𝑦 ∈ 𝐵))
17	7, 8	opelcnv 5304	. . . . . 6 ⊢ (⟨𝑦, 𝑥⟩ ∈ ◡𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹)
18	17	anbi1i 731	. . . . 5 ⊢ ((⟨𝑦, 𝑥⟩ ∈ ◡𝐹 ∧ 𝑦 ∈ 𝐵) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑦 ∈ 𝐵))
19	16, 18	bitri 264	. . . 4 ⊢ (⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑦 ∈ 𝐵))
20	15, 19	syl6bbr 278	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵)))
21	12, 20	bitr3d 270	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ ⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵)))
22	1, 2, 21	eqrelrdv 5216	1 ⊢ (𝐹:𝐴⟶𝐵 → ◡(𝐹 ↾ 𝐴) = (◡𝐹 ↾ 𝐵))

Syntax hints:   → wi 4   ∧ wa 384   = wceq 1483   ∈ wcel 1990  ⟨cop 4183  ^◡ccnv 5113   ↾ cres 5116  ⟶wf 5884

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-xp 5120  df-rel 5121  df-cnv 5122  df-dm 5124  df-rn 5125  df-res 5126  df-fun 5890  df-fn 5891  df-f 5892

This theorem is referenced by: (None)