Theorem relpeq3 45696

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 5116	. . . . 5 ⊢ (𝑆 = 𝑇 → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝑥)𝑇(𝐻‘𝑦)))
2	1	imbi2d 343	. . . 4 ⊢ (𝑆 = 𝑇 → ((𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑇(𝐻‘𝑦))))
3	2	2ralbidv 3232	. . 3 ⊢ (𝑆 = 𝑇 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑇(𝐻‘𝑦))))
4	3	anbi2d 642	. 2 ⊢ (𝑆 = 𝑇 → ((𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑇(𝐻‘𝑦)))))
5		df-relp 45693	. 2 ⊢ (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ (𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
6		df-relp 45693	. 2 ⊢ (𝐻 RelPres 𝑅, 𝑇(𝐴, 𝐵) ↔ (𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑇(𝐻‘𝑦))))
7	4, 5, 6	3bitr4g 317	1 ⊢ (𝑆 = 𝑇 → (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ 𝐻 RelPres 𝑅, 𝑇(𝐴, 𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∀wral 3082   class class class wbr 5114  ⟶wf 6539  ‘cfv 6543   RelPres wrelp 45692

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2758  df-clel 2841  df-ral 3083  df-br 5115  df-relp 45693

This theorem is used by: (None)