| 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 38645 | . 2 ⊢ (𝐴 ∈ 𝑉 → (◡ E ↾ 𝐴) ∈ V) | |
| 2 | cossex 38818 | . 2 ⊢ ((◡ E ↾ 𝐴) ∈ V → ≀ (◡ E ↾ 𝐴) ∈ V) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝐴 ∈ 𝑉 → ≀ (◡ E ↾ 𝐴) ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2114 Vcvv 3427 E cep 5519 ◡ccnv 5619 ↾ cres 5622 ≀ ccoss 38492 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2184 ax-ext 2707 ax-rep 5201 ax-sep 5220 ax-pow 5296 ax-pr 5364 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-clab 2714 df-cleq 2727 df-clel 2810 df-ne 2931 df-ral 3050 df-rex 3060 df-rab 3388 df-v 3429 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 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 38810 |
| This theorem is referenced by: elcoeleqvrelsrel 38989 mpets2 39264 |
| Copyright terms: Public domain | W3C validator |