Theorem relpeq4 45889

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

Assertion

Ref	Expression
relpeq4	⊢ (𝐴 = 𝐶 → (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ 𝐻 RelPres 𝑅, 𝑆(𝐶, 𝐵)))

Proof of Theorem relpeq4

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

Step	Hyp	Ref	Expression
1		feq2 6680	. . 3 ⊢ (𝐴 = 𝐶 → (𝐻:𝐴⟶𝐵 ↔ 𝐻:𝐶⟶𝐵))
2		raleq 3317	. . . 4 ⊢ (𝐴 = 𝐶 → (∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑦 ∈ 𝐶 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
3	2	raleqbi1dv 3330	. . 3 ⊢ (𝐴 = 𝐶 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐶 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
4	1, 3	anbi12d 644	. 2 ⊢ (𝐴 = 𝐶 → ((𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐻:𝐶⟶𝐵 ∧ ∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐶 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)))))
5		df-relp 45885	. 2 ⊢ (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ (𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
6		df-relp 45885	. 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 3077   class class class wbr 5103  ⟶wf 6527  ‘cfv 6531   RelPres wrelp 45884

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-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2753  df-ral 3078  df-rex 3088  df-fn 6534  df-f 6535  df-relp 45885

This theorem is used by: (None)