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 38927 | . 2 ⊢ (𝐺 ∈ 𝑇 → (𝑈‘𝐺) = if(𝐹 = 𝑁, 𝐺, ⦋𝐺 / 𝑔⦌𝑋)) |
4 | ifnefalse 4477 | . 2 ⊢ (𝐹 ≠ 𝑁 → if(𝐹 = 𝑁, 𝐺, ⦋𝐺 / 𝑔⦌𝑋) = ⦋𝐺 / 𝑔⦌𝑋) | |
5 | 3, 4 | sylan9eqr 2802 | 1 ⊢ ((𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) → (𝑈‘𝐺) = ⦋𝐺 / 𝑔⦌𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1542 ∈ wcel 2110 ≠ wne 2945 ⦋csb 3837 ifcif 4465 ↦ cmpt 5162 ‘cfv 6432 ℩crio 7227 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-sep 5227 ax-nul 5234 ax-pr 5356 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ne 2946 df-ral 3071 df-rex 3072 df-rab 3075 df-v 3433 df-sbc 3721 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-br 5080 df-opab 5142 df-mpt 5163 df-id 5490 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-iota 6390 df-fun 6434 df-fv 6440 df-riota 7228 |
This theorem is referenced by: cdlemk43N 38973 cdlemk35u 38974 cdlemk55u1 38975 cdlemk39u1 38977 cdlemk19u1 38979 |
Copyright terms: Public domain | W3C validator |