![]() |
Mathbox for BJ |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-rexcom4bv | Structured version Visualization version GIF version |
Description: Version of bj-rexcom4b 33446 with a disjoint variable condition on 𝑥, 𝑉, hence removing dependency on df-sb 2012 and df-clab 2764 (so that it depends on df-clel 2774 and df-rex 3096 only on top of first-order logic). Prefer its use over bj-rexcom4b 33446 when sufficient (in particular when 𝑉 is substituted for V). (Contributed by BJ, 14-Sep-2019.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
bj-rexcom4bv.1 | ⊢ 𝐵 ∈ 𝑉 |
Ref | Expression |
---|---|
bj-rexcom4bv | ⊢ (∃𝑥∃𝑦 ∈ 𝐴 (𝜑 ∧ 𝑥 = 𝐵) ↔ ∃𝑦 ∈ 𝐴 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bj-rexcom4a 33444 | . 2 ⊢ (∃𝑥∃𝑦 ∈ 𝐴 (𝜑 ∧ 𝑥 = 𝐵) ↔ ∃𝑦 ∈ 𝐴 (𝜑 ∧ ∃𝑥 𝑥 = 𝐵)) | |
2 | bj-rexcom4bv.1 | . . . . 5 ⊢ 𝐵 ∈ 𝑉 | |
3 | 2 | bj-issetiv 33437 | . . . 4 ⊢ ∃𝑥 𝑥 = 𝐵 |
4 | 3 | biantru 525 | . . 3 ⊢ (𝜑 ↔ (𝜑 ∧ ∃𝑥 𝑥 = 𝐵)) |
5 | 4 | rexbii 3224 | . 2 ⊢ (∃𝑦 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 (𝜑 ∧ ∃𝑥 𝑥 = 𝐵)) |
6 | 1, 5 | bitr4i 270 | 1 ⊢ (∃𝑥∃𝑦 ∈ 𝐴 (𝜑 ∧ 𝑥 = 𝐵) ↔ ∃𝑦 ∈ 𝐴 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 198 ∧ wa 386 = wceq 1601 ∃wex 1823 ∈ wcel 2107 ∃wrex 3091 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-11 2150 |
This theorem depends on definitions: df-bi 199 df-an 387 df-ex 1824 df-clel 2774 df-rex 3096 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |