Theorem pmtrval 18974

Description: A generated transposition, expressed in a symmetric form. (Contributed by Stefan O'Rear, 16-Aug-2015.)

Hypothesis

Ref	Expression
pmtrfval.t	⊢ 𝑇 = (pmTrsp‘𝐷)

Assertion

Ref	Expression
pmtrval	⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑇‘𝑃) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)))

Distinct variable groups:   𝑧,𝐷   𝑧,𝑇   𝑧,𝑃   𝑧,𝑉

Proof of Theorem pmtrval

Dummy variables 𝑝 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pmtrfval.t	. . . . 5 ⊢ 𝑇 = (pmTrsp‘𝐷)
2	1	pmtrfval 18973	. . . 4 ⊢ (𝐷 ∈ 𝑉 → 𝑇 = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))))
3	2	fveq1d 6758	. . 3 ⊢ (𝐷 ∈ 𝑉 → (𝑇‘𝑃) = ((𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))‘𝑃))
4	3	3ad2ant1 1131	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑇‘𝑃) = ((𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))‘𝑃))
5		eqid 2738	. . 3 ⊢ (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧))) = (𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))
6		eleq2 2827	. . . . 5 ⊢ (𝑝 = 𝑃 → (𝑧 ∈ 𝑝 ↔ 𝑧 ∈ 𝑃))
7		difeq1 4046	. . . . . 6 ⊢ (𝑝 = 𝑃 → (𝑝 ∖ {𝑧}) = (𝑃 ∖ {𝑧}))
8	7	unieqd 4850	. . . . 5 ⊢ (𝑝 = 𝑃 → ∪ (𝑝 ∖ {𝑧}) = ∪ (𝑃 ∖ {𝑧}))
9	6, 8	ifbieq1d 4480	. . . 4 ⊢ (𝑝 = 𝑃 → if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧) = if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧))
10	9	mpteq2dv 5172	. . 3 ⊢ (𝑝 = 𝑃 → (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)))
11		breq1 5073	. . . 4 ⊢ (𝑦 = 𝑃 → (𝑦 ≈ 2o ↔ 𝑃 ≈ 2o))
12		elpw2g 5263	. . . . . 6 ⊢ (𝐷 ∈ 𝑉 → (𝑃 ∈ 𝒫 𝐷 ↔ 𝑃 ⊆ 𝐷))
13	12	biimpar 477	. . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷) → 𝑃 ∈ 𝒫 𝐷)
14	13	3adant3 1130	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → 𝑃 ∈ 𝒫 𝐷)
15		simp3 1136	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → 𝑃 ≈ 2o)
16	11, 14, 15	elrabd 3619	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → 𝑃 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o})
17		mptexg 7079	. . . 4 ⊢ (𝐷 ∈ 𝑉 → (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)) ∈ V)
18	17	3ad2ant1 1131	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)) ∈ V)
19	5, 10, 16, 18	fvmptd3 6880	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → ((𝑝 ∈ {𝑦 ∈ 𝒫 𝐷 ∣ 𝑦 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑝, ∪ (𝑝 ∖ {𝑧}), 𝑧)))‘𝑃) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)))
20	4, 19	eqtrd 2778	1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑇‘𝑃) = (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧)))

Syntax hints:   → wi 4   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  {crab 3067  Vcvv 3422   ∖ cdif 3880   ⊆ wss 3883  ifcif 4456  𝒫 cpw 4530  {csn 4558  ∪ cuni 4836   class class class wbr 5070   ↦ cmpt 5153  ‘cfv 6418  2_oc2o 8261   ≈ cen 8688  pmTrspcpmtr 18964

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-pmtr 18965

This theorem is referenced by:  pmtrfv  18975  pmtrf  18978  cycpm2tr  31288  trsp2cyc  31292