Theorem cdlemk40t 42241

Description: TODO: fix comment. (Contributed by NM, 31-Jul-2013.)

Hypotheses

Ref	Expression
cdlemk40.x	⊢ 𝑋 = (℩𝑧 ∈ 𝑇 𝜑)
cdlemk40.u	⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋))

Assertion

Ref	Expression
cdlemk40t	⊢ ((𝐹 = 𝑁 ∧ 𝐺 ∈ 𝑇) → (𝑈‘𝐺) = 𝐺)

Distinct variable groups:   𝑔,𝐹   𝑔,𝑁   𝑇,𝑔

Allowed substitution hints:   𝜑(𝑧, 𝑔)   𝑇(𝑧)   𝑈(𝑧, 𝑔)   𝐹(𝑧)   𝐺(𝑧, 𝑔)   𝑁(𝑧)   𝑋(𝑧, 𝑔)

Proof of Theorem cdlemk40t

Step	Hyp	Ref	Expression
1		cdlemk40.x	. . 3 ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 𝜑)
2		cdlemk40.u	. . 3 ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋))
3	1, 2	cdlemk40 42240	. 2 ⊢ (𝐺 ∈ 𝑇 → (𝑈‘𝐺) = if(𝐹 = 𝑁, 𝐺, ⦋𝐺 / 𝑔⦌𝑋))
4		iftrue 4491	. 2 ⊢ (𝐹 = 𝑁 → if(𝐹 = 𝑁, 𝐺, ⦋𝐺 / 𝑔⦌𝑋) = 𝐺)
5	3, 4	sylan9eqr 2820	1 ⊢ ((𝐹 = 𝑁 ∧ 𝐺 ∈ 𝑇) → (𝑈‘𝐺) = 𝐺)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ⦋csb 3851  ifcif 4485   ↦ cmpt 5192  ‘cfv 6566  ℩crio 7407

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-riota 7408

This theorem is used by:  cdlemk35u  42287  cdlemk55u  42289  cdlemk39u  42291  cdlemk19u  42293