| 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 40131. (Contributed by Rodolfo Medina, 25-Sep-2010.) |
| Ref | Expression |
|---|---|
| prtlem9 | ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 ∈ 𝐵 [𝑥] ∼ = [𝐴] ∼ ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | risset 3241 | . 2 ⊢ (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ 𝐵 𝑥 = 𝐴) | |
| 2 | eceq1 8785 | . . 3 ⊢ (𝑥 = 𝐴 → [𝑥] ∼ = [𝐴] ∼ ) | |
| 3 | 2 | reximi 3104 | . 2 ⊢ (∃𝑥 ∈ 𝐵 𝑥 = 𝐴 → ∃𝑥 ∈ 𝐵 [𝑥] ∼ = [𝐴] ∼ ) |
| 4 | 1, 3 | sylbi 220 | 1 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 ∈ 𝐵 [𝑥] ∼ = [𝐴] ∼ ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ∃wrex 3090 [cec 8743 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-br 5107 df-opab 5171 df-xp 5661 df-cnv 5663 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-ec 8747 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |