Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cdleme31se2 Structured version   Visualization version   GIF version

Theorem cdleme31se2 41706
Description: Part of proof of Lemma D in [Crawley] p. 113. (Contributed by NM, 3-Apr-2013.)
Hypotheses
Ref Expression
cdleme31se2.e 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))
cdleme31se2.y 𝑌 = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))
Assertion
Ref Expression
cdleme31se2 (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑡⦌𝐸 = 𝑌)
Distinct variable groups:   𝑡,𝐴   𝑡, ∨   𝑡, ∧   𝑡,𝑃   𝑡,𝑄   𝑡,𝑅   𝑡,𝑆   𝑡,𝑊
Allowed substitution hints:   𝐷(𝑡)   𝐸(𝑡)   𝑌(𝑡)

Proof of Theorem cdleme31se2
StepHypRef Expression
1 nfcv 2926 . . . . 5 Ⅎ𝑡(𝑃 ∨ 𝑄)
2 nfcv 2926 . . . . 5 Ⅎ𝑡 ∧
3 nfcsb1v 3875 . . . . . 6 Ⅎ𝑡⦋𝑆 / 𝑡⦌𝐷
4 nfcv 2926 . . . . . 6 Ⅎ𝑡 ∨
5 nfcv 2926 . . . . . 6 Ⅎ𝑡((𝑅 ∨ 𝑆) ∧ 𝑊)
63, 4, 5nfov 7481 . . . . 5 Ⅎ𝑡(⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))
71, 2, 6nfov 7481 . . . 4 Ⅎ𝑡((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))
87a1i 11 . . 3 (𝑆 ∈ 𝐴 → Ⅎ𝑡((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))))
9 csbeq1a 3865 . . . . 5 (𝑡 = 𝑆 → 𝐷 = ⦋𝑆 / 𝑡⦌𝐷)
10 oveq2 7459 . . . . . 6 (𝑡 = 𝑆 → (𝑅 ∨ 𝑡) = (𝑅 ∨ 𝑆))
1110oveq1d 7466 . . . . 5 (𝑡 = 𝑆 → ((𝑅 ∨ 𝑡) ∧ 𝑊) = ((𝑅 ∨ 𝑆) ∧ 𝑊))
129, 11oveq12d 7469 . . . 4 (𝑡 = 𝑆 → (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)) = (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))
1312oveq2d 7467 . . 3 (𝑡 = 𝑆 → ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))))
148, 13csbiegf 3884 . 2 (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑡⦌((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))))
15 cdleme31se2.e . . 3 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))
1615csbeq2i 3859 . 2 ⦋𝑆 / 𝑡⦌𝐸 = ⦋𝑆 / 𝑡⦌((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)))
17 cdleme31se2.y . 2 𝑌 = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))
1814, 16, 173eqtr4g 2823 1 (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑡⦌𝐸 = 𝑌)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Ⅎwnfc 2911  ⦋csb 3851  (class class class)co 7451
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574  df-ov 7454
This theorem is used by:  cdlemeg47rv2  41833
  Copyright terms: Public domain W3C validator