Theorem pmtrmvd 19700

Description: A transposition moves precisely the transposed points. (Contributed by Stefan O'Rear, 16-Aug-2015.)

Hypothesis

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

Assertion

Ref	Expression
pmtrmvd	⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → dom ((𝑇‘𝑃) ∖ I ) = 𝑃)

Proof of Theorem pmtrmvd

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		pmtrfval.t	. . . 4 ⊢ 𝑇 = (pmTrsp‘𝐷)
2	1	pmtrf 19699	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑇‘𝑃):𝐷⟶𝐷)
3		ffn 6731	. . 3 ⊢ ((𝑇‘𝑃):𝐷⟶𝐷 → (𝑇‘𝑃) Fn 𝐷)
4		fndifnfp 7204	. . 3 ⊢ ((𝑇‘𝑃) Fn 𝐷 → dom ((𝑇‘𝑃) ∖ I ) = {𝑧 ∈ 𝐷 ∣ ((𝑇‘𝑃)‘𝑧) ≠ 𝑧})
5	2, 3, 4	3syl 19	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → dom ((𝑇‘𝑃) ∖ I ) = {𝑧 ∈ 𝐷 ∣ ((𝑇‘𝑃)‘𝑧) ≠ 𝑧})
6	1	pmtrfv 19696	. . . . . 6 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝐷) → ((𝑇‘𝑃)‘𝑧) = if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧))
7	6	neeq1d 3018	. . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝐷) → (((𝑇‘𝑃)‘𝑧) ≠ 𝑧 ↔ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧))
8		iffalse 4494	. . . . . . . 8 ⊢ (¬ 𝑧 ∈ 𝑃 → if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) = 𝑧)
9	8	necon1ai 2986	. . . . . . 7 ⊢ (if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧 → 𝑧 ∈ 𝑃)
10		iftrue 4491	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝑃 → if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) = ∪ (𝑃 ∖ {𝑧}))
11	10	adantl 487	. . . . . . . . 9 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝑃) → if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) = ∪ (𝑃 ∖ {𝑧}))
12		1onn 8677	. . . . . . . . . . 11 ⊢ 1o ∈ ω
13		simpl3 1212	. . . . . . . . . . . 12 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝑃) → 𝑃 ≈ 2o)
14		df-2o 8505	. . . . . . . . . . . 12 ⊢ 2o = suc 1o
15	13, 14	breqtrdi 5149	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝑃) → 𝑃 ≈ suc 1o)
16		simpr 490	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝑃) → 𝑧 ∈ 𝑃)
17		dif1ennn 9206	. . . . . . . . . . 11 ⊢ ((1o ∈ ω ∧ 𝑃 ≈ suc 1o ∧ 𝑧 ∈ 𝑃) → (𝑃 ∖ {𝑧}) ≈ 1o)
18	12, 15, 16, 17	mp3an2i 1496	. . . . . . . . . 10 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝑃) → (𝑃 ∖ {𝑧}) ≈ 1o)
19		en1uniel 9085	. . . . . . . . . 10 ⊢ ((𝑃 ∖ {𝑧}) ≈ 1o → ∪ (𝑃 ∖ {𝑧}) ∈ (𝑃 ∖ {𝑧}))
20		eldifsni 4753	. . . . . . . . . 10 ⊢ (∪ (𝑃 ∖ {𝑧}) ∈ (𝑃 ∖ {𝑧}) → ∪ (𝑃 ∖ {𝑧}) ≠ 𝑧)
21	18, 19, 20	3syl 19	. . . . . . . . 9 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝑃) → ∪ (𝑃 ∖ {𝑧}) ≠ 𝑧)
22	11, 21	eqnetrd 3026	. . . . . . . 8 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝑃) → if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧)
23	22	ex 418	. . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑧 ∈ 𝑃 → if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧))
24	9, 23	impbid2 229	. . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧 ↔ 𝑧 ∈ 𝑃))
25	24	adantr 486	. . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝐷) → (if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧 ↔ 𝑧 ∈ 𝑃))
26	7, 25	bitrd 282	. . . 4 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝐷) → (((𝑇‘𝑃)‘𝑧) ≠ 𝑧 ↔ 𝑧 ∈ 𝑃))
27	26	rabbidva 3422	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → {𝑧 ∈ 𝐷 ∣ ((𝑇‘𝑃)‘𝑧) ≠ 𝑧} = {𝑧 ∈ 𝐷 ∣ 𝑧 ∈ 𝑃})
28		incom 4109	. . . 4 ⊢ (𝑃 ∩ 𝐷) = (𝐷 ∩ 𝑃)
29		dfin5 4095	. . . 4 ⊢ (𝐷 ∩ 𝑃) = {𝑧 ∈ 𝐷 ∣ 𝑧 ∈ 𝑃}
30	28, 29	eqtri 2786	. . 3 ⊢ (𝑃 ∩ 𝐷) = {𝑧 ∈ 𝐷 ∣ 𝑧 ∈ 𝑃}
31	27, 30	eqtr4di 2816	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → {𝑧 ∈ 𝐷 ∣ ((𝑇‘𝑃)‘𝑧) ≠ 𝑧} = (𝑃 ∩ 𝐷))
32		simp2 1155	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → 𝑃 ⊆ 𝐷)
33		dfss2 4097	. . 3 ⊢ (𝑃 ⊆ 𝐷 ↔ (𝑃 ∩ 𝐷) = 𝑃)
34	32, 33	sylib 221	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑃 ∩ 𝐷) = 𝑃)
35	5, 31, 34	3eqtrd 2802	1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → dom ((𝑇‘𝑃) ∖ I ) = 𝑃)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  {crab 3416   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092  ifcif 4485  {csn 4588  ∪ cuni 4870   class class class wbr 5106   I cid 5549  dom cdm 5655  suc csuc 6382   Fn wfn 6553  ⟶wf 6554  ‘cfv 6558  ωcom 7901  1_oc1o 8497  2_oc2o 8498   ≈ cen 8998  pmTrspcpmtr 19685

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-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-om 7902  df-1o 8504  df-2o 8505  df-en 9002  df-pmtr 19686

This theorem is used by:  pmtrfrn  19702  pmtrfb  19709  symggen  19714  pmtrdifellem2  19721  mdetralt  22953  mdetunilem7  22963  pmtrcnel  33720  pmtrcnel2  33721