![]() |
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 2908 | . . . . 5 ⊢ Ⅎ𝑡(𝑃 ∨ 𝑄) | |
2 | nfcv 2908 | . . . . 5 ⊢ Ⅎ𝑡 ∧ | |
3 | nfcsb1v 3885 | . . . . . 6 ⊢ Ⅎ𝑡⦋𝑆 / 𝑡⦌𝐷 | |
4 | nfcv 2908 | . . . . . 6 ⊢ Ⅎ𝑡 ∨ | |
5 | nfcv 2908 | . . . . . 6 ⊢ Ⅎ𝑡((𝑅 ∨ 𝑆) ∧ 𝑊) | |
6 | 3, 4, 5 | nfov 7392 | . . . . 5 ⊢ Ⅎ𝑡(⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)) |
7 | 1, 2, 6 | nfov 7392 | . . . 4 ⊢ Ⅎ𝑡((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
8 | 7 | a1i 11 | . . 3 ⊢ (𝑆 ∈ 𝐴 → Ⅎ𝑡((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))) |
9 | csbeq1a 3874 | . . . . 5 ⊢ (𝑡 = 𝑆 → 𝐷 = ⦋𝑆 / 𝑡⦌𝐷) | |
10 | oveq2 7370 | . . . . . 6 ⊢ (𝑡 = 𝑆 → (𝑅 ∨ 𝑡) = (𝑅 ∨ 𝑆)) | |
11 | 10 | oveq1d 7377 | . . . . 5 ⊢ (𝑡 = 𝑆 → ((𝑅 ∨ 𝑡) ∧ 𝑊) = ((𝑅 ∨ 𝑆) ∧ 𝑊)) |
12 | 9, 11 | oveq12d 7380 | . . . 4 ⊢ (𝑡 = 𝑆 → (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)) = (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
13 | 12 | oveq2d 7378 | . . 3 ⊢ (𝑡 = 𝑆 → ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))) |
14 | 8, 13 | csbiegf 3894 | . 2 ⊢ (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑡⦌((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))) |
15 | cdleme31se2.e | . . 3 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) | |
16 | 15 | csbeq2i 3868 | . 2 ⊢ ⦋𝑆 / 𝑡⦌𝐸 = ⦋𝑆 / 𝑡⦌((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) |
17 | cdleme31se2.y | . 2 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) | |
18 | 14, 16, 17 | 3eqtr4g 2802 | 1 ⊢ (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑡⦌𝐸 = 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2107 Ⅎwnfc 2888 ⦋csb 3860 (class class class)co 7362 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2708 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2890 df-ral 3066 df-rex 3075 df-rab 3411 df-v 3450 df-sbc 3745 df-csb 3861 df-dif 3918 df-un 3920 df-in 3922 df-ss 3932 df-nul 4288 df-if 4492 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-br 5111 df-iota 6453 df-fv 6509 df-ov 7365 |
This theorem is referenced by: cdlemeg47rv2 39002 |
Copyright terms: Public domain | W3C validator |