![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme31se2 | Structured version Visualization version GIF version |
Description: Part of proof of Lemma D in [Crawley] p. 113. (Contributed by NM, 3-Apr-2013.) |
Ref | Expression |
---|---|
cdleme31se2.e | ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) |
cdleme31se2.y | ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
Ref | Expression |
---|---|
cdleme31se2 | ⊢ (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑡⦌𝐸 = 𝑌) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2892 | . . . . 5 ⊢ Ⅎ𝑡(𝑃 ∨ 𝑄) | |
2 | nfcv 2892 | . . . . 5 ⊢ Ⅎ𝑡 ∧ | |
3 | nfcsb1v 3910 | . . . . . 6 ⊢ Ⅎ𝑡⦋𝑆 / 𝑡⦌𝐷 | |
4 | nfcv 2892 | . . . . . 6 ⊢ Ⅎ𝑡 ∨ | |
5 | nfcv 2892 | . . . . . 6 ⊢ Ⅎ𝑡((𝑅 ∨ 𝑆) ∧ 𝑊) | |
6 | 3, 4, 5 | nfov 7445 | . . . . 5 ⊢ Ⅎ𝑡(⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)) |
7 | 1, 2, 6 | nfov 7445 | . . . 4 ⊢ Ⅎ𝑡((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
8 | 7 | a1i 11 | . . 3 ⊢ (𝑆 ∈ 𝐴 → Ⅎ𝑡((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))) |
9 | csbeq1a 3899 | . . . . 5 ⊢ (𝑡 = 𝑆 → 𝐷 = ⦋𝑆 / 𝑡⦌𝐷) | |
10 | oveq2 7423 | . . . . . 6 ⊢ (𝑡 = 𝑆 → (𝑅 ∨ 𝑡) = (𝑅 ∨ 𝑆)) | |
11 | 10 | oveq1d 7430 | . . . . 5 ⊢ (𝑡 = 𝑆 → ((𝑅 ∨ 𝑡) ∧ 𝑊) = ((𝑅 ∨ 𝑆) ∧ 𝑊)) |
12 | 9, 11 | oveq12d 7433 | . . . 4 ⊢ (𝑡 = 𝑆 → (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)) = (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
13 | 12 | oveq2d 7431 | . . 3 ⊢ (𝑡 = 𝑆 → ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))) |
14 | 8, 13 | csbiegf 3919 | . 2 ⊢ (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑡⦌((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))) |
15 | cdleme31se2.e | . . 3 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) | |
16 | 15 | csbeq2i 3893 | . 2 ⊢ ⦋𝑆 / 𝑡⦌𝐸 = ⦋𝑆 / 𝑡⦌((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) |
17 | cdleme31se2.y | . 2 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) | |
18 | 14, 16, 17 | 3eqtr4g 2790 | 1 ⊢ (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑡⦌𝐸 = 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2098 Ⅎwnfc 2875 ⦋csb 3885 (class class class)co 7415 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ral 3052 df-rex 3061 df-rab 3420 df-v 3465 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-ss 3957 df-nul 4319 df-if 4525 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-br 5144 df-iota 6494 df-fv 6550 df-ov 7418 |
This theorem is referenced by: cdlemeg47rv2 40038 |
Copyright terms: Public domain | W3C validator |