![]() |
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 40867 | . 2 ⊢ (𝐺 ∈ 𝑇 → (𝑈‘𝐺) = if(𝐹 = 𝑁, 𝐺, ⦋𝐺 / 𝑔⦌𝑋)) |
4 | ifnefalse 4560 | . 2 ⊢ (𝐹 ≠ 𝑁 → if(𝐹 = 𝑁, 𝐺, ⦋𝐺 / 𝑔⦌𝑋) = ⦋𝐺 / 𝑔⦌𝑋) | |
5 | 3, 4 | sylan9eqr 2802 | 1 ⊢ ((𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) → (𝑈‘𝐺) = ⦋𝐺 / 𝑔⦌𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 ⦋csb 3921 ifcif 4548 ↦ cmpt 5249 ‘cfv 6568 ℩crio 7398 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5701 df-rel 5702 df-cnv 5703 df-co 5704 df-dm 5705 df-iota 6520 df-fun 6570 df-fv 6576 df-riota 7399 |
This theorem is referenced by: cdlemk43N 40913 cdlemk35u 40914 cdlemk55u1 40915 cdlemk39u1 40917 cdlemk19u1 40919 |
Copyright terms: Public domain | W3C validator |