ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  funssres GIF version

Theorem funssres 5418
Description: The restriction of a function to the domain of a subclass equals the subclass. (Contributed by NM, 15-Aug-1994.)
Assertion
Ref Expression
funssres ((Fun 𝐹𝐺𝐹) → (𝐹 ↾ dom 𝐺) = 𝐺)

Proof of Theorem funssres
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 2824 . . . . 5 𝑦 ∈ V
21opelres 5066 . . . 4 (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ dom 𝐺) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹𝑥 ∈ dom 𝐺))
3 ssel 3242 . . . . . . 7 (𝐺𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → ⟨𝑥, 𝑦⟩ ∈ 𝐹))
4 vex 2824 . . . . . . . . 9 𝑥 ∈ V
54, 1opeldm 4982 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ 𝐺𝑥 ∈ dom 𝐺)
65a1i 9 . . . . . . 7 (𝐺𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐺𝑥 ∈ dom 𝐺))
73, 6jcad 307 . . . . . 6 (𝐺𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹𝑥 ∈ dom 𝐺)))
87adantl 277 . . . . 5 ((Fun 𝐹𝐺𝐹) → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹𝑥 ∈ dom 𝐺)))
9 funeu2 5401 . . . . . . . . . . . 12 ((Fun 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → ∃!𝑦𝑥, 𝑦⟩ ∈ 𝐹)
104eldm2 4977 . . . . . . . . . . . . . 14 (𝑥 ∈ dom 𝐺 ↔ ∃𝑦𝑥, 𝑦⟩ ∈ 𝐺)
113ancrd 326 . . . . . . . . . . . . . . 15 (𝐺𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
1211eximdv 1933 . . . . . . . . . . . . . 14 (𝐺𝐹 → (∃𝑦𝑥, 𝑦⟩ ∈ 𝐺 → ∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
1310, 12biimtrid 152 . . . . . . . . . . . . 13 (𝐺𝐹 → (𝑥 ∈ dom 𝐺 → ∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
1413imp 124 . . . . . . . . . . . 12 ((𝐺𝐹𝑥 ∈ dom 𝐺) → ∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺))
15 eupick 2166 . . . . . . . . . . . 12 ((∃!𝑦𝑥, 𝑦⟩ ∈ 𝐹 ∧ ∃𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐺)) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ 𝐺))
169, 14, 15syl2an 289 . . . . . . . . . . 11 (((Fun 𝐹 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) ∧ (𝐺𝐹𝑥 ∈ dom 𝐺)) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ 𝐺))
1716exp43 372 . . . . . . . . . 10 (Fun 𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝐺𝐹 → (𝑥 ∈ dom 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ 𝐺)))))
1817com23 78 . . . . . . . . 9 (Fun 𝐹 → (𝐺𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ dom 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ 𝐺)))))
1918imp 124 . . . . . . . 8 ((Fun 𝐹𝐺𝐹) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ dom 𝐺 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → ⟨𝑥, 𝑦⟩ ∈ 𝐺))))
2019com34 83 . . . . . . 7 ((Fun 𝐹𝐺𝐹) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ dom 𝐺 → ⟨𝑥, 𝑦⟩ ∈ 𝐺))))
2120pm2.43d 50 . . . . . 6 ((Fun 𝐹𝐺𝐹) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ dom 𝐺 → ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
2221impd 254 . . . . 5 ((Fun 𝐹𝐺𝐹) → ((⟨𝑥, 𝑦⟩ ∈ 𝐹𝑥 ∈ dom 𝐺) → ⟨𝑥, 𝑦⟩ ∈ 𝐺))
238, 22impbid 129 . . . 4 ((Fun 𝐹𝐺𝐹) → (⟨𝑥, 𝑦⟩ ∈ 𝐺 ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹𝑥 ∈ dom 𝐺)))
242, 23bitr4id 199 . . 3 ((Fun 𝐹𝐺𝐹) → (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ dom 𝐺) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐺))
2524alrimivv 1928 . 2 ((Fun 𝐹𝐺𝐹) → ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ dom 𝐺) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐺))
26 relres 5089 . . 3 Rel (𝐹 ↾ dom 𝐺)
27 funrel 5392 . . . 4 (Fun 𝐹 → Rel 𝐹)
28 relss 4860 . . . 4 (𝐺𝐹 → (Rel 𝐹 → Rel 𝐺))
2927, 28mpan9 281 . . 3 ((Fun 𝐹𝐺𝐹) → Rel 𝐺)
30 eqrel 4862 . . 3 ((Rel (𝐹 ↾ dom 𝐺) ∧ Rel 𝐺) → ((𝐹 ↾ dom 𝐺) = 𝐺 ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ dom 𝐺) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
3126, 29, 30sylancr 418 . 2 ((Fun 𝐹𝐺𝐹) → ((𝐹 ↾ dom 𝐺) = 𝐺 ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ dom 𝐺) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐺)))
3225, 31mpbird 167 1 ((Fun 𝐹𝐺𝐹) → (𝐹 ↾ dom 𝐺) = 𝐺)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wal 1400   = wceq 1402  wex 1545  ∃!weu 2086  wcel 2209  wss 3220  cop 3711  dom cdm 4772  cres 4774  Rel wrel 4777  Fun wfun 5369
This theorem was proved from 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 4247  ax-pow 4309  ax-pr 4344
This theorem 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 3714  df-pr 3715  df-op 3717  df-br 4129  df-opab 4191  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-res 4784  df-fun 5377
This theorem is referenced by:  fun2ssres  5419  funcnvres  5452  f1ssf1  5669  funssfv  5719  oprssov  6225  issubgr2  16482  uhgrissubgr  16485
  Copyright terms: Public domain W3C validator