Theorem relpeq3 45638

Description: Equality theorem for relation-preserving functions. (Contributed by Eric Schmidt, 11-Oct-2025.)

Assertion

Ref	Expression
relpeq3	⊢ (𝑆 = 𝑇 → (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ 𝐻 RelPres 𝑅, 𝑇(𝐴, 𝐵)))

Proof of Theorem relpeq3

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq 5112	. . . . 5 ⊢ (𝑆 = 𝑇 → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)𝑇(𝐻‘𝑦)))
2	1	imbi2d 343	. . . 4 ⊢ (𝑆 = 𝑇 → ((𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑇(𝐻‘𝑦))))
3	2	2ralbidv 3229	. . 3 ⊢ (𝑆 = 𝑇 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑇(𝐻‘𝑦))))
4	3	anbi2d 641	. 2 ⊢ (𝑆 = 𝑇 → ((𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑇(𝐻‘𝑦)))))
5		df-relp 45635	. 2 ⊢ (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ (𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
6		df-relp 45635	. 2 ⊢ (𝐻 RelPres 𝑅, 𝑇(𝐴, 𝐵) ↔ (𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑇(𝐻‘𝑦))))
7	4, 5, 6	3bitr4g 317	1 ⊢ (𝑆 = 𝑇 → (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ 𝐻 RelPres 𝑅, 𝑇(𝐴, 𝐵)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570  ∀wral 3079   class class class wbr 5110  ⟶wf 6534  ‘cfv 6538   RelPres wrelp 45634

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1810  df-cleq 2755  df-clel 2838  df-ral 3080  df-br 5111  df-relp 45635

This theorem is referenced by: (None)