MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pmtrfval Structured version   Visualization version   GIF version

Theorem pmtrfval 19644
Description: The function generating transpositions on a set. (Contributed by Stefan O'Rear, 16-Aug-2015.)
Hypothesis
Ref Expression
pmtrfval.t 𝑇 = (pmTrsp‘𝐷)
Assertion
Ref Expression
pmtrfval (𝐷 ∈ 𝑉 → 𝑇 = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
Distinct variable groups:   𝑦,𝑝,𝑧,𝐷   𝑇,𝑝,𝑦,𝑧   𝑧,𝑉
Allowed substitution hints:   𝑉(𝑦, 𝑝)

Proof of Theorem pmtrfval
Dummy variable 𝑑 is distinct from all other variables.
StepHypRef Expression
1 pmtrfval.t . 2 𝑇 = (pmTrsp‘𝐷)
2 elex 3472 . . 3 (𝐷 ∈ 𝑉 → 𝐷 ∈ V)
3 pweq 4571 . . . . . 6 (𝑑 = 𝐷 → 𝒫 𝑑 = 𝒫 𝐷)
43rabeqdv 3428 . . . . 5 (𝑑 = 𝐷 → {𝑦 ∈ 𝒫 𝑑 ∣ 𝑦 ≈ 2o} = {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o})
5 mpteq1 5194 . . . . 5 (𝑑 = 𝐷 → (𝑧 ∈ 𝑑 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
64, 5mpteq12dv 5192 . . . 4 (𝑑 = 𝐷 → (𝑝 ∈ {𝑦 ∈ 𝒫 𝑑 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝑑 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
7 df-pmtr 19636 . . . 4 pmTrsp = (𝑑 ∈ V ↦ (𝑝 ∈ {𝑦 ∈ 𝒫 𝑑 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝑑 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
8 vpwex 5339 . . . . 5 𝒫 𝑑 ∈ V
98mptrabex 7223 . . . 4 (𝑝 ∈ {𝑦 ∈ 𝒫 𝑑 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝑑 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) ∈ V
106, 7, 9fvmpt3i 6991 . . 3 (𝐷 ∈ V → (pmTrsp‘𝐷) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
112, 10syl 18 . 2 (𝐷 ∈ 𝑉 → (pmTrsp‘𝐷) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
121, 11eqtrid 2808 1 (𝐷 ∈ 𝑉 → 𝑇 = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451   ∖ cdif 3896  ifcif 4482  𝒫 cpw 4557  {csn 4584  ∪ cuni 4867   class class class wbr 5103   ↦ cmpt 5186  ‘cfv 6531  2oc2o 8454   ≈ cen 8954  pmTrspcpmtr 19635
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-pmtr 19636
This theorem is used by:  pmtrval  19645  pmtrrn  19651  pmtrfrn  19652  pmtrprfval  19681  pmtrsn  19713  trsp2cyc  33666
  Copyright terms: Public domain W3C validator