Mathbox for Stefan O'Rear < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dford3lem1 Structured version   Visualization version   GIF version

Theorem dford3lem1 38119
 Description: Lemma for dford3 38121. (Contributed by Stefan O'Rear, 28-Oct-2014.)
Assertion
Ref Expression
dford3lem1 ((Tr 𝑁 ∧ ∀𝑦𝑁 Tr 𝑦) → ∀𝑏𝑁 (Tr 𝑏 ∧ ∀𝑦𝑏 Tr 𝑦))
Distinct variable group:   𝑦,𝑏,𝑁

Proof of Theorem dford3lem1
StepHypRef Expression
1 treq 4892 . . . . 5 (𝑦 = 𝑏 → (Tr 𝑦 ↔ Tr 𝑏))
21cbvralv 3320 . . . 4 (∀𝑦𝑁 Tr 𝑦 ↔ ∀𝑏𝑁 Tr 𝑏)
32biimpi 206 . . 3 (∀𝑦𝑁 Tr 𝑦 → ∀𝑏𝑁 Tr 𝑏)
43adantl 467 . 2 ((Tr 𝑁 ∧ ∀𝑦𝑁 Tr 𝑦) → ∀𝑏𝑁 Tr 𝑏)
5 trss 4895 . . . . . 6 (Tr 𝑁 → (𝑏𝑁𝑏𝑁))
6 ssralv 3815 . . . . . 6 (𝑏𝑁 → (∀𝑦𝑁 Tr 𝑦 → ∀𝑦𝑏 Tr 𝑦))
75, 6syl6 35 . . . . 5 (Tr 𝑁 → (𝑏𝑁 → (∀𝑦𝑁 Tr 𝑦 → ∀𝑦𝑏 Tr 𝑦)))
87com23 86 . . . 4 (Tr 𝑁 → (∀𝑦𝑁 Tr 𝑦 → (𝑏𝑁 → ∀𝑦𝑏 Tr 𝑦)))
98imp 393 . . 3 ((Tr 𝑁 ∧ ∀𝑦𝑁 Tr 𝑦) → (𝑏𝑁 → ∀𝑦𝑏 Tr 𝑦))
109ralrimiv 3114 . 2 ((Tr 𝑁 ∧ ∀𝑦𝑁 Tr 𝑦) → ∀𝑏𝑁𝑦𝑏 Tr 𝑦)
11 r19.26 3212 . 2 (∀𝑏𝑁 (Tr 𝑏 ∧ ∀𝑦𝑏 Tr 𝑦) ↔ (∀𝑏𝑁 Tr 𝑏 ∧ ∀𝑏𝑁𝑦𝑏 Tr 𝑦))
124, 10, 11sylanbrc 572 1 ((Tr 𝑁 ∧ ∀𝑦𝑁 Tr 𝑦) → ∀𝑏𝑁 (Tr 𝑏 ∧ ∀𝑦𝑏 Tr 𝑦))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 382   ∈ wcel 2145  ∀wral 3061   ⊆ wss 3723  Tr wtr 4886 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rex 3067  df-v 3353  df-in 3730  df-ss 3737  df-uni 4575  df-tr 4887 This theorem is referenced by:  dford3lem2  38120  dford3  38121
 Copyright terms: Public domain W3C validator