Theorem fcnvres 5995

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 5422	. 2 ⊢ Rel ◡(𝐹 ↾ 𝐴)
2		relres 5346	. 2 ⊢ Rel (◡𝐹 ↾ 𝐵)
3		opelf 5978	. . . . . . 7 ⊢ ((𝐹:𝐴⟶𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
4	3	simpld 474	. . . . . 6 ⊢ ((𝐹:𝐴⟶𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → 𝑥 ∈ 𝐴)
5	4	ex 449	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑥 ∈ 𝐴))
6	5	pm4.71d 664	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ 𝐴)))
7		vex 3176	. . . . . 6 ⊢ 𝑦 ∈ V
8		vex 3176	. . . . . 6 ⊢ 𝑥 ∈ V
9	7, 8	opelcnv 5226	. . . . 5 ⊢ (⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ 𝐴))
10	7	opelres 5322	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ 𝐴) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ 𝐴))
11	9, 10	bitri 263	. . . 4 ⊢ (⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑥 ∈ 𝐴))
12	6, 11	syl6bbr 277	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴)))
13	3	simprd 478	. . . . . 6 ⊢ ((𝐹:𝐴⟶𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → 𝑦 ∈ 𝐵)
14	13	ex 449	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑦 ∈ 𝐵))
15	14	pm4.71d 664	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑦 ∈ 𝐵)))
16	8	opelres 5322	. . . . 5 ⊢ (⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵) ↔ (⟨𝑦, 𝑥⟩ ∈ ◡𝐹 ∧ 𝑦 ∈ 𝐵))
17	7, 8	opelcnv 5226	. . . . . 6 ⊢ (⟨𝑦, 𝑥⟩ ∈ ◡𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹)
18	17	anbi1i 727	. . . . 5 ⊢ ((⟨𝑦, 𝑥⟩ ∈ ◡𝐹 ∧ 𝑦 ∈ 𝐵) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑦 ∈ 𝐵))
19	16, 18	bitri 263	. . . 4 ⊢ (⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ 𝑦 ∈ 𝐵))
20	15, 19	syl6bbr 277	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵)))
21	12, 20	bitr3d 269	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ ⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵)))
22	1, 2, 21	eqrelrdv 5139	1 ⊢ (𝐹:𝐴⟶𝐵 → ◡(𝐹 ↾ 𝐴) = (◡𝐹 ↾ 𝐵))

Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ⟨cop 4131  ^◡ccnv 5037   ↾ cres 5040  ⟶wf 5800

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-opab 4644  df-xp 5044  df-rel 5045  df-cnv 5046  df-dm 5048  df-rn 5049  df-res 5050  df-fun 5806  df-fn 5807  df-f 5808

This theorem is referenced by: (None)