![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > oprres | Structured version Visualization version GIF version |
Description: The restriction of an operation is an operation. (Contributed by NM, 1-Feb-2008.) (Revised by AV, 19-Oct-2021.) |
Ref | Expression |
---|---|
oprres.v | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦)) |
oprres.s | ⊢ (𝜑 → 𝑌 ⊆ 𝑋) |
oprres.f | ⊢ (𝜑 → 𝐹:(𝑌 × 𝑌)⟶𝑅) |
oprres.g | ⊢ (𝜑 → 𝐺:(𝑋 × 𝑋)⟶𝑆) |
Ref | Expression |
---|---|
oprres | ⊢ (𝜑 → 𝐹 = (𝐺 ↾ (𝑌 × 𝑌))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oprres.v | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦)) | |
2 | 1 | 3expb 1258 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦)) |
3 | ovres 6698 | . . . . . 6 ⊢ ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) → (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦) = (𝑥𝐺𝑦)) | |
4 | 3 | adantl 481 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦) = (𝑥𝐺𝑦)) |
5 | 2, 4 | eqtr4d 2647 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦)) |
6 | 5 | ralrimivva 2954 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦)) |
7 | eqid 2610 | . . 3 ⊢ (𝑌 × 𝑌) = (𝑌 × 𝑌) | |
8 | 6, 7 | jctil 558 | . 2 ⊢ (𝜑 → ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))) |
9 | oprres.f | . . . 4 ⊢ (𝜑 → 𝐹:(𝑌 × 𝑌)⟶𝑅) | |
10 | 9 | ffnd 5959 | . . 3 ⊢ (𝜑 → 𝐹 Fn (𝑌 × 𝑌)) |
11 | oprres.g | . . . . 5 ⊢ (𝜑 → 𝐺:(𝑋 × 𝑋)⟶𝑆) | |
12 | 11 | ffnd 5959 | . . . 4 ⊢ (𝜑 → 𝐺 Fn (𝑋 × 𝑋)) |
13 | oprres.s | . . . . 5 ⊢ (𝜑 → 𝑌 ⊆ 𝑋) | |
14 | xpss12 5148 | . . . . 5 ⊢ ((𝑌 ⊆ 𝑋 ∧ 𝑌 ⊆ 𝑋) → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋)) | |
15 | 13, 13, 14 | syl2anc 691 | . . . 4 ⊢ (𝜑 → (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋)) |
16 | fnssres 5918 | . . . 4 ⊢ ((𝐺 Fn (𝑋 × 𝑋) ∧ (𝑌 × 𝑌) ⊆ (𝑋 × 𝑋)) → (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌)) | |
17 | 12, 15, 16 | syl2anc 691 | . . 3 ⊢ (𝜑 → (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌)) |
18 | eqfnov 6664 | . . 3 ⊢ ((𝐹 Fn (𝑌 × 𝑌) ∧ (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌)) → (𝐹 = (𝐺 ↾ (𝑌 × 𝑌)) ↔ ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦)))) | |
19 | 10, 17, 18 | syl2anc 691 | . 2 ⊢ (𝜑 → (𝐹 = (𝐺 ↾ (𝑌 × 𝑌)) ↔ ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦)))) |
20 | 8, 19 | mpbird 246 | 1 ⊢ (𝜑 → 𝐹 = (𝐺 ↾ (𝑌 × 𝑌))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ∀wral 2896 ⊆ wss 3540 × cxp 5036 ↾ cres 5040 Fn wfn 5799 ⟶wf 5800 (class class class)co 6549 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-fv 5812 df-ov 6552 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |