| 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 2922 | . . . . 5 ⊢ Ⅎ𝑡(𝑃 ∨ 𝑄) | |
| 2 | nfcv 2922 | . . . . 5 ⊢ Ⅎ𝑡 ∧ | |
| 3 | nfcsb1v 3871 | . . . . . 6 ⊢ Ⅎ𝑡⦋𝑆 / 𝑡⦌𝐷 | |
| 4 | nfcv 2922 | . . . . . 6 ⊢ Ⅎ𝑡 ∨ | |
| 5 | nfcv 2922 | . . . . . 6 ⊢ Ⅎ𝑡((𝑅 ∨ 𝑆) ∧ 𝑊) | |
| 6 | 3, 4, 5 | nfov 7444 | . . . . 5 ⊢ Ⅎ𝑡(⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)) |
| 7 | 1, 2, 6 | nfov 7444 | . . . 4 ⊢ Ⅎ𝑡((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
| 8 | 7 | a1i 11 | . . 3 ⊢ (𝑆 ∈ 𝐴 → Ⅎ𝑡((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))) |
| 9 | csbeq1a 3861 | . . . . 5 ⊢ (𝑡 = 𝑆 → 𝐷 = ⦋𝑆 / 𝑡⦌𝐷) | |
| 10 | oveq2 7422 | . . . . . 6 ⊢ (𝑡 = 𝑆 → (𝑅 ∨ 𝑡) = (𝑅 ∨ 𝑆)) | |
| 11 | 10 | oveq1d 7429 | . . . . 5 ⊢ (𝑡 = 𝑆 → ((𝑅 ∨ 𝑡) ∧ 𝑊) = ((𝑅 ∨ 𝑆) ∧ 𝑊)) |
| 12 | 9, 11 | oveq12d 7432 | . . . 4 ⊢ (𝑡 = 𝑆 → (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊)) = (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
| 13 | 12 | oveq2d 7430 | . . 3 ⊢ (𝑡 = 𝑆 → ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))) |
| 14 | 8, 13 | csbiegf 3880 | . 2 ⊢ (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑡⦌((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)))) |
| 15 | cdleme31se2.e | . . 3 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) | |
| 16 | 15 | csbeq2i 3855 | . 2 ⊢ ⦋𝑆 / 𝑡⦌𝐸 = ⦋𝑆 / 𝑡⦌((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑅 ∨ 𝑡) ∧ 𝑊))) |
| 17 | cdleme31se2.y | . 2 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∧ (⦋𝑆 / 𝑡⦌𝐷 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) | |
| 18 | 14, 16, 17 | 3eqtr4g 2820 | 1 ⊢ (𝑆 ∈ 𝐴 → ⦋𝑆 / 𝑡⦌𝐸 = 𝑌) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Ⅎwnfc 2907 ⦋csb 3847 (class class class)co 7414 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 |
| 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 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-iota 6489 df-fv 6541 df-ov 7417 |
| This theorem is used by: cdlemeg47rv2 41384 |
| Copyright terms: Public domain | W3C validator |