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

Theorem oprres 7588
Description: The restriction of an operation is an operation. (Contributed by NM, 1-Feb-2008.) (Revised by AV, 19-Oct-2021.)
Hypotheses
Ref Expression
oprres.v ((𝜑 ∧ 𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦))
oprres.s (𝜑 → 𝑌 ⊆ 𝑋)
oprres.f (𝜑 → 𝐹:(𝑌 × 𝑌)⟶𝑅)
oprres.g (𝜑 → 𝐺:(𝑋 × 𝑋)⟶𝑆)
Assertion
Ref Expression
oprres (𝜑 → 𝐹 = (𝐺 ↾ (𝑌 × 𝑌)))
Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦   𝑥,𝑌,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝑅(𝑥, 𝑦)   𝑆(𝑥, 𝑦)   𝑋(𝑥, 𝑦)

Proof of Theorem oprres
StepHypRef Expression
1 oprres.v . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦))
213expb 1138 . . . . 5 ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦))
3 ovres 7586 . . . . . 6 ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) → (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦) = (𝑥𝐺𝑦))
43adantl 487 . . . . 5 ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦) = (𝑥𝐺𝑦))
52, 4eqtr4d 2798 . . . 4 ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))
65ralrimivva 3205 . . 3 (𝜑 → ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))
7 eqid 2760 . . 3 (𝑌 × 𝑌) = (𝑌 × 𝑌)
86, 7jctil 529 . 2 (𝜑 → ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦)))
9 oprres.f . . . 4 (𝜑 → 𝐹:(𝑌 × 𝑌)⟶𝑅)
109ffnd 6710 . . 3 (𝜑 → 𝐹 Fn (𝑌 × 𝑌))
11 oprres.g . . . . 5 (𝜑 → 𝐺:(𝑋 × 𝑋)⟶𝑆)
1211ffnd 6710 . . . 4 (𝜑 → 𝐺 Fn (𝑋 × 𝑋))
13 oprres.s . . . . 5 (𝜑 → 𝑌 ⊆ 𝑋)
14 xpss12 5665 . . . . 5 ((𝑌 ⊆ 𝑋 ∧ 𝑌 ⊆ 𝑋) → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋))
1513, 13, 14syl2anc 596 . . . 4 (𝜑 → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋))
16 fnssres 6662 . . . 4 ((𝐺 Fn (𝑋 × 𝑋) ∧ (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋)) → (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌))
1712, 15, 16syl2anc 596 . . 3 (𝜑 → (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌))
18 eqfnov 7549 . . 3 ((𝐹 Fn (𝑌 × 𝑌) ∧ (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌)) → (𝐹 = (𝐺 ↾ (𝑌 × 𝑌)) ↔ ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))))
1910, 17, 18syl2anc 596 . 2 (𝜑 → (𝐹 = (𝐺 ↾ (𝑌 × 𝑌)) ↔ ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))))
208, 19mpbird 260 1 (𝜑 → 𝐹 = (𝐺 ↾ (𝑌 × 𝑌)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076   ⊆ wss 3895   × cxp 5648   ↾ cres 5652   Fn wfn 6533  ⟶wf 6534  (class class class)co 7420
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-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  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-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  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-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7423
This theorem is used by:  subresre  43483
  Copyright terms: Public domain W3C validator