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 2920 | . . . . 5 ⊢ Ⅎ𝑡(𝑃 ∨ 𝑄) | |
2 | nfcv 2920 | . . . . 5 ⊢ Ⅎ𝑡 ∧ | |
3 | nfcsb1v 3830 | . . . . . 6 ⊢ Ⅎ𝑡⦋𝑆 / 𝑡⦌𝐷 | |
4 | nfcv 2920 | . . . . . 6 ⊢ Ⅎ𝑡 ∨ | |
5 | nfcv 2920 | . . . . . 6 ⊢ Ⅎ𝑡((𝑅 ∨ 𝑆) ∧ 𝑊) | |
6 | 3, 4, 5 | nfov 7181 | . . . . 5 ⊢ Ⅎ𝑡(⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)) |
7 | 1, 2, 6 | nfov 7181 | . . . 4 ⊢ Ⅎ𝑡((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
8 | 7 | a1i 11 | . . 3 ⊢ (𝑆 ∈ 𝐴 → Ⅎ𝑡((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))) |
9 | csbeq1a 3820 | . . . . 5 ⊢ (𝑡 = 𝑆 → 𝐷 = ⦋𝑆 / 𝑡⦌𝐷) | |
10 | oveq2 7159 | . . . . . 6 ⊢ (𝑡 = 𝑆 → (𝑅 ∨ 𝑡) = (𝑅 ∨ 𝑆)) | |
11 | 10 | oveq1d 7166 | . . . . 5 ⊢ (𝑡 = 𝑆 → ((𝑅 ∨ 𝑡) ∧ 𝑊) = ((𝑅 ∨ 𝑆) ∧ 𝑊)) |
12 | 9, 11 | oveq12d 7169 | . . . 4 ⊢ (𝑡 = 𝑆 → (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)) = (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
13 | 12 | oveq2d 7167 | . . 3 ⊢ (𝑡 = 𝑆 → ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))) |
14 | 8, 13 | csbiegf 3839 | . 2 ⊢ (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑡⦌((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))) |
15 | cdleme31se2.e | . . 3 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) | |
16 | 15 | csbeq2i 3814 | . 2 ⊢ ⦋𝑆 / 𝑡⦌𝐸 = ⦋𝑆 / 𝑡⦌((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) |
17 | cdleme31se2.y | . 2 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) | |
18 | 14, 16, 17 | 3eqtr4g 2819 | 1 ⊢ (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑡⦌𝐸 = 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2112 Ⅎwnfc 2900 ⦋csb 3806 (class class class)co 7151 |
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 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 |
This theorem depends on definitions: df-bi 210 df-an 401 df-or 846 df-3an 1087 df-tru 1542 df-ex 1783 df-nf 1787 df-sb 2071 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2902 df-ral 3076 df-rex 3077 df-v 3412 df-sbc 3698 df-csb 3807 df-dif 3862 df-un 3864 df-in 3866 df-ss 3876 df-nul 4227 df-if 4422 df-sn 4524 df-pr 4526 df-op 4530 df-uni 4800 df-br 5034 df-iota 6295 df-fv 6344 df-ov 7154 |
This theorem is referenced by: cdlemeg47rv2 38087 |
Copyright terms: Public domain | W3C validator |