Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemk40f | Structured version Visualization version GIF version |
Description: TODO: fix comment. (Contributed by NM, 31-Jul-2013.) |
Ref | Expression |
---|---|
cdlemk40.x | ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 𝜑) |
cdlemk40.u | ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) |
Ref | Expression |
---|---|
cdlemk40f | ⊢ ((𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) → (𝑈‘𝐺) = ⦋𝐺 / 𝑔⦌𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cdlemk40.x | . . 3 ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 𝜑) | |
2 | cdlemk40.u | . . 3 ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) | |
3 | 1, 2 | cdlemk40 38931 | . 2 ⊢ (𝐺 ∈ 𝑇 → (𝑈‘𝐺) = if(𝐹 = 𝑁, 𝐺, ⦋𝐺 / 𝑔⦌𝑋)) |
4 | ifnefalse 4471 | . 2 ⊢ (𝐹 ≠ 𝑁 → if(𝐹 = 𝑁, 𝐺, ⦋𝐺 / 𝑔⦌𝑋) = ⦋𝐺 / 𝑔⦌𝑋) | |
5 | 3, 4 | sylan9eqr 2800 | 1 ⊢ ((𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) → (𝑈‘𝐺) = ⦋𝐺 / 𝑔⦌𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ⦋csb 3832 ifcif 4459 ↦ cmpt 5157 ‘cfv 6433 ℩crio 7231 |
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 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
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-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-iota 6391 df-fun 6435 df-fv 6441 df-riota 7232 |
This theorem is referenced by: cdlemk43N 38977 cdlemk35u 38978 cdlemk55u1 38979 cdlemk39u1 38981 cdlemk19u1 38983 |
Copyright terms: Public domain | W3C validator |