| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > eqres | Structured version Visualization version GIF version | ||
| Description: Converting a class constant definition by restriction (like df-ers 39817 or df-parts 39937) into a binary relation. (Contributed by Peter Mazsa, 1-Oct-2018.) |
| Ref | Expression |
|---|---|
| eqres.1 | ⊢ 𝑅 = (𝑆 ↾ 𝐶) |
| Ref | Expression |
|---|---|
| eqres | ⊢ (𝐵 ∈ 𝑉 → (𝐴𝑅𝐵 ↔ (𝐴 ∈ 𝐶 ∧ 𝐴𝑆𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqres.1 | . . 3 ⊢ 𝑅 = (𝑆 ↾ 𝐶) | |
| 2 | 1 | breqi 5108 | . 2 ⊢ (𝐴𝑅𝐵 ↔ 𝐴(𝑆 ↾ 𝐶)𝐵) |
| 3 | brres 5978 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴(𝑆 ↾ 𝐶)𝐵 ↔ (𝐴 ∈ 𝐶 ∧ 𝐴𝑆𝐵))) | |
| 4 | 2, 3 | bitrid 286 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴𝑅𝐵 ↔ (𝐴 ∈ 𝐶 ∧ 𝐴𝑆𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 class class class wbr 5102 ↾ cres 5653 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-br 5103 df-opab 5167 df-xp 5657 df-res 5663 |
| This theorem is used by: brers 39821 brparts 39943 |
| Copyright terms: Public domain | W3C validator |