| Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > sbc2rexgOLD | Structured version Visualization version GIF version | ||
| Description: Exchange a substitution with two existentials. (Contributed by Stefan O'Rear, 11-Oct-2014.) Obsolete as of 24-Aug-2018. Use csbov123 7457 instead. (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| sbc2rexgOLD | ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑎]∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 𝜑 ↔ ∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 [𝐴 / 𝑎]𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 3484 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | sbcrexgOLD 42774 | . . 3 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑎]∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 𝜑 ↔ ∃𝑏 ∈ 𝐵 [𝐴 / 𝑎]∃𝑐 ∈ 𝐶 𝜑)) | |
| 3 | sbcrexgOLD 42774 | . . . 4 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑎]∃𝑐 ∈ 𝐶 𝜑 ↔ ∃𝑐 ∈ 𝐶 [𝐴 / 𝑎]𝜑)) | |
| 4 | 3 | rexbidv 3166 | . . 3 ⊢ (𝐴 ∈ V → (∃𝑏 ∈ 𝐵 [𝐴 / 𝑎]∃𝑐 ∈ 𝐶 𝜑 ↔ ∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 [𝐴 / 𝑎]𝜑)) |
| 5 | 2, 4 | bitrd 279 | . 2 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑎]∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 𝜑 ↔ ∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 [𝐴 / 𝑎]𝜑)) |
| 6 | 1, 5 | syl 17 | 1 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑎]∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 𝜑 ↔ ∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 [𝐴 / 𝑎]𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∈ wcel 2107 ∃wrex 3059 Vcvv 3463 [wsbc 3770 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-13 2375 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1542 df-ex 1779 df-nf 1783 df-sb 2064 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ral 3051 df-rex 3060 df-v 3465 df-sbc 3771 |
| This theorem is referenced by: sbc4rexgOLD 42779 |
| Copyright terms: Public domain | W3C validator |