Theorem refrelredund4 37494

Description: The naive version of the definition of reflexive relation is redundant with respect to reflexive relation (see dfrefrel2 37374) if the relation is symmetric as well. (Contributed by Peter Mazsa, 26-Oct-2022.)

Assertion

Ref	Expression
refrelredund4	⊢ redund ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅), RefRel 𝑅, ( RefRel 𝑅 ∧ SymRel 𝑅))

Proof of Theorem refrelredund4

Step	Hyp	Ref	Expression
1		inxpssres 5693	. . . . 5 ⊢ ( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ ( I ↾ dom 𝑅)
2		sstr2 3989	. . . . 5 ⊢ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ ( I ↾ dom 𝑅) → (( I ↾ dom 𝑅) ⊆ 𝑅 → ( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅))
3	1, 2	ax-mp 5	. . . 4 ⊢ (( I ↾ dom 𝑅) ⊆ 𝑅 → ( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅)
4	3	anim1i 616	. . 3 ⊢ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅) → (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅))
5		dfrefrel2 37374	. . 3 ⊢ ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅))
6	4, 5	sylibr 233	. 2 ⊢ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅) → RefRel 𝑅)
7		an12 644	. . 3 ⊢ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅) ∧ ( RefRel 𝑅 ∧ SymRel 𝑅)) ↔ ( RefRel 𝑅 ∧ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅) ∧ SymRel 𝑅)))
8		anandir 676	. . . . 5 ⊢ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅) ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅) ∧ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅)))
9		refsymrel2 37426	. . . . 5 ⊢ (( RefRel 𝑅 ∧ SymRel 𝑅) ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅))
10		dfsymrel2 37408	. . . . . 6 ⊢ ( SymRel 𝑅 ↔ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅))
11	10	anbi2i 624	. . . . 5 ⊢ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅) ∧ SymRel 𝑅) ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅) ∧ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅)))
12	8, 9, 11	3bitr4i 303	. . . 4 ⊢ (( RefRel 𝑅 ∧ SymRel 𝑅) ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅) ∧ SymRel 𝑅))
13	12	anbi2i 624	. . 3 ⊢ (( RefRel 𝑅 ∧ ( RefRel 𝑅 ∧ SymRel 𝑅)) ↔ ( RefRel 𝑅 ∧ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅) ∧ SymRel 𝑅)))
14	7, 13	bitr4i 278	. 2 ⊢ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅) ∧ ( RefRel 𝑅 ∧ SymRel 𝑅)) ↔ ( RefRel 𝑅 ∧ ( RefRel 𝑅 ∧ SymRel 𝑅)))
15		df-redundp 37484	. 2 ⊢ ( redund ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅), RefRel 𝑅, ( RefRel 𝑅 ∧ SymRel 𝑅)) ↔ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅) → RefRel 𝑅) ∧ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅) ∧ ( RefRel 𝑅 ∧ SymRel 𝑅)) ↔ ( RefRel 𝑅 ∧ ( RefRel 𝑅 ∧ SymRel 𝑅)))))
16	6, 14, 15	mpbir2an 710	1 ⊢ redund ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ Rel 𝑅), RefRel 𝑅, ( RefRel 𝑅 ∧ SymRel 𝑅))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   ∩ cin 3947   ⊆ wss 3948   I cid 5573   × cxp 5674  ^◡ccnv 5675  dom cdm 5676  ran crn 5677   ↾ cres 5678  Rel wrel 5681   RefRel wrefrel 37038   SymRel wsymrel 37044   redund wredundp 37054

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-12 2172  ax-ext 2704  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-dm 5686  df-rn 5687  df-res 5688  df-refrel 37371  df-symrel 37403  df-redundp 37484

This theorem is referenced by:  refrelredund2  37495