![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > clelsb1f | Structured version Visualization version GIF version |
Description: Substitution for the first argument of the membership predicate in an atomic formula (class version of elsb1 2106). Usage of this theorem is discouraged because it depends on ax-13 2365. See clelsb1fw 2901 not requiring ax-13 2365, but extra disjoint variables. (Contributed by Rodolfo Medina, 28-Apr-2010.) (Proof shortened by Andrew Salmon, 14-Jun-2011.) (Revised by Thierry Arnoux, 13-Mar-2017.) (Proof shortened by Wolf Lammen, 7-May-2023.) (New usage is discouraged.) |
Ref | Expression |
---|---|
clelsb1f.1 | ⊢ Ⅎ𝑥𝐴 |
Ref | Expression |
---|---|
clelsb1f | ⊢ ([𝑦 / 𝑥]𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | clelsb1f.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
2 | 1 | nfcri 2884 | . . 3 ⊢ Ⅎ𝑥 𝑤 ∈ 𝐴 |
3 | 2 | sbco2 2504 | . 2 ⊢ ([𝑦 / 𝑥][𝑥 / 𝑤]𝑤 ∈ 𝐴 ↔ [𝑦 / 𝑤]𝑤 ∈ 𝐴) |
4 | clelsb1 2854 | . . 3 ⊢ ([𝑥 / 𝑤]𝑤 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴) | |
5 | 4 | sbbii 2071 | . 2 ⊢ ([𝑦 / 𝑥][𝑥 / 𝑤]𝑤 ∈ 𝐴 ↔ [𝑦 / 𝑥]𝑥 ∈ 𝐴) |
6 | clelsb1 2854 | . 2 ⊢ ([𝑦 / 𝑤]𝑤 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴) | |
7 | 3, 5, 6 | 3bitr3i 301 | 1 ⊢ ([𝑦 / 𝑥]𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 [wsb 2059 ∈ wcel 2098 Ⅎwnfc 2877 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-10 2129 ax-11 2146 ax-12 2163 ax-13 2365 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-tru 1536 df-ex 1774 df-nf 1778 df-sb 2060 df-clel 2804 df-nfc 2879 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |