Theorem oprres 7566

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 1134	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦))
3		ovres 7564	. . . . . 6 ⊢ ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) → (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦) = (𝑥𝐺𝑦))
4	3	adantl 485	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦) = (𝑥𝐺𝑦))
5	2, 4	eqtr4d 2802	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))
6	5	ralrimivva 3207	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))
7		eqid 2764	. . 3 ⊢ (𝑌 × 𝑌) = (𝑌 × 𝑌)
8	6, 7	jctil 527	. 2 ⊢ (𝜑 → ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦)))
9		oprres.f	. . . 4 ⊢ (𝜑 → 𝐹:(𝑌 × 𝑌)⟶𝑅)
10	9	ffnd 6694	. . 3 ⊢ (𝜑 → 𝐹 Fn (𝑌 × 𝑌))
11		oprres.g	. . . . 5 ⊢ (𝜑 → 𝐺:(𝑋 × 𝑋)⟶𝑆)
12	11	ffnd 6694	. . . 4 ⊢ (𝜑 → 𝐺 Fn (𝑋 × 𝑋))
13		oprres.s	. . . . 5 ⊢ (𝜑 → 𝑌 ⊆ 𝑋)
14		xpss12 5664	. . . . 5 ⊢ ((𝑌 ⊆ 𝑋 ∧ 𝑌 ⊆ 𝑋) → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋))
15	13, 13, 14	syl2anc 593	. . . 4 ⊢ (𝜑 → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋))
16		fnssres 6646	. . . 4 ⊢ ((𝐺 Fn (𝑋 × 𝑋) ∧ (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋)) → (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌))
17	12, 15, 16	syl2anc 593	. . 3 ⊢ (𝜑 → (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌))
18		eqfnov 7527	. . 3 ⊢ ((𝐹 Fn (𝑌 × 𝑌) ∧ (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌)) → (𝐹 = (𝐺 ↾ (𝑌 × 𝑌)) ↔ ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))))
19	10, 17, 18	syl2anc 593	. 2 ⊢ (𝜑 → (𝐹 = (𝐺 ↾ (𝑌 × 𝑌)) ↔ ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))))
20	8, 19	mpbird 259	1 ⊢ (𝜑 → 𝐹 = (𝐺 ↾ (𝑌 × 𝑌)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   ∧ w3a 1099   = wceq 1562   ∈ wcel 2144  ∀wral 3078   ⊆ wss 3906   × cxp 5647   ↾ cres 5651   Fn wfn 6518  ⟶wf 6519  (class class class)co 7398

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-fv 6531  df-ov 7401

This theorem is referenced by:  subresre  43045