Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme31sn | Structured version Visualization version GIF version |
Description: Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 26-Feb-2013.) |
Ref | Expression |
---|---|
cdleme31sn.n | ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) |
cdleme31sn.c | ⊢ 𝐶 = if(𝑅 ≤ (𝑃 ∨ 𝑄), ⦋𝑅 / 𝑠⦌𝐼, ⦋𝑅 / 𝑠⦌𝐷) |
Ref | Expression |
---|---|
cdleme31sn | ⊢ (𝑅 ∈ 𝐴 → ⦋𝑅 / 𝑠⦌𝑁 = 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1917 | . . . . 5 ⊢ Ⅎ𝑠 𝑅 ≤ (𝑃 ∨ 𝑄) | |
2 | nfcsb1v 3857 | . . . . 5 ⊢ Ⅎ𝑠⦋𝑅 / 𝑠⦌𝐼 | |
3 | nfcsb1v 3857 | . . . . 5 ⊢ Ⅎ𝑠⦋𝑅 / 𝑠⦌𝐷 | |
4 | 1, 2, 3 | nfif 4489 | . . . 4 ⊢ Ⅎ𝑠if(𝑅 ≤ (𝑃 ∨ 𝑄), ⦋𝑅 / 𝑠⦌𝐼, ⦋𝑅 / 𝑠⦌𝐷) |
5 | 4 | a1i 11 | . . 3 ⊢ (𝑅 ∈ 𝐴 → Ⅎ𝑠if(𝑅 ≤ (𝑃 ∨ 𝑄), ⦋𝑅 / 𝑠⦌𝐼, ⦋𝑅 / 𝑠⦌𝐷)) |
6 | breq1 5077 | . . . 4 ⊢ (𝑠 = 𝑅 → (𝑠 ≤ (𝑃 ∨ 𝑄) ↔ 𝑅 ≤ (𝑃 ∨ 𝑄))) | |
7 | csbeq1a 3846 | . . . 4 ⊢ (𝑠 = 𝑅 → 𝐼 = ⦋𝑅 / 𝑠⦌𝐼) | |
8 | csbeq1a 3846 | . . . 4 ⊢ (𝑠 = 𝑅 → 𝐷 = ⦋𝑅 / 𝑠⦌𝐷) | |
9 | 6, 7, 8 | ifbieq12d 4487 | . . 3 ⊢ (𝑠 = 𝑅 → if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) = if(𝑅 ≤ (𝑃 ∨ 𝑄), ⦋𝑅 / 𝑠⦌𝐼, ⦋𝑅 / 𝑠⦌𝐷)) |
10 | 5, 9 | csbiegf 3866 | . 2 ⊢ (𝑅 ∈ 𝐴 → ⦋𝑅 / 𝑠⦌if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) = if(𝑅 ≤ (𝑃 ∨ 𝑄), ⦋𝑅 / 𝑠⦌𝐼, ⦋𝑅 / 𝑠⦌𝐷)) |
11 | cdleme31sn.n | . . 3 ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) | |
12 | 11 | csbeq2i 3840 | . 2 ⊢ ⦋𝑅 / 𝑠⦌𝑁 = ⦋𝑅 / 𝑠⦌if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) |
13 | cdleme31sn.c | . 2 ⊢ 𝐶 = if(𝑅 ≤ (𝑃 ∨ 𝑄), ⦋𝑅 / 𝑠⦌𝐼, ⦋𝑅 / 𝑠⦌𝐷) | |
14 | 10, 12, 13 | 3eqtr4g 2803 | 1 ⊢ (𝑅 ∈ 𝐴 → ⦋𝑅 / 𝑠⦌𝑁 = 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2106 Ⅎwnfc 2887 ⦋csb 3832 ifcif 4459 class class class wbr 5074 (class class class)co 7275 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-br 5075 |
This theorem is referenced by: cdleme31sn1 38395 cdleme31sn2 38403 |
Copyright terms: Public domain | W3C validator |