Theorem ofrfvalg 7683

Description: Value of a relation applied to two functions. Originally part of ofrfval 7685, this version assumes the functions are sets rather than their domains, avoiding ax-rep 5242. (Contributed by SN, 5-Aug-2024.)

Hypotheses

Ref	Expression
ofrfvalg.1	⊢ (𝜑 → 𝐹 Fn 𝐴)
ofrfvalg.2	⊢ (𝜑 → 𝐺 Fn 𝐵)
ofrfvalg.3	⊢ (𝜑 → 𝐹 ∈ 𝑉)
ofrfvalg.4	⊢ (𝜑 → 𝐺 ∈ 𝑊)
ofrfvalg.5	⊢ (𝐴 ∩ 𝐵) = 𝑆
ofrfvalg.6	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐶)
ofrfvalg.7	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = 𝐷)

Assertion

Ref	Expression
ofrfvalg	⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑥 ∈ 𝑆 𝐶𝑅𝐷))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐺   𝜑,𝑥   𝑥,𝑆   𝑥,𝑅

Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)   𝐷(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem ofrfvalg

Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ofrfvalg.3	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
2		ofrfvalg.4	. . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑊)
3		dmeq 5894	. . . . . 6 ⊢ (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
4		dmeq 5894	. . . . . 6 ⊢ (𝑔 = 𝐺 → dom 𝑔 = dom 𝐺)
5	3, 4	ineqan12d 4183	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (dom 𝑓 ∩ dom 𝑔) = (dom 𝐹 ∩ dom 𝐺))
6		fveq1 6881	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
7		fveq1 6881	. . . . . 6 ⊢ (𝑔 = 𝐺 → (𝑔‘𝑥) = (𝐺‘𝑥))
8	6, 7	breqan12d 5129	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → ((𝑓‘𝑥)𝑅(𝑔‘𝑥) ↔ (𝐹‘𝑥)𝑅(𝐺‘𝑥)))
9	5, 8	raleqbidv 3345	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (∀𝑥 ∈ (dom 𝑓 ∩ dom 𝑔)(𝑓‘𝑥)𝑅(𝑔‘𝑥) ↔ ∀𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)(𝐹‘𝑥)𝑅(𝐺‘𝑥)))
10		df-ofr 7676	. . . 4 ⊢ ∘r 𝑅 = {⟨𝑓, 𝑔⟩ ∣ ∀𝑥 ∈ (dom 𝑓 ∩ dom 𝑔)(𝑓‘𝑥)𝑅(𝑔‘𝑥)}
11	9, 10	brabga 5519	. . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)(𝐹‘𝑥)𝑅(𝐺‘𝑥)))
12	1, 2, 11	syl2anc 595	. 2 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)(𝐹‘𝑥)𝑅(𝐺‘𝑥)))
13		ofrfvalg.1	. . . . . 6 ⊢ (𝜑 → 𝐹 Fn 𝐴)
14	13	fndmd 6641	. . . . 5 ⊢ (𝜑 → dom 𝐹 = 𝐴)
15		ofrfvalg.2	. . . . . 6 ⊢ (𝜑 → 𝐺 Fn 𝐵)
16	15	fndmd 6641	. . . . 5 ⊢ (𝜑 → dom 𝐺 = 𝐵)
17	14, 16	ineq12d 4182	. . . 4 ⊢ (𝜑 → (dom 𝐹 ∩ dom 𝐺) = (𝐴 ∩ 𝐵))
18		ofrfvalg.5	. . . 4 ⊢ (𝐴 ∩ 𝐵) = 𝑆
19	17, 18	eqtrdi 2820	. . 3 ⊢ (𝜑 → (dom 𝐹 ∩ dom 𝐺) = 𝑆)
20	19	raleqdv 3329	. 2 ⊢ (𝜑 → (∀𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)(𝐹‘𝑥)𝑅(𝐺‘𝑥) ↔ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥)))
21		inss1 4197	. . . . . . 7 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴
22	18, 21	eqsstrri 3992	. . . . . 6 ⊢ 𝑆 ⊆ 𝐴
23	22	sseli 3941	. . . . 5 ⊢ (𝑥 ∈ 𝑆 → 𝑥 ∈ 𝐴)
24		ofrfvalg.6	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐶)
25	23, 24	sylan2 604	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝐹‘𝑥) = 𝐶)
26		inss2 4198	. . . . . . 7 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵
27	18, 26	eqsstrri 3992	. . . . . 6 ⊢ 𝑆 ⊆ 𝐵
28	27	sseli 3941	. . . . 5 ⊢ (𝑥 ∈ 𝑆 → 𝑥 ∈ 𝐵)
29		ofrfvalg.7	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = 𝐷)
30	28, 29	sylan2 604	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝐺‘𝑥) = 𝐷)
31	25, 30	breq12d 5126	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → ((𝐹‘𝑥)𝑅(𝐺‘𝑥) ↔ 𝐶𝑅𝐷))
32	31	ralbidva 3192	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥) ↔ ∀𝑥 ∈ 𝑆 𝐶𝑅𝐷))
33	12, 20, 32	3bitrd 308	1 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑥 ∈ 𝑆 𝐶𝑅𝐷))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1567   ∈ wcel 2149  ∀wral 3085   ∩ cin 3912   class class class wbr 5113  dom cdm 5662   Fn wfn 6532  ‘cfv 6537   ∘_r cofr 7674

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-dm 5672  df-iota 6493  df-fn 6540  df-fv 6545  df-ofr 7676

This theorem is referenced by:  ofrfval  7685  pwsle  17545  pwsleval  17546  psrbaglesupp  22040  psrbaglefi  22044  0mplrim  33848