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 35891 or ~? df-parts ) 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 5064 | . 2 ⊢ (𝐴𝑅𝐵 ↔ 𝐴(𝑆 ↾ 𝐶)𝐵) |
3 | brres 5854 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴(𝑆 ↾ 𝐶)𝐵 ↔ (𝐴 ∈ 𝐶 ∧ 𝐴𝑆𝐵))) | |
4 | 2, 3 | syl5bb 285 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴𝑅𝐵 ↔ (𝐴 ∈ 𝐶 ∧ 𝐴𝑆𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 class class class wbr 5058 ↾ cres 5551 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pr 5321 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-br 5059 df-opab 5121 df-xp 5555 df-res 5561 |
This theorem is referenced by: brers 35895 |
Copyright terms: Public domain | W3C validator |