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 36017. (Contributed by Rodolfo Medina, 25-Sep-2010.) |
Ref | Expression |
---|---|
prtlem9 | ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 ∈ 𝐵 [𝑥] ∼ = [𝐴] ∼ ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | risset 3267 | . 2 ⊢ (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ 𝐵 𝑥 = 𝐴) | |
2 | eceq1 8326 | . . 3 ⊢ (𝑥 = 𝐴 → [𝑥] ∼ = [𝐴] ∼ ) | |
3 | 2 | reximi 3243 | . 2 ⊢ (∃𝑥 ∈ 𝐵 𝑥 = 𝐴 → ∃𝑥 ∈ 𝐵 [𝑥] ∼ = [𝐴] ∼ ) |
4 | 1, 3 | sylbi 219 | 1 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 ∈ 𝐵 [𝑥] ∼ = [𝐴] ∼ ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 ∃wrex 3139 [cec 8286 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4567 df-pr 4569 df-op 4573 df-br 5066 df-opab 5128 df-xp 5560 df-cnv 5562 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-ec 8290 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |