Theorem pmtrmvd 19632

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 19631	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑇‘𝑃):𝐷⟶𝐷)
3		ffn 6697	. . 3 ⊢ ((𝑇‘𝑃):𝐷⟶𝐷 → (𝑇‘𝑃) Fn 𝐷)
4		fndifnfp 7169	. . 3 ⊢ ((𝑇‘𝑃) Fn 𝐷 → dom ((𝑇‘𝑃) ∖ I ) = {𝑧 ∈ 𝐷 ∣ ((𝑇‘𝑃)‘𝑧) ≠ 𝑧})
5	2, 3, 4	3syl 19	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → dom ((𝑇‘𝑃) ∖ I ) = {𝑧 ∈ 𝐷 ∣ ((𝑇‘𝑃)‘𝑧) ≠ 𝑧})
6	1	pmtrfv 19628	. . . . . 6 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝐷) → ((𝑇‘𝑃)‘𝑧) = if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧))
7	6	neeq1d 3014	. . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝐷) → (((𝑇‘𝑃)‘𝑧) ≠ 𝑧 ↔ if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧))
8		iffalse 4490	. . . . . . . 8 ⊢ (¬ 𝑧 ∈ 𝑃 → if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) = 𝑧)
9	8	necon1ai 2982	. . . . . . 7 ⊢ (if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) ≠ 𝑧 → 𝑧 ∈ 𝑃)
10		iftrue 4487	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝑃 → if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) = ∪ (𝑃 ∖ {𝑧}))
11	10	adantl 487	. . . . . . . . 9 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝑃) → if(𝑧 ∈ 𝑃, ∪ (𝑃 ∖ {𝑧}), 𝑧) = ∪ (𝑃 ∖ {𝑧}))
12		1onn 8627	. . . . . . . . . . 11 ⊢ 1o ∈ ω
13		simpl3 1212	. . . . . . . . . . . 12 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝑃) → 𝑃 ≈ 2o)
14		df-2o 8455	. . . . . . . . . . . 12 ⊢ 2o = suc 1o
15	13, 14	breqtrdi 5145	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝑃) → 𝑃 ≈ suc 1o)
16		simpr 490	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝑃) → 𝑧 ∈ 𝑃)
17		dif1ennn 9156	. . . . . . . . . . 11 ⊢ ((1o ∈ ω ∧ 𝑃 ≈ suc 1o ∧ 𝑧 ∈ 𝑃) → (𝑃 ∖ {𝑧}) ≈ 1o)
18	12, 15, 16, 17	mp3an2i 1495	. . . . . . . . . 10 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝑃) → (𝑃 ∖ {𝑧}) ≈ 1o)
19		en1uniel 9035	. . . . . . . . . 10 ⊢ ((𝑃 ∖ {𝑧}) ≈ 1o → ∪ (𝑃 ∖ {𝑧}) ∈ (𝑃 ∖ {𝑧}))
20		eldifsni 4752	. . . . . . . . . 10 ⊢ (∪ (𝑃 ∖ {𝑧}) ∈ (𝑃 ∖ {𝑧}) → ∪ (𝑃 ∖ {𝑧}) ≠ 𝑧)
21	18, 19, 20	3syl 19	. . . . . . . . 9 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝑧 ∈ 𝑃) → ∪ (𝑃 ∖ {𝑧}) ≠ 𝑧)
22	11, 21	eqnetrd 3022	. . . . . . . 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 3418	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → {𝑧 ∈ 𝐷 ∣ ((𝑇‘𝑃)‘𝑧) ≠ 𝑧} = {𝑧 ∈ 𝐷 ∣ 𝑧 ∈ 𝑃})
28		incom 4154	. . . 4 ⊢ (𝑃 ∩ 𝐷) = (𝐷 ∩ 𝑃)
29		dfin5 3906	. . . 4 ⊢ (𝐷 ∩ 𝑃) = {𝑧 ∈ 𝐷 ∣ 𝑧 ∈ 𝑃}
30	28, 29	eqtri 2783	. . 3 ⊢ (𝑃 ∩ 𝐷) = {𝑧 ∈ 𝐷 ∣ 𝑧 ∈ 𝑃}
31	27, 30	eqtr4di 2813	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → {𝑧 ∈ 𝐷 ∣ ((𝑇‘𝑃)‘𝑧) ≠ 𝑧} = (𝑃 ∩ 𝐷))
32		simp2 1155	. . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → 𝑃 ⊆ 𝐷)
33		dfss2 3916	. . 3 ⊢ (𝑃 ⊆ 𝐷 ↔ (𝑃 ∩ 𝐷) = 𝑃)
34	32, 33	sylib 221	. 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → (𝑃 ∩ 𝐷) = 𝑃)
35	5, 31, 34	3eqtrd 2799	1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) → dom ((𝑇‘𝑃) ∖ I ) = 𝑃)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  {crab 3412   ∖ cdif 3895   ∩ cin 3897   ⊆ wss 3898  ifcif 4481  {csn 4583  ∪ cuni 4866   class class class wbr 5102   I cid 5541  dom cdm 5647  suc csuc 6353   Fn wfn 6522  ⟶wf 6523  ‘cfv 6527  ωcom 7860  1_oc1o 8447  2_oc2o 8448   ≈ cen 8948  pmTrspcpmtr 19617

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 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-om 7861  df-1o 8454  df-2o 8455  df-en 8952  df-pmtr 19618

This theorem is used by:  pmtrfrn  19634  pmtrfb  19641  symggen  19646  pmtrdifellem2  19653  mdetralt  22885  mdetunilem7  22895  pmtrcnel  33584  pmtrcnel2  33585