Mathbox for Peter Mazsa < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  refrelsredund4 Structured version   Visualization version   GIF version

Theorem refrelsredund4 36043
 Description: The naive version of the class of reflexive relations is redundant with respect to the class of reflexive relations (see dfrefrels2 35929) if the relations are symmetric as well. (Contributed by Peter Mazsa, 26-Oct-2022.)
Assertion
Ref Expression
refrelsredund4 {𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} Redund ⟨ RefRels , ( RefRels ∩ SymRels )⟩

Proof of Theorem refrelsredund4
StepHypRef Expression
1 inxpssres 5536 . . . . 5 ( I ∩ (dom 𝑟 × ran 𝑟)) ⊆ ( I ↾ dom 𝑟)
2 sstr2 3922 . . . . 5 (( I ∩ (dom 𝑟 × ran 𝑟)) ⊆ ( I ↾ dom 𝑟) → (( I ↾ dom 𝑟) ⊆ 𝑟 → ( I ∩ (dom 𝑟 × ran 𝑟)) ⊆ 𝑟))
31, 2ax-mp 5 . . . 4 (( I ↾ dom 𝑟) ⊆ 𝑟 → ( I ∩ (dom 𝑟 × ran 𝑟)) ⊆ 𝑟)
43ssrabi 35687 . . 3 {𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ⊆ {𝑟 ∈ Rels ∣ ( I ∩ (dom 𝑟 × ran 𝑟)) ⊆ 𝑟}
5 dfrefrels2 35929 . . 3 RefRels = {𝑟 ∈ Rels ∣ ( I ∩ (dom 𝑟 × ran 𝑟)) ⊆ 𝑟}
64, 5sseqtrri 3952 . 2 {𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ⊆ RefRels
7 in32 4148 . . . 4 (({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ∩ SymRels ) ∩ RefRels ) = (({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ∩ RefRels ) ∩ SymRels )
8 inrab 4227 . . . . . 6 ({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ∩ {𝑟 ∈ Rels ∣ 𝑟𝑟}) = {𝑟 ∈ Rels ∣ (( I ↾ dom 𝑟) ⊆ 𝑟𝑟𝑟)}
9 dfsymrels2 35957 . . . . . . 7 SymRels = {𝑟 ∈ Rels ∣ 𝑟𝑟}
109ineq2i 4136 . . . . . 6 ({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ∩ SymRels ) = ({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ∩ {𝑟 ∈ Rels ∣ 𝑟𝑟})
11 refsymrels2 35977 . . . . . 6 ( RefRels ∩ SymRels ) = {𝑟 ∈ Rels ∣ (( I ↾ dom 𝑟) ⊆ 𝑟𝑟𝑟)}
128, 10, 113eqtr4i 2831 . . . . 5 ({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ∩ SymRels ) = ( RefRels ∩ SymRels )
1312ineq1i 4135 . . . 4 (({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ∩ SymRels ) ∩ RefRels ) = (( RefRels ∩ SymRels ) ∩ RefRels )
14 inass 4146 . . . 4 (({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ∩ RefRels ) ∩ SymRels ) = ({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ∩ ( RefRels ∩ SymRels ))
157, 13, 143eqtr3ri 2830 . . 3 ({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ∩ ( RefRels ∩ SymRels )) = (( RefRels ∩ SymRels ) ∩ RefRels )
16 in32 4148 . . 3 (( RefRels ∩ SymRels ) ∩ RefRels ) = (( RefRels ∩ RefRels ) ∩ SymRels )
17 inass 4146 . . 3 (( RefRels ∩ RefRels ) ∩ SymRels ) = ( RefRels ∩ ( RefRels ∩ SymRels ))
1815, 16, 173eqtri 2825 . 2 ({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ∩ ( RefRels ∩ SymRels )) = ( RefRels ∩ ( RefRels ∩ SymRels ))
19 df-redund 36035 . 2 ({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} Redund ⟨ RefRels , ( RefRels ∩ SymRels )⟩ ↔ ({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ⊆ RefRels ∧ ({𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} ∩ ( RefRels ∩ SymRels )) = ( RefRels ∩ ( RefRels ∩ SymRels ))))
206, 18, 19mpbir2an 710 1 {𝑟 ∈ Rels ∣ ( I ↾ dom 𝑟) ⊆ 𝑟} Redund ⟨ RefRels , ( RefRels ∩ SymRels )⟩
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538  {crab 3110   ∩ cin 3880   ⊆ wss 3881   I cid 5424   × cxp 5517  ◡ccnv 5518  dom cdm 5519  ran crn 5520   ↾ cres 5521   Rels crels 35631   RefRels crefrels 35634   SymRels csymrels 35640   Redund wredund 35650 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-br 5031  df-opab 5093  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-dm 5529  df-rn 5530  df-res 5531  df-rels 35901  df-ssr 35914  df-refs 35926  df-refrels 35927  df-syms 35954  df-symrels 35955  df-redund 36035 This theorem is referenced by:  refrelsredund2  36044
 Copyright terms: Public domain W3C validator