![]() |
Mathbox for BJ |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-ceqsalgv | Structured version Visualization version GIF version |
Description: Version of bj-ceqsalg 36367 with a disjoint variable condition on 𝑥, 𝑉, removing dependency on df-sb 2061 and df-clab 2706. Prefer its use over bj-ceqsalg 36367 when sufficient (in particular when 𝑉 is substituted for V). (Contributed by BJ, 12-Oct-2019.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
bj-ceqsalgv.1 | ⊢ Ⅎ𝑥𝜓 |
bj-ceqsalgv.2 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
bj-ceqsalgv | ⊢ (𝐴 ∈ 𝑉 → (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elissetv 2810 | . 2 ⊢ (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 = 𝐴) | |
2 | bj-ceqsalgv.1 | . . 3 ⊢ Ⅎ𝑥𝜓 | |
3 | bj-ceqsalgv.2 | . . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
4 | 2, 3 | bj-ceqsalg0 36366 | . 2 ⊢ (∃𝑥 𝑥 = 𝐴 → (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ 𝜓)) |
5 | 1, 4 | syl 17 | 1 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∀wal 1532 = wceq 1534 ∃wex 1774 Ⅎwnf 1778 ∈ wcel 2099 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-12 2167 |
This theorem depends on definitions: df-bi 206 df-an 396 df-3an 1087 df-ex 1775 df-nf 1779 df-clel 2806 |
This theorem is referenced by: bj-ceqsal 36371 |
Copyright terms: Public domain | W3C validator |