| 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 43389. (Contributed by Stefan O'Rear, 28-Oct-2014.) |
| Ref | Expression |
|---|---|
| dford3lem1 | ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → ∀𝑏 ∈ 𝑁 (Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | treq 5214 | . . . . 5 ⊢ (𝑦 = 𝑏 → (Tr 𝑦 ↔ Tr 𝑏)) | |
| 2 | 1 | cbvralvw 3216 | . . . 4 ⊢ (∀𝑦 ∈ 𝑁 Tr 𝑦 ↔ ∀𝑏 ∈ 𝑁 Tr 𝑏) |
| 3 | 2 | biimpi 216 | . . 3 ⊢ (∀𝑦 ∈ 𝑁 Tr 𝑦 → ∀𝑏 ∈ 𝑁 Tr 𝑏) |
| 4 | 3 | adantl 481 | . 2 ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → ∀𝑏 ∈ 𝑁 Tr 𝑏) |
| 5 | trss 5217 | . . . . . 6 ⊢ (Tr 𝑁 → (𝑏 ∈ 𝑁 → 𝑏 ⊆ 𝑁)) | |
| 6 | ssralv 4004 | . . . . . 6 ⊢ (𝑏 ⊆ 𝑁 → (∀𝑦 ∈ 𝑁 Tr 𝑦 → ∀𝑦 ∈ 𝑏 Tr 𝑦)) | |
| 7 | 5, 6 | syl6 35 | . . . . 5 ⊢ (Tr 𝑁 → (𝑏 ∈ 𝑁 → (∀𝑦 ∈ 𝑁 Tr 𝑦 → ∀𝑦 ∈ 𝑏 Tr 𝑦))) |
| 8 | 7 | com23 86 | . . . 4 ⊢ (Tr 𝑁 → (∀𝑦 ∈ 𝑁 Tr 𝑦 → (𝑏 ∈ 𝑁 → ∀𝑦 ∈ 𝑏 Tr 𝑦))) |
| 9 | 8 | imp 406 | . . 3 ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → (𝑏 ∈ 𝑁 → ∀𝑦 ∈ 𝑏 Tr 𝑦)) |
| 10 | 9 | ralrimiv 3129 | . 2 ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → ∀𝑏 ∈ 𝑁 ∀𝑦 ∈ 𝑏 Tr 𝑦) |
| 11 | r19.26 3098 | . 2 ⊢ (∀𝑏 ∈ 𝑁 (Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) ↔ (∀𝑏 ∈ 𝑁 Tr 𝑏 ∧ ∀𝑏 ∈ 𝑁 ∀𝑦 ∈ 𝑏 Tr 𝑦)) | |
| 12 | 4, 10, 11 | sylanbrc 584 | 1 ⊢ ((Tr 𝑁 ∧ ∀𝑦 ∈ 𝑁 Tr 𝑦) → ∀𝑏 ∈ 𝑁 (Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2114 ∀wral 3052 ⊆ wss 3903 Tr wtr 5207 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-v 3444 df-ss 3920 df-uni 4866 df-tr 5208 |
| This theorem is referenced by: dford3lem2 43388 dford3 43389 |
| Copyright terms: Public domain | W3C validator |