MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fcnvres Structured version   Visualization version   GIF version

Theorem fcnvres 6781
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.
StepHypRef Expression
1 relcnv 6112 . 2 Rel ◡(𝐹 ↾ 𝐴)
2 relres 6007 . 2 Rel (◡𝐹 ↾ 𝐵)
3 opelf 6765 . . . . . . 7 ((𝐹:𝐴⟶𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
43simpld 500 . . . . . 6 ((𝐹:𝐴⟶𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → 𝑥 ∈ 𝐴)
54ex 418 . . . . 5 (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑥 ∈ 𝐴))
65pm4.71rd 572 . . . 4 (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ (𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹)))
7 vex 3458 . . . . . 6 𝑦 ∈ V
8 vex 3458 . . . . . 6 𝑥 ∈ V
97, 8opelcnv 5866 . . . . 5 (⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ 𝐴))
107opelresi 5989 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ 𝐴) ↔ (𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
119, 10bitri 278 . . . 4 (⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ (𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
126, 11bitr4di 292 . . 3 (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴)))
133simprd 501 . . . . . 6 ((𝐹:𝐴⟶𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → 𝑦 ∈ 𝐵)
1413ex 418 . . . . 5 (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑦 ∈ 𝐵))
1514pm4.71rd 572 . . . 4 (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ (𝑦 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹)))
168opelresi 5989 . . . . 5 (⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵) ↔ (𝑦 ∈ 𝐵 ∧ ⟨𝑦, 𝑥⟩ ∈ ◡𝐹))
177, 8opelcnv 5866 . . . . . 6 (⟨𝑦, 𝑥⟩ ∈ ◡𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹)
1817anbi2i 635 . . . . 5 ((𝑦 ∈ 𝐵 ∧ ⟨𝑦, 𝑥⟩ ∈ ◡𝐹) ↔ (𝑦 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
1916, 18bitri 278 . . . 4 (⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵) ↔ (𝑦 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
2015, 19bitr4di 292 . . 3 (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵)))
2112, 20bitr3d 284 . 2 (𝐹:𝐴⟶𝐵 → (⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ ⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵)))
221, 2, 21eqrelrdv 5773 1 (𝐹:𝐴⟶𝐵 → ◡(𝐹 ↾ 𝐴) = (◡𝐹 ↾ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ⟨cop 4838  ◡ccnv 5654   ↾ cres 5657  ⟶wf 6554
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-xp 5661  df-rel 5662  df-cnv 5663  df-dm 5665  df-rn 5666  df-res 5667  df-fun 6560  df-fn 6561  df-f 6562
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator