| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > erex | GIF version | ||
| Description: An equivalence relation is a set if its domain is a set. (Contributed by Rodolfo Medina, 15-Oct-2010.) (Proof shortened by Mario Carneiro, 12-Aug-2015.) |
| Ref | Expression |
|---|---|
| erex | ⊢ (𝑅 Er 𝐴 → (𝐴 ∈ 𝑉 → 𝑅 ∈ V)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | erssxp 6824 | . . 3 ⊢ (𝑅 Er 𝐴 → 𝑅 ⊆ (𝐴 × 𝐴)) | |
| 2 | xpexg 4887 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) → (𝐴 × 𝐴) ∈ V) | |
| 3 | 2 | anidms 401 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 × 𝐴) ∈ V) |
| 4 | ssexg 4270 | . . 3 ⊢ ((𝑅 ⊆ (𝐴 × 𝐴) ∧ (𝐴 × 𝐴) ∈ V) → 𝑅 ∈ V) | |
| 5 | 1, 3, 4 | syl2an 289 | . 2 ⊢ ((𝑅 Er 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝑅 ∈ V) |
| 6 | 5 | ex 115 | 1 ⊢ (𝑅 Er 𝐴 → (𝐴 ∈ 𝑉 → 𝑅 ∈ V)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∈ wcel 2209 Vcvv 2821 ⊆ wss 3220 × cxp 4770 Er wer 6798 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-br 4129 df-opab 4191 df-xp 4778 df-rel 4779 df-cnv 4780 df-dm 4782 df-rn 4783 df-er 6801 |
| This theorem is referenced by: erexb 6826 qliftlem 6881 qusaddvallemg 13637 qusaddflemg 13638 qusaddval 13639 qusaddf 13640 qusmulval 13641 qusmulf 13642 qusgrp2 13899 eqgen 14013 qusrng 14240 qusring2 14354 |
| Copyright terms: Public domain | W3C validator |