Theorem relpeq1 45395

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 6640	. . 3 ⊢ (𝐻 = 𝐺 → (𝐻:𝐴⟶𝐵 ↔ 𝐺:𝐴⟶𝐵))
2		fveq1 6833	. . . . . 6 ⊢ (𝐻 = 𝐺 → (𝐻‘𝑥) = (𝐺‘𝑥))
3		fveq1 6833	. . . . . 6 ⊢ (𝐻 = 𝐺 → (𝐻‘𝑦) = (𝐺‘𝑦))
4	2, 3	breq12d 5092	. . . . 5 ⊢ (𝐻 = 𝐺 → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐺‘𝑥)𝑆(𝐺‘𝑦)))
5	4	imbi2d 341	. . . 4 ⊢ (𝐻 = 𝐺 → ((𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ (𝑥𝑅𝑦 → (𝐺‘𝑥)𝑆(𝐺‘𝑦))))
6	5	2ralbidv 3204	. . 3 ⊢ (𝐻 = 𝐺 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐺‘𝑥)𝑆(𝐺‘𝑦))))
7	1, 6	anbi12d 638	. 2 ⊢ (𝐻 = 𝐺 → ((𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))) ↔ (𝐺:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐺‘𝑥)𝑆(𝐺‘𝑦)))))
8		df-relp 45394	. 2 ⊢ (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ (𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
9		df-relp 45394	. 2 ⊢ (𝐺 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ (𝐺:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐺‘𝑥)𝑆(𝐺‘𝑦))))
10	7, 8, 9	3bitr4g 315	1 ⊢ (𝐻 = 𝐺 → (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ 𝐺 RelPres 𝑅, 𝑆(𝐴, 𝐵)))

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547  ∀wral 3054   class class class wbr 5079  ⟶wf 6488  ‘cfv 6492   RelPres wrelp 45393

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ral 3055  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-relp 45394

This theorem is referenced by: (None)