Theorem relpeq2 44955

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

Assertion

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

Proof of Theorem relpeq2

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

Step	Hyp	Ref	Expression
1		breq 5153	. . . . 5 ⊢ (𝑅 = 𝑇 → (𝑥𝑅𝑦 ↔ 𝑥𝑇𝑦))
2	1	imbi1d 341	. . . 4 ⊢ (𝑅 = 𝑇 → ((𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ (𝑥𝑇𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
3	2	2ralbidv 3221	. . 3 ⊢ (𝑅 = 𝑇 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑇𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
4	3	anbi2d 630	. 2 ⊢ (𝑅 = 𝑇 → ((𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑇𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)))))
5		df-relp 44953	. 2 ⊢ (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ (𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
6		df-relp 44953	. 2 ⊢ (𝐻 RelPres 𝑇, 𝑆(𝐴, 𝐵) ↔ (𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑇𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
7	4, 5, 6	3bitr4g 314	1 ⊢ (𝑅 = 𝑇 → (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ 𝐻 RelPres 𝑇, 𝑆(𝐴, 𝐵)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1539  ∀wral 3061   class class class wbr 5151  ⟶wf 6565  ‘cfv 6569   RelPres wrelp 44952

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1779  df-cleq 2729  df-clel 2816  df-ral 3062  df-br 5152  df-relp 44953

This theorem is referenced by: (None)