Theorem sbc4rexgOLD 40315

Description: Exchange a substitution with four existentials. (Contributed by Stefan O'Rear, 11-Oct-2014.) Obsolete as of 24-Aug-2018. Use csbov123 7255 instead. (New usage is discouraged.) (Proof modification is discouraged.)

Assertion

Ref	Expression
sbc4rexgOLD	⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑎]∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 ∃𝑒 ∈ 𝐸 𝜑 ↔ ∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 ∃𝑒 ∈ 𝐸 [𝐴 / 𝑎]𝜑))

Distinct variable groups:   𝐴,𝑏   𝐴,𝑐   𝐵,𝑎   𝐶,𝑎   𝑎,𝑏   𝑎,𝑐   𝐴,𝑑   𝐴,𝑒   𝐷,𝑎   𝐸,𝑎   𝑎,𝑑   𝑒,𝑎

Allowed substitution hints:   𝜑(𝑒,𝑎,𝑏,𝑐,𝑑)   𝐴(𝑎)   𝐵(𝑒,𝑏,𝑐,𝑑)   𝐶(𝑒,𝑏,𝑐,𝑑)   𝐷(𝑒,𝑏,𝑐,𝑑)   𝐸(𝑒,𝑏,𝑐,𝑑)   𝑉(𝑒,𝑎,𝑏,𝑐,𝑑)

Proof of Theorem sbc4rexgOLD

Step	Hyp	Ref	Expression
1		elex 3426	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
2		sbc2rexgOLD 40313	. . 3 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑎]∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 ∃𝑒 ∈ 𝐸 𝜑 ↔ ∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 [𝐴 / 𝑎]∃𝑑 ∈ 𝐷 ∃𝑒 ∈ 𝐸 𝜑))
3		sbc2rexgOLD 40313	. . . 4 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑎]∃𝑑 ∈ 𝐷 ∃𝑒 ∈ 𝐸 𝜑 ↔ ∃𝑑 ∈ 𝐷 ∃𝑒 ∈ 𝐸 [𝐴 / 𝑎]𝜑))
4	3	2rexbidv 3219	. . 3 ⊢ (𝐴 ∈ V → (∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 [𝐴 / 𝑎]∃𝑑 ∈ 𝐷 ∃𝑒 ∈ 𝐸 𝜑 ↔ ∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 ∃𝑒 ∈ 𝐸 [𝐴 / 𝑎]𝜑))
5	2, 4	bitrd 282	. 2 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑎]∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 ∃𝑒 ∈ 𝐸 𝜑 ↔ ∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 ∃𝑒 ∈ 𝐸 [𝐴 / 𝑎]𝜑))
6	1, 5	syl 17	1 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑎]∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 ∃𝑒 ∈ 𝐸 𝜑 ↔ ∃𝑏 ∈ 𝐵 ∃𝑐 ∈ 𝐶 ∃𝑑 ∈ 𝐷 ∃𝑒 ∈ 𝐸 [𝐴 / 𝑎]𝜑))

Syntax hints:   → wi 4   ↔ wb 209   ∈ wcel 2110  ∃wrex 3062  Vcvv 3408  [wsbc 3694

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-13 2371  ax-ext 2708

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-tru 1546  df-ex 1788  df-nf 1792  df-sb 2071  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ral 3066  df-rex 3067  df-v 3410  df-sbc 3695

This theorem is referenced by: (None)