Theorem sbccomieg 43561

Description: Commute two explicit substitutions, using an implicit substitution to rewrite the exiting substitution. (Contributed by Stefan O'Rear, 11-Oct-2014.) (Revised by Mario Carneiro, 11-Dec-2016.)

Hypothesis

Ref	Expression
sbccomieg.1	⊢ (𝑎 = 𝐴 → 𝐵 = 𝐶)

Assertion

Ref	Expression
sbccomieg	⊢ ([𝐴 / 𝑎][𝐵 / 𝑏]𝜑 ↔ [𝐶 / 𝑏][𝐴 / 𝑎]𝜑)

Distinct variable groups:   𝐴,𝑎,𝑏   𝐶,𝑎

Allowed substitution hints:   𝜑(𝑎, 𝑏)   𝐵(𝑎, 𝑏)   𝐶(𝑏)

Proof of Theorem sbccomieg

Step	Hyp	Ref	Expression
1		sbcex 3757	. 2 ⊢ ([𝐴 / 𝑎][𝐵 / 𝑏]𝜑 → 𝐴 ∈ V)
2		spesbc 3838	. . 3 ⊢ ([𝐶 / 𝑏][𝐴 / 𝑎]𝜑 → ∃𝑏[𝐴 / 𝑎]𝜑)
3		sbcex 3757	. . . 4 ⊢ ([𝐴 / 𝑎]𝜑 → 𝐴 ∈ V)
4	3	exlimiv 1963	. . 3 ⊢ (∃𝑏[𝐴 / 𝑎]𝜑 → 𝐴 ∈ V)
5	2, 4	syl 18	. 2 ⊢ ([𝐶 / 𝑏][𝐴 / 𝑎]𝜑 → 𝐴 ∈ V)
6		nfcv 2928	. . . 4 ⊢ Ⅎ𝑎𝐶
7		nfsbc1v 3767	. . . 4 ⊢ Ⅎ𝑎[𝐴 / 𝑎]𝜑
8	6, 7	nfsbcw 3769	. . 3 ⊢ Ⅎ𝑎[𝐶 / 𝑏][𝐴 / 𝑎]𝜑
9		sbccomieg.1	. . . 4 ⊢ (𝑎 = 𝐴 → 𝐵 = 𝐶)
10		sbceq1a 3758	. . . 4 ⊢ (𝑎 = 𝐴 → (𝜑 ↔ [𝐴 / 𝑎]𝜑))
11	9, 10	sbceqbid 3754	. . 3 ⊢ (𝑎 = 𝐴 → ([𝐵 / 𝑏]𝜑 ↔ [𝐶 / 𝑏][𝐴 / 𝑎]𝜑))
12	8, 11	sbciegf 3785	. 2 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑎][𝐵 / 𝑏]𝜑 ↔ [𝐶 / 𝑏][𝐴 / 𝑎]𝜑))
13	1, 5, 12	pm5.21nii 381	1 ⊢ ([𝐴 / 𝑎][𝐵 / 𝑏]𝜑 ↔ [𝐶 / 𝑏][𝐴 / 𝑎]𝜑)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570  ∃wex 1812   ∈ wcel 2146  Vcvv 3458  [wsbc 3747

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ral 3083  df-rex 3093  df-v 3460  df-sbc 3748

This theorem is used by:  2rexfrabdioph  43564  3rexfrabdioph  43565  4rexfrabdioph  43566  6rexfrabdioph  43567  7rexfrabdioph  43568