Theorem pmtrrn 19443

Description: Transposing two points gives a transposition function. (Contributed by Stefan O'Rear, 22-Aug-2015.)

Hypotheses

Ref	Expression
pmtrrn.t	⊢ 𝑇 = (pmTrsp‘𝐷)
pmtrrn.r	⊢ 𝑅 = ran 𝑇

Assertion

Ref	Expression
pmtrrn	⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑇‘𝑃) ∈ 𝑅)

Proof of Theorem pmtrrn

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mptexg 7223	. . . . . . 7 ⊢ (𝐷 ∈ 𝑉 → (𝑦 ∈ 𝐷 ↦ if(𝑦 ∈ 𝑧, ∪ (𝑧 ∖ {𝑦}), 𝑦)) ∈ V)
2	1	ralrimivw 3137	. . . . . 6 ⊢ (𝐷 ∈ 𝑉 → ∀𝑧 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} (𝑦 ∈ 𝐷 ↦ if(𝑦 ∈ 𝑧, ∪ (𝑧 ∖ {𝑦}), 𝑦)) ∈ V)
3	2	3ad2ant1 1133	. . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → ∀𝑧 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} (𝑦 ∈ 𝐷 ↦ if(𝑦 ∈ 𝑧, ∪ (𝑧 ∖ {𝑦}), 𝑦)) ∈ V)
4		eqid 2734	. . . . . 6 ⊢ (𝑧 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↦ (𝑦 ∈ 𝐷 ↦ if(𝑦 ∈ 𝑧, ∪ (𝑧 ∖ {𝑦}), 𝑦))) = (𝑧 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↦ (𝑦 ∈ 𝐷 ↦ if(𝑦 ∈ 𝑧, ∪ (𝑧 ∖ {𝑦}), 𝑦)))
5	4	fnmpt 6688	. . . . 5 ⊢ (∀𝑧 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} (𝑦 ∈ 𝐷 ↦ if(𝑦 ∈ 𝑧, ∪ (𝑧 ∖ {𝑦}), 𝑦)) ∈ V → (𝑧 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↦ (𝑦 ∈ 𝐷 ↦ if(𝑦 ∈ 𝑧, ∪ (𝑧 ∖ {𝑦}), 𝑦))) Fn {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o})
6	3, 5	syl 17	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑧 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↦ (𝑦 ∈ 𝐷 ↦ if(𝑦 ∈ 𝑧, ∪ (𝑧 ∖ {𝑦}), 𝑦))) Fn {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o})
7		pmtrrn.t	. . . . . . 7 ⊢ 𝑇 = (pmTrsp‘𝐷)
8	7	pmtrfval 19436	. . . . . 6 ⊢ (𝐷 ∈ 𝑉 → 𝑇 = (𝑧 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↦ (𝑦 ∈ 𝐷 ↦ if(𝑦 ∈ 𝑧, ∪ (𝑧 ∖ {𝑦}), 𝑦))))
9	8	3ad2ant1 1133	. . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → 𝑇 = (𝑧 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↦ (𝑦 ∈ 𝐷 ↦ if(𝑦 ∈ 𝑧, ∪ (𝑧 ∖ {𝑦}), 𝑦))))
10	9	fneq1d 6641	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑇 Fn {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↔ (𝑧 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↦ (𝑦 ∈ 𝐷 ↦ if(𝑦 ∈ 𝑧, ∪ (𝑧 ∖ {𝑦}), 𝑦))) Fn {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o}))
11	6, 10	mpbird 257	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → 𝑇 Fn {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o})
12		breq1 5126	. . . 4 ⊢ (𝑥 = 𝑃 → (𝑥 ≈ 2o ↔ 𝑃 ≈ 2o))
13		elpw2g 5313	. . . . . 6 ⊢ (𝐷 ∈ 𝑉 → (𝑃 ∈ 𝒫 𝐷 ↔ 𝑃 ⊆ 𝐷))
14	13	biimpar 477	. . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷) → 𝑃 ∈ 𝒫 𝐷)
15	14	3adant3 1132	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → 𝑃 ∈ 𝒫 𝐷)
16		simp3 1138	. . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → 𝑃 ≈ 2o)
17	12, 15, 16	elrabd 3677	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → 𝑃 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o})
18		fnfvelrn 7080	. . 3 ⊢ ((𝑇 Fn {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ∧ 𝑃 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o}) → (𝑇‘𝑃) ∈ ran 𝑇)
19	11, 17, 18	syl2anc 584	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑇‘𝑃) ∈ ran 𝑇)
20		pmtrrn.r	. 2 ⊢ 𝑅 = ran 𝑇
21	19, 20	eleqtrrdi 2844	1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑇‘𝑃) ∈ 𝑅)

Syntax hints:   → wi 4   ∧ w3a 1086   = wceq 1539   ∈ wcel 2107  ∀wral 3050  {crab 3419  Vcvv 3463   ∖ cdif 3928   ⊆ wss 3931  ifcif 4505  𝒫 cpw 4580  {csn 4606  ∪ cuni 4887   class class class wbr 5123   ↦ cmpt 5205  ran crn 5666   Fn wfn 6536  ‘cfv 6541  2_oc2o 8482   ≈ cen 8964  pmTrspcpmtr 19427

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-rep 5259  ax-sep 5276  ax-nul 5286  ax-pow 5345  ax-pr 5412

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-reu 3364  df-rab 3420  df-v 3465  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4888  df-iun 4973  df-br 5124  df-opab 5186  df-mpt 5206  df-id 5558  df-xp 5671  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-rn 5676  df-res 5677  df-ima 5678  df-iota 6494  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-pmtr 19428

This theorem is referenced by:  pmtrfb  19451  symggen  19456  pmtr3ncom  19461  pmtrdifellem1  19462  mdetralt  22562  pmtrcnel  33048  pmtrcnel2  33049  fzo0pmtrlast  33051  pmtridf1o  33053  pmtrto1cl  33058  cyc3evpm  33109  cyc3genpmlem  33110  cyc3conja  33116