| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 1cosscnvepresex | Structured version Visualization version GIF version | ||
| Description: Sufficient condition for a restricted converse epsilon coset to be a set. (Contributed by Peter Mazsa, 24-Sep-2021.) |
| Ref | Expression |
|---|---|
| 1cosscnvepresex | ⊢ (𝐴 ∈ 𝑉 → ≀ (◡ E ↾ 𝐴) ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvepresex 38716 | . 2 ⊢ (𝐴 ∈ 𝑉 → (◡ E ↾ 𝐴) ∈ V) | |
| 2 | cossex 38889 | . 2 ⊢ ((◡ E ↾ 𝐴) ∈ V → ≀ (◡ E ↾ 𝐴) ∈ V) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝐴 ∈ 𝑉 → ≀ (◡ E ↾ 𝐴) ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2121 Vcvv 3433 E cep 5519 ◡ccnv 5619 ↾ cres 5622 ≀ ccoss 38563 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5201 ax-sep 5220 ax-pow 5296 ax-pr 5364 ax-un 7681 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-clab 2720 df-cleq 2733 df-clel 2816 df-ne 2937 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-eprel 5520 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-coss 38881 |
| This theorem is referenced by: elcoeleqvrelsrel 39060 mpets2 39335 |
| Copyright terms: Public domain | W3C validator |