| 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 38678 | . 2 ⊢ RefRels = {𝑟 ∈ Rels ∣ ( I ∩ (dom 𝑟 × ran 𝑟)) ⊆ 𝑟} | |
| 2 | dmeq 5849 | . . . . 5 ⊢ (𝑟 = 𝑅 → dom 𝑟 = dom 𝑅) | |
| 3 | rneq 5882 | . . . . 5 ⊢ (𝑟 = 𝑅 → ran 𝑟 = ran 𝑅) | |
| 4 | 2, 3 | xpeq12d 5652 | . . . 4 ⊢ (𝑟 = 𝑅 → (dom 𝑟 × ran 𝑟) = (dom 𝑅 × ran 𝑅)) |
| 5 | 4 | ineq2d 4169 | . . 3 ⊢ (𝑟 = 𝑅 → ( I ∩ (dom 𝑟 × ran 𝑟)) = ( I ∩ (dom 𝑅 × ran 𝑅))) |
| 6 | id 22 | . . 3 ⊢ (𝑟 = 𝑅 → 𝑟 = 𝑅) | |
| 7 | 5, 6 | sseq12d 3964 | . 2 ⊢ (𝑟 = 𝑅 → (( I ∩ (dom 𝑟 × ran 𝑟)) ⊆ 𝑟 ↔ ( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅)) |
| 8 | 1, 7 | rabeqel 38364 | 1 ⊢ (𝑅 ∈ RefRels ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ 𝑅 ∈ Rels )) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∩ cin 3897 ⊆ wss 3898 I cid 5515 × cxp 5619 dom cdm 5621 ran crn 5622 Rels crels 38297 RefRels crefrels 38300 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pr 5374 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2712 df-cleq 2725 df-clel 2808 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-br 5096 df-opab 5158 df-xp 5627 df-rel 5628 df-cnv 5629 df-dm 5631 df-rn 5632 df-res 5633 df-rels 38537 df-ssr 38663 df-refs 38675 df-refrels 38676 |
| This theorem is referenced by: elrefrelsrel 38685 |
| Copyright terms: Public domain | W3C validator |