| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-rexcom4b | Structured version Visualization version GIF version | ||
| Description: Remove from rexcom4b 3494 dependency on ax-ext 2741 and ax-13 2410 (and on df-or 861, df-cleq 2761, df-nfc 2918, df-v 3465). The hypothesis uses 𝑉 instead of V (see bj-isseti 37402 for the motivation). Use bj-rexcom4bv 37406 instead when sufficient (in particular when 𝑉 is substituted for V). (Contributed by BJ, 16-Jun-2019.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| bj-rexcom4b.1 | ⊢ 𝐵 ∈ 𝑉 |
| Ref | Expression |
|---|---|
| bj-rexcom4b | ⊢ (∃𝑥∃𝑦 ∈ 𝐴 (𝜑 ∧ 𝑥 = 𝐵) ↔ ∃𝑦 ∈ 𝐴 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rexcom4a 3301 | . 2 ⊢ (∃𝑥∃𝑦 ∈ 𝐴 (𝜑 ∧ 𝑥 = 𝐵) ↔ ∃𝑦 ∈ 𝐴 (𝜑 ∧ ∃𝑥 𝑥 = 𝐵)) | |
| 2 | bj-rexcom4b.1 | . . . . 5 ⊢ 𝐵 ∈ 𝑉 | |
| 3 | 2 | bj-isseti 37402 | . . . 4 ⊢ ∃𝑥 𝑥 = 𝐵 |
| 4 | 3 | biantru 538 | . . 3 ⊢ (𝜑 ↔ (𝜑 ∧ ∃𝑥 𝑥 = 𝐵)) |
| 5 | 4 | rexbii 3118 | . 2 ⊢ (∃𝑦 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 (𝜑 ∧ ∃𝑥 𝑥 = 𝐵)) |
| 6 | 1, 5 | bitr4i 281 | 1 ⊢ (∃𝑥∃𝑦 ∈ 𝐴 (𝜑 ∧ 𝑥 = 𝐵) ↔ ∃𝑦 ∈ 𝐴 𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 = wceq 1567 ∃wex 1806 ∈ wcel 2149 ∃wrex 3095 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-11 2198 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1570 df-ex 1807 df-sb 2098 df-clab 2748 df-clel 2844 df-rex 3096 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |