Theorem relpeq1 45775

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

Assertion

Ref	Expression
relpeq1	⊢ (𝐻 = 𝐺 → (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ 𝐺 RelPres 𝑅, 𝑆(𝐴, 𝐵)))

Proof of Theorem relpeq1

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

Step	Hyp	Ref	Expression
1		feq1 6684	. . 3 ⊢ (𝐻 = 𝐺 → (𝐻:𝐴⟶𝐵 ↔ 𝐺:𝐴⟶𝐵))
2		fveq1 6881	. . . . . 6 ⊢ (𝐻 = 𝐺 → (𝐻‘𝑥) = (𝐺‘𝑥))
3		fveq1 6881	. . . . . 6 ⊢ (𝐻 = 𝐺 → (𝐻‘𝑦) = (𝐺‘𝑦))
4	2, 3	breq12d 5120	. . . . 5 ⊢ (𝐻 = 𝐺 → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐺‘𝑥)𝑆(𝐺‘𝑦)))
5	4	imbi2d 343	. . . 4 ⊢ (𝐻 = 𝐺 → ((𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ (𝑥𝑅𝑦 → (𝐺‘𝑥)𝑆(𝐺‘𝑦))))
6	5	2ralbidv 3228	. . 3 ⊢ (𝐻 = 𝐺 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐺‘𝑥)𝑆(𝐺‘𝑦))))
7	1, 6	anbi12d 644	. 2 ⊢ (𝐻 = 𝐺 → ((𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐺:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐺‘𝑥)𝑆(𝐺‘𝑦)))))
8		df-relp 45774	. 2 ⊢ (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ (𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
9		df-relp 45774	. 2 ⊢ (𝐺 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ (𝐺:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐺‘𝑥)𝑆(𝐺‘𝑦))))
10	7, 8, 9	3bitr4g 317	1 ⊢ (𝐻 = 𝐺 → (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ 𝐺 RelPres 𝑅, 𝑆(𝐴, 𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∀wral 3078   class class class wbr 5107  ⟶wf 6533  ‘cfv 6537   RelPres wrelp 45773

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

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-relp 45774

This theorem is used by: (None)