Theorem subtr 37195

Description: Transitivity of implicit substitution. (Contributed by Jeff Hankins, 13-Sep-2009.) (Proof shortened by Mario Carneiro, 11-Dec-2016.)

Hypotheses

Ref	Expression
subtr.1	⊢ Ⅎ𝑥𝐴
subtr.2	⊢ Ⅎ𝑥𝐵
subtr.3	⊢ Ⅎ𝑥𝑌
subtr.4	⊢ Ⅎ𝑥𝑍
subtr.5	⊢ (𝑥 = 𝐴 → 𝑋 = 𝑌)
subtr.6	⊢ (𝑥 = 𝐵 → 𝑋 = 𝑍)

Assertion

Ref	Expression
subtr	⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 = 𝐵 → 𝑌 = 𝑍))

Proof of Theorem subtr

Step	Hyp	Ref	Expression
1		subtr.1	. . 3 ⊢ Ⅎ𝑥𝐴
2		subtr.2	. . . . 5 ⊢ Ⅎ𝑥𝐵
3	1, 2	nfeq 2935	. . . 4 ⊢ Ⅎ𝑥 𝐴 = 𝐵
4		subtr.3	. . . . 5 ⊢ Ⅎ𝑥𝑌
5		subtr.4	. . . . 5 ⊢ Ⅎ𝑥𝑍
6	4, 5	nfeq 2935	. . . 4 ⊢ Ⅎ𝑥 𝑌 = 𝑍
7	3, 6	nfim 1928	. . 3 ⊢ Ⅎ𝑥(𝐴 = 𝐵 → 𝑌 = 𝑍)
8		eqeq1 2764	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝐵 ↔ 𝐴 = 𝐵))
9		subtr.5	. . . . 5 ⊢ (𝑥 = 𝐴 → 𝑋 = 𝑌)
10	9	eqeq1d 2762	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑋 = 𝑍 ↔ 𝑌 = 𝑍))
11	8, 10	imbi12d 347	. . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 = 𝐵 → 𝑋 = 𝑍) ↔ (𝐴 = 𝐵 → 𝑌 = 𝑍)))
12		subtr.6	. . 3 ⊢ (𝑥 = 𝐵 → 𝑋 = 𝑍)
13	1, 7, 11, 12	vtoclgf 3529	. 2 ⊢ (𝐴 ∈ 𝐶 → (𝐴 = 𝐵 → 𝑌 = 𝑍))
14	13	adantr 486	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴 = 𝐵 → 𝑌 = 𝑍))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Ⅎwnfc 2907

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-v 3452

This theorem is used by: (None)