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

Theorem fcnvres 6759
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 6099 . 2 Rel ◡(𝐹 ↾ 𝐴)
2 relres 5995 . 2 Rel (◡𝐹 ↾ 𝐵)
3 opelf 6743 . . . . . . 7 ((𝐹:𝐴⟶𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
43simpld 500 . . . . . 6 ((𝐹:𝐴⟶𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → 𝑥 ∈ 𝐴)
54ex 418 . . . . 5 (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑥 ∈ 𝐴))
65pm4.71rd 572 . . . 4 (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ (𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹)))
7 vex 3454 . . . . . 6 𝑦 ∈ V
8 vex 3454 . . . . . 6 𝑥 ∈ V
97, 8opelcnv 5858 . . . . 5 (⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ 𝐴))
107opelresi 5977 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ 𝐴) ↔ (𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
119, 10bitri 278 . . . 4 (⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ (𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
126, 11bitr4di 292 . . 3 (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴)))
133simprd 501 . . . . . 6 ((𝐹:𝐴⟶𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → 𝑦 ∈ 𝐵)
1413ex 418 . . . . 5 (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → 𝑦 ∈ 𝐵))
1514pm4.71rd 572 . . . 4 (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ (𝑦 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹)))
168opelresi 5977 . . . . 5 (⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵) ↔ (𝑦 ∈ 𝐵 ∧ ⟨𝑦, 𝑥⟩ ∈ ◡𝐹))
177, 8opelcnv 5858 . . . . . 6 (⟨𝑦, 𝑥⟩ ∈ ◡𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹)
1817anbi2i 635 . . . . 5 ((𝑦 ∈ 𝐵 ∧ ⟨𝑦, 𝑥⟩ ∈ ◡𝐹) ↔ (𝑦 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
1916, 18bitri 278 . . . 4 (⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵) ↔ (𝑦 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
2015, 19bitr4di 292 . . 3 (𝐹:𝐴⟶𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵)))
2112, 20bitr3d 284 . 2 (𝐹:𝐴⟶𝐵 → (⟨𝑦, 𝑥⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ ⟨𝑦, 𝑥⟩ ∈ (◡𝐹 ↾ 𝐵)))
221, 2, 21eqrelrdv 5767 1 (𝐹:𝐴⟶𝐵 → ◡(𝐹 ↾ 𝐴) = (◡𝐹 ↾ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ⟨cop 4589  ◡ccnv 5649   ↾ cres 5652  ⟶wf 6534
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-cnv 5658  df-dm 5660  df-rn 5661  df-res 5662  df-fun 6540  df-fn 6541  df-f 6542
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator