Theorem oprres 7601

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 1119	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦))
3		ovres 7599	. . . . . 6 ⊢ ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) → (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦) = (𝑥𝐺𝑦))
4	3	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦) = (𝑥𝐺𝑦))
5	2, 4	eqtr4d 2778	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))
6	5	ralrimivva 3200	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))
7		eqid 2735	. . 3 ⊢ (𝑌 × 𝑌) = (𝑌 × 𝑌)
8	6, 7	jctil 519	. 2 ⊢ (𝜑 → ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦)))
9		oprres.f	. . . 4 ⊢ (𝜑 → 𝐹:(𝑌 × 𝑌)⟶𝑅)
10	9	ffnd 6738	. . 3 ⊢ (𝜑 → 𝐹 Fn (𝑌 × 𝑌))
11		oprres.g	. . . . 5 ⊢ (𝜑 → 𝐺:(𝑋 × 𝑋)⟶𝑆)
12	11	ffnd 6738	. . . 4 ⊢ (𝜑 → 𝐺 Fn (𝑋 × 𝑋))
13		oprres.s	. . . . 5 ⊢ (𝜑 → 𝑌 ⊆ 𝑋)
14		xpss12 5704	. . . . 5 ⊢ ((𝑌 ⊆ 𝑋 ∧ 𝑌 ⊆ 𝑋) → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋))
15	13, 13, 14	syl2anc 584	. . . 4 ⊢ (𝜑 → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋))
16		fnssres 6692	. . . 4 ⊢ ((𝐺 Fn (𝑋 × 𝑋) ∧ (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋)) → (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌))
17	12, 15, 16	syl2anc 584	. . 3 ⊢ (𝜑 → (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌))
18		eqfnov 7562	. . 3 ⊢ ((𝐹 Fn (𝑌 × 𝑌) ∧ (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌)) → (𝐹 = (𝐺 ↾ (𝑌 × 𝑌)) ↔ ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))))
19	10, 17, 18	syl2anc 584	. 2 ⊢ (𝜑 → (𝐹 = (𝐺 ↾ (𝑌 × 𝑌)) ↔ ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))))
20	8, 19	mpbird 257	1 ⊢ (𝜑 → 𝐹 = (𝐺 ↾ (𝑌 × 𝑌)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1537   ∈ wcel 2106  ∀wral 3059   ⊆ wss 3963   × cxp 5687   ↾ cres 5691   Fn wfn 6558  ⟶wf 6559  (class class class)co 7431

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-fv 6571  df-ov 7434

This theorem is referenced by:  subresre  42437