Theorem relprel 45782

Description: A relation-preserving function preserves the relation. (Contributed by Eric Schmidt, 11-Oct-2025.)

Assertion

Ref	Expression
relprel	⊢ ((𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝐶𝑅𝐷 → (𝐻‘𝐶)𝑆(𝐻‘𝐷)))

Proof of Theorem relprel

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

Step	Hyp	Ref	Expression
1		df-relp 45774	. . 3 ⊢ (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ↔ (𝐻:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦))))
2	1	simprbi 503	. 2 ⊢ (𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)))
3		breq1 5110	. . . 4 ⊢ (𝑥 = 𝐶 → (𝑥𝑅𝑦 ↔ 𝐶𝑅𝑦))
4		fveq2 6882	. . . . 5 ⊢ (𝑥 = 𝐶 → (𝐻‘𝑥) = (𝐻‘𝐶))
5	4	breq1d 5117	. . . 4 ⊢ (𝑥 = 𝐶 → ((𝐻‘𝑥)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝐶)𝑆(𝐻‘𝑦)))
6	3, 5	imbi12d 347	. . 3 ⊢ (𝑥 = 𝐶 → ((𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) ↔ (𝐶𝑅𝑦 → (𝐻‘𝐶)𝑆(𝐻‘𝑦))))
7		breq2 5111	. . . 4 ⊢ (𝑦 = 𝐷 → (𝐶𝑅𝑦 ↔ 𝐶𝑅𝐷))
8		fveq2 6882	. . . . 5 ⊢ (𝑦 = 𝐷 → (𝐻‘𝑦) = (𝐻‘𝐷))
9	8	breq2d 5119	. . . 4 ⊢ (𝑦 = 𝐷 → ((𝐻‘𝐶)𝑆(𝐻‘𝑦) ↔ (𝐻‘𝐶)𝑆(𝐻‘𝐷)))
10	7, 9	imbi12d 347	. . 3 ⊢ (𝑦 = 𝐷 → ((𝐶𝑅𝑦 → (𝐻‘𝐶)𝑆(𝐻‘𝑦)) ↔ (𝐶𝑅𝐷 → (𝐻‘𝐶)𝑆(𝐻‘𝐷))))
11	6, 10	rspc2v 3590	. 2 ⊢ ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → (𝐻‘𝑥)𝑆(𝐻‘𝑦)) → (𝐶𝑅𝐷 → (𝐻‘𝐶)𝑆(𝐻‘𝐷))))
12	2, 11	mpan9 516	1 ⊢ ((𝐻 RelPres 𝑅, 𝑆(𝐴, 𝐵) ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝐶𝑅𝐷 → (𝐻‘𝐶)𝑆(𝐻‘𝐷)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀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-iota 6493  df-fv 6545  df-relp 45774

This theorem is used by:  relpmin  45783