| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > elrefrels2 | Structured version Visualization version GIF version | ||
| Description: Element of the class of reflexive relations. (Contributed by Peter Mazsa, 23-Jul-2019.) |
| Ref | Expression |
|---|---|
| elrefrels2 | ⊢ (𝑅 ∈ RefRels ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ 𝑅 ∈ Rels )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfrefrels2 39305 | . 2 ⊢ RefRels = {𝑟 ∈ Rels ∣ ( I ∩ (dom 𝑟 × ran 𝑟)) ⊆ 𝑟} | |
| 2 | dmeq 5895 | . . . . 5 ⊢ (𝑟 = 𝑅 → dom 𝑟 = dom 𝑅) | |
| 3 | rneq 5928 | . . . . 5 ⊢ (𝑟 = 𝑅 → ran 𝑟 = ran 𝑅) | |
| 4 | 2, 3 | xpeq12d 5694 | . . . 4 ⊢ (𝑟 = 𝑅 → (dom 𝑟 × ran 𝑟) = (dom 𝑅 × ran 𝑅)) |
| 5 | 4 | ineq2d 4173 | . . 3 ⊢ (𝑟 = 𝑅 → ( I ∩ (dom 𝑟 × ran 𝑟)) = ( I ∩ (dom 𝑅 × ran 𝑅))) |
| 6 | id 23 | . . 3 ⊢ (𝑟 = 𝑅 → 𝑟 = 𝑅) | |
| 7 | 5, 6 | sseq12d 3971 | . 2 ⊢ (𝑟 = 𝑅 → (( I ∩ (dom 𝑟 × ran 𝑟)) ⊆ 𝑟 ↔ ( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅)) |
| 8 | 1, 7 | rabeqel 38969 | 1 ⊢ (𝑅 ∈ RefRels ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ 𝑅 ∈ Rels )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∩ cin 3905 ⊆ wss 3906 I cid 5557 × cxp 5661 dom cdm 5663 ran crn 5664 Rels crels 38897 RefRels crefrels 38900 |
| 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 2148 ax-9 2156 ax-ext 2737 ax-sep 5259 ax-pr 5406 |
| 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 2744 df-cleq 2757 df-clel 2840 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-br 5112 df-opab 5176 df-xp 5669 df-rel 5670 df-cnv 5671 df-dm 5673 df-rn 5674 df-res 5675 df-rels 39152 df-ssr 39290 df-refs 39302 df-refrels 39303 |
| This theorem is used by: elrefrelsrel 39312 |
| Copyright terms: Public domain | W3C validator |