Theorem oprres 7618

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

Step	Hyp	Ref	Expression
1		oprres.v	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦))
2	1	3expb 1120	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦))
3		ovres 7616	. . . . . 6 ⊢ ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) → (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦) = (𝑥𝐺𝑦))
4	3	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦) = (𝑥𝐺𝑦))
5	2, 4	eqtr4d 2783	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))
6	5	ralrimivva 3208	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))
7		eqid 2740	. . 3 ⊢ (𝑌 × 𝑌) = (𝑌 × 𝑌)
8	6, 7	jctil 519	. 2 ⊢ (𝜑 → ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦)))
9		oprres.f	. . . 4 ⊢ (𝜑 → 𝐹:(𝑌 × 𝑌)⟶𝑅)
10	9	ffnd 6748	. . 3 ⊢ (𝜑 → 𝐹 Fn (𝑌 × 𝑌))
11		oprres.g	. . . . 5 ⊢ (𝜑 → 𝐺:(𝑋 × 𝑋)⟶𝑆)
12	11	ffnd 6748	. . . 4 ⊢ (𝜑 → 𝐺 Fn (𝑋 × 𝑋))
13		oprres.s	. . . . 5 ⊢ (𝜑 → 𝑌 ⊆ 𝑋)
14		xpss12 5715	. . . . 5 ⊢ ((𝑌 ⊆ 𝑋 ∧ 𝑌 ⊆ 𝑋) → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋))
15	13, 13, 14	syl2anc 583	. . . 4 ⊢ (𝜑 → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋))
16		fnssres 6703	. . . 4 ⊢ ((𝐺 Fn (𝑋 × 𝑋) ∧ (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋)) → (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌))
17	12, 15, 16	syl2anc 583	. . 3 ⊢ (𝜑 → (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌))
18		eqfnov 7579	. . 3 ⊢ ((𝐹 Fn (𝑌 × 𝑌) ∧ (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌)) → (𝐹 = (𝐺 ↾ (𝑌 × 𝑌)) ↔ ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))))
19	10, 17, 18	syl2anc 583	. 2 ⊢ (𝜑 → (𝐹 = (𝐺 ↾ (𝑌 × 𝑌)) ↔ ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))))
20	8, 19	mpbird 257	1 ⊢ (𝜑 → 𝐹 = (𝐺 ↾ (𝑌 × 𝑌)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108  ∀wral 3067   ⊆ wss 3976   × cxp 5698   ↾ cres 5702   Fn wfn 6568  ⟶wf 6569  (class class class)co 7448

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fv 6581  df-ov 7451

This theorem is referenced by:  subresre  42406