Theorem dford3lem1 44033

Description: Lemma for dford3 44035. (Contributed by Stefan O'Rear, 28-Oct-2014.)

Assertion

Ref	Expression
dford3lem1	⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → ∀𝑏 ∈ 𝑁 (Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦))

Distinct variable group:   𝑦,𝑏,𝑁

Proof of Theorem dford3lem1

Step	Hyp	Ref	Expression
1		treq 5218	. . . 4 ⊢ (𝑦 = 𝑏 → (Tr 𝑦 ↔ Tr 𝑏))
2	1	cbvralvw 3240	. . 3 ⊢ (∀𝑦 ∈ 𝑁 Tr 𝑦 ↔ ∀𝑏 ∈ 𝑁 Tr 𝑏)
3	2	bilani 510	. 2 ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → ∀𝑏 ∈ 𝑁 Tr 𝑏)
4		trss 5221	. . . . . 6 ⊢ (Tr 𝑁 → (𝑏 ∈ 𝑁 → 𝑏 ⊆ 𝑁))
5		ssralv 3977	. . . . . 6 ⊢ (𝑏 ⊆ 𝑁 → (∀𝑦 ∈ 𝑁 Tr 𝑦 → ∀𝑦 ∈ 𝑏 Tr 𝑦))
6	4, 5	syl6 36	. . . . 5 ⊢ (Tr 𝑁 → (𝑏 ∈ 𝑁 → (∀𝑦 ∈ 𝑁 Tr 𝑦 → ∀𝑦 ∈ 𝑏 Tr 𝑦)))
7	6	com23 87	. . . 4 ⊢ (Tr 𝑁 → (∀𝑦 ∈ 𝑁 Tr 𝑦 → (𝑏 ∈ 𝑁 → ∀𝑦 ∈ 𝑏 Tr 𝑦)))
8	7	imp 412	. . 3 ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → (𝑏 ∈ 𝑁 → ∀𝑦 ∈ 𝑏 Tr 𝑦))
9	8	ralrimiv 3153	. 2 ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → ∀𝑏 ∈ 𝑁 ∀𝑦 ∈ 𝑏 Tr 𝑦)
10		r19.26 3122	. 2 ⊢ (∀𝑏 ∈ 𝑁 (Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) ↔ (∀𝑏 ∈ 𝑁 Tr 𝑏 ∧ ∀𝑏 ∈ 𝑁 ∀𝑦 ∈ 𝑏 Tr 𝑦))
11	3, 9, 10	sylanbrc 595	1 ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → ∀𝑏 ∈ 𝑁 (Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2144  ∀wral 3076   ⊆ wss 3895  Tr wtr 5211

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-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-v 3452  df-ss 3896  df-uni 4867  df-tr 5212

This theorem is used by:  dford3lem2  44034  dford3  44035