| 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 1915 | . . . . 5 ⊢ Ⅎ𝑠 𝑅 ≤ (𝑃 ∨ 𝑄) | |
| 2 | nfcsb1v 3869 | . . . . 5 ⊢ Ⅎ𝑠⦋𝑅 / 𝑠⦌𝐼 | |
| 3 | nfcsb1v 3869 | . . . . 5 ⊢ Ⅎ𝑠⦋𝑅 / 𝑠⦌𝐷 | |
| 4 | 1, 2, 3 | nfif 4503 | . . . 4 ⊢ Ⅎ𝑠if(𝑅 ≤ (𝑃 ∨ 𝑄), ⦋𝑅 / 𝑠⦌𝐼, ⦋𝑅 / 𝑠⦌𝐷) |
| 5 | 4 | a1i 11 | . . 3 ⊢ (𝑅 ∈ 𝐴 → Ⅎ𝑠if(𝑅 ≤ (𝑃 ∨ 𝑄), ⦋𝑅 / 𝑠⦌𝐼, ⦋𝑅 / 𝑠⦌𝐷)) |
| 6 | breq1 5092 | . . . 4 ⊢ (𝑠 = 𝑅 → (𝑠 ≤ (𝑃 ∨ 𝑄) ↔ 𝑅 ≤ (𝑃 ∨ 𝑄))) | |
| 7 | csbeq1a 3859 | . . . 4 ⊢ (𝑠 = 𝑅 → 𝐼 = ⦋𝑅 / 𝑠⦌𝐼) | |
| 8 | csbeq1a 3859 | . . . 4 ⊢ (𝑠 = 𝑅 → 𝐷 = ⦋𝑅 / 𝑠⦌𝐷) | |
| 9 | 6, 7, 8 | ifbieq12d 4501 | . . 3 ⊢ (𝑠 = 𝑅 → if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) = if(𝑅 ≤ (𝑃 ∨ 𝑄), ⦋𝑅 / 𝑠⦌𝐼, ⦋𝑅 / 𝑠⦌𝐷)) |
| 10 | 5, 9 | csbiegf 3878 | . 2 ⊢ (𝑅 ∈ 𝐴 → ⦋𝑅 / 𝑠⦌if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) = if(𝑅 ≤ (𝑃 ∨ 𝑄), ⦋𝑅 / 𝑠⦌𝐼, ⦋𝑅 / 𝑠⦌𝐷)) |
| 11 | cdleme31sn.n | . . 3 ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) | |
| 12 | 11 | csbeq2i 3853 | . 2 ⊢ ⦋𝑅 / 𝑠⦌𝑁 = ⦋𝑅 / 𝑠⦌if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷) |
| 13 | cdleme31sn.c | . 2 ⊢ 𝐶 = if(𝑅 ≤ (𝑃 ∨ 𝑄), ⦋𝑅 / 𝑠⦌𝐼, ⦋𝑅 / 𝑠⦌𝐷) | |
| 14 | 10, 12, 13 | 3eqtr4g 2791 | 1 ⊢ (𝑅 ∈ 𝐴 → ⦋𝑅 / 𝑠⦌𝑁 = 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2111 Ⅎwnfc 2879 ⦋csb 3845 ifcif 4472 class class class wbr 5089 (class class class)co 7346 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-ss 3914 df-nul 4281 df-if 4473 df-sn 4574 df-pr 4576 df-op 4580 df-br 5090 |
| This theorem is referenced by: cdleme31sn1 40479 cdleme31sn2 40487 |
| Copyright terms: Public domain | W3C validator |