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 36702 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 5076 | . 2 ⊢ (𝐴𝑅𝐵 ↔ 𝐴(𝑆 ↾ 𝐶)𝐵) |
3 | brres 5887 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴(𝑆 ↾ 𝐶)𝐵 ↔ (𝐴 ∈ 𝐶 ∧ 𝐴𝑆𝐵))) | |
4 | 2, 3 | syl5bb 282 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴𝑅𝐵 ↔ (𝐴 ∈ 𝐶 ∧ 𝐴𝑆𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 class class class wbr 5070 ↾ cres 5582 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-br 5071 df-opab 5133 df-xp 5586 df-res 5592 |
This theorem is referenced by: brers 36706 |
Copyright terms: Public domain | W3C validator |