![]() |
Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dford3lem1 | Structured version Visualization version GIF version |
Description: Lemma for dford3 39969. (Contributed by Stefan O'Rear, 28-Oct-2014.) |
Ref | Expression |
---|---|
dford3lem1 | ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → ∀𝑏 ∈ 𝑁 (Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | treq 5142 | . . . . 5 ⊢ (𝑦 = 𝑏 → (Tr 𝑦 ↔ Tr 𝑏)) | |
2 | 1 | cbvralvw 3396 | . . . 4 ⊢ (∀𝑦 ∈ 𝑁 Tr 𝑦 ↔ ∀𝑏 ∈ 𝑁 Tr 𝑏) |
3 | 2 | biimpi 219 | . . 3 ⊢ (∀𝑦 ∈ 𝑁 Tr 𝑦 → ∀𝑏 ∈ 𝑁 Tr 𝑏) |
4 | 3 | adantl 485 | . 2 ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → ∀𝑏 ∈ 𝑁 Tr 𝑏) |
5 | trss 5145 | . . . . . 6 ⊢ (Tr 𝑁 → (𝑏 ∈ 𝑁 → 𝑏 ⊆ 𝑁)) | |
6 | ssralv 3981 | . . . . . 6 ⊢ (𝑏 ⊆ 𝑁 → (∀𝑦 ∈ 𝑁 Tr 𝑦 → ∀𝑦 ∈ 𝑏 Tr 𝑦)) | |
7 | 5, 6 | syl6 35 | . . . . 5 ⊢ (Tr 𝑁 → (𝑏 ∈ 𝑁 → (∀𝑦 ∈ 𝑁 Tr 𝑦 → ∀𝑦 ∈ 𝑏 Tr 𝑦))) |
8 | 7 | com23 86 | . . . 4 ⊢ (Tr 𝑁 → (∀𝑦 ∈ 𝑁 Tr 𝑦 → (𝑏 ∈ 𝑁 → ∀𝑦 ∈ 𝑏 Tr 𝑦))) |
9 | 8 | imp 410 | . . 3 ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → (𝑏 ∈ 𝑁 → ∀𝑦 ∈ 𝑏 Tr 𝑦)) |
10 | 9 | ralrimiv 3148 | . 2 ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → ∀𝑏 ∈ 𝑁 ∀𝑦 ∈ 𝑏 Tr 𝑦) |
11 | r19.26 3137 | . 2 ⊢ (∀𝑏 ∈ 𝑁 (Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) ↔ (∀𝑏 ∈ 𝑁 Tr 𝑏 ∧ ∀𝑏 ∈ 𝑁 ∀𝑦 ∈ 𝑏 Tr 𝑦)) | |
12 | 4, 10, 11 | sylanbrc 586 | 1 ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → ∀𝑏 ∈ 𝑁 (Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2111 ∀wral 3106 ⊆ wss 3881 Tr wtr 5136 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-11 2158 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-ral 3111 df-v 3443 df-in 3888 df-ss 3898 df-uni 4801 df-tr 5137 |
This theorem is referenced by: dford3lem2 39968 dford3 39969 |
Copyright terms: Public domain | W3C validator |