| Mathbox for Rodolfo Medina |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > prtlem9 | Structured version Visualization version GIF version | ||
| Description: Lemma for prter3 39757. (Contributed by Rodolfo Medina, 25-Sep-2010.) |
| Ref | Expression |
|---|---|
| prtlem9 | ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 ∈ 𝐵 [𝑥] ∼ = [𝐴] ∼ ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | risset 3239 | . 2 ⊢ (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ 𝐵 𝑥 = 𝐴) | |
| 2 | eceq1 8739 | . . 3 ⊢ (𝑥 = 𝐴 → [𝑥] ∼ = [𝐴] ∼ ) | |
| 3 | 2 | reximi 3102 | . 2 ⊢ (∃𝑥 ∈ 𝐵 𝑥 = 𝐴 → ∃𝑥 ∈ 𝐵 [𝑥] ∼ = [𝐴] ∼ ) |
| 4 | 1, 3 | sylbi 220 | 1 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 ∈ 𝐵 [𝑥] ∼ = [𝐴] ∼ ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ∃wrex 3088 [cec 8697 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-xp 5665 df-cnv 5667 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-ec 8701 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |