Theorem pmtrfrn 19388

Description: A transposition (as a kind of function) is the function transposing the two points it moves. (Contributed by Stefan O'Rear, 22-Aug-2015.)

Hypotheses

Ref	Expression
pmtrrn.t	⊢ 𝑇 = (pmTrsp‘𝐷)
pmtrrn.r	⊢ 𝑅 = ran 𝑇
pmtrfrn.p	⊢ 𝑃 = dom (𝐹 ∖ I )

Assertion

Ref	Expression
pmtrfrn	⊢ (𝐹 ∈ 𝑅 → ((𝐷 ∈ V ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝐹 = (𝑇‘𝑃)))

Proof of Theorem pmtrfrn

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

Step	Hyp	Ref	Expression
1		noel 4301	. . . 4 ⊢ ¬ 𝐹 ∈ ∅
2		pmtrrn.r	. . . . . 6 ⊢ 𝑅 = ran 𝑇
3		pmtrrn.t	. . . . . . 7 ⊢ 𝑇 = (pmTrsp‘𝐷)
4	3	rnfvprc 6852	. . . . . 6 ⊢ (¬ 𝐷 ∈ V → ran 𝑇 = ∅)
5	2, 4	eqtrid 2776	. . . . 5 ⊢ (¬ 𝐷 ∈ V → 𝑅 = ∅)
6	5	eleq2d 2814	. . . 4 ⊢ (¬ 𝐷 ∈ V → (𝐹 ∈ 𝑅 ↔ 𝐹 ∈ ∅))
7	1, 6	mtbiri 327	. . 3 ⊢ (¬ 𝐷 ∈ V → ¬ 𝐹 ∈ 𝑅)
8	7	con4i 114	. 2 ⊢ (𝐹 ∈ 𝑅 → 𝐷 ∈ V)
9		mptexg 7195	. . . . . . . 8 ⊢ (𝐷 ∈ V → (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑤, ∪ (𝑤 ∖ {𝑧}), 𝑧)) ∈ V)
10	9	ralrimivw 3129	. . . . . . 7 ⊢ (𝐷 ∈ V → ∀𝑤 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑤, ∪ (𝑤 ∖ {𝑧}), 𝑧)) ∈ V)
11		eqid 2729	. . . . . . . 8 ⊢ (𝑤 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑤, ∪ (𝑤 ∖ {𝑧}), 𝑧))) = (𝑤 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑤, ∪ (𝑤 ∖ {𝑧}), 𝑧)))
12	11	fnmpt 6658	. . . . . . 7 ⊢ (∀𝑤 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑤, ∪ (𝑤 ∖ {𝑧}), 𝑧)) ∈ V → (𝑤 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑤, ∪ (𝑤 ∖ {𝑧}), 𝑧))) Fn {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o})
13	10, 12	syl 17	. . . . . 6 ⊢ (𝐷 ∈ V → (𝑤 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑤, ∪ (𝑤 ∖ {𝑧}), 𝑧))) Fn {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o})
14	3	pmtrfval 19380	. . . . . . 7 ⊢ (𝐷 ∈ V → 𝑇 = (𝑤 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑤, ∪ (𝑤 ∖ {𝑧}), 𝑧))))
15	14	fneq1d 6611	. . . . . 6 ⊢ (𝐷 ∈ V → (𝑇 Fn {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↔ (𝑤 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 ∈ 𝑤, ∪ (𝑤 ∖ {𝑧}), 𝑧))) Fn {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o}))
16	13, 15	mpbird 257	. . . . 5 ⊢ (𝐷 ∈ V → 𝑇 Fn {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o})
17		fvelrnb 6921	. . . . 5 ⊢ (𝑇 Fn {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} → (𝐹 ∈ ran 𝑇 ↔ ∃𝑦 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} (𝑇‘𝑦) = 𝐹))
18	16, 17	syl 17	. . . 4 ⊢ (𝐷 ∈ V → (𝐹 ∈ ran 𝑇 ↔ ∃𝑦 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} (𝑇‘𝑦) = 𝐹))
19	2	eleq2i 2820	. . . 4 ⊢ (𝐹 ∈ 𝑅 ↔ 𝐹 ∈ ran 𝑇)
20		breq1 5110	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ≈ 2o ↔ 𝑦 ≈ 2o))
21	20	rexrab 3667	. . . . 5 ⊢ (∃𝑦 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} (𝑇‘𝑦) = 𝐹 ↔ ∃𝑦 ∈ 𝒫 𝐷(𝑦 ≈ 2o ∧ (𝑇‘𝑦) = 𝐹))
22	21	bicomi 224	. . . 4 ⊢ (∃𝑦 ∈ 𝒫 𝐷(𝑦 ≈ 2o ∧ (𝑇‘𝑦) = 𝐹) ↔ ∃𝑦 ∈ {𝑥 ∈ 𝒫 𝐷 ∣ 𝑥 ≈ 2o} (𝑇‘𝑦) = 𝐹)
23	18, 19, 22	3bitr4g 314	. . 3 ⊢ (𝐷 ∈ V → (𝐹 ∈ 𝑅 ↔ ∃𝑦 ∈ 𝒫 𝐷(𝑦 ≈ 2o ∧ (𝑇‘𝑦) = 𝐹)))
24		elpwi 4570	. . . . 5 ⊢ (𝑦 ∈ 𝒫 𝐷 → 𝑦 ⊆ 𝐷)
25		simp1 1136	. . . . . . . . . 10 ⊢ ((𝐷 ∈ V ∧ 𝑦 ⊆ 𝐷 ∧ 𝑦 ≈ 2o) → 𝐷 ∈ V)
26	3	pmtrmvd 19386	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ V ∧ 𝑦 ⊆ 𝐷 ∧ 𝑦 ≈ 2o) → dom ((𝑇‘𝑦) ∖ I ) = 𝑦)
27		simp2 1137	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ V ∧ 𝑦 ⊆ 𝐷 ∧ 𝑦 ≈ 2o) → 𝑦 ⊆ 𝐷)
28	26, 27	eqsstrd 3981	. . . . . . . . . 10 ⊢ ((𝐷 ∈ V ∧ 𝑦 ⊆ 𝐷 ∧ 𝑦 ≈ 2o) → dom ((𝑇‘𝑦) ∖ I ) ⊆ 𝐷)
29		simp3 1138	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ V ∧ 𝑦 ⊆ 𝐷 ∧ 𝑦 ≈ 2o) → 𝑦 ≈ 2o)
30	26, 29	eqbrtrd 5129	. . . . . . . . . 10 ⊢ ((𝐷 ∈ V ∧ 𝑦 ⊆ 𝐷 ∧ 𝑦 ≈ 2o) → dom ((𝑇‘𝑦) ∖ I ) ≈ 2o)
31	25, 28, 30	3jca 1128	. . . . . . . . 9 ⊢ ((𝐷 ∈ V ∧ 𝑦 ⊆ 𝐷 ∧ 𝑦 ≈ 2o) → (𝐷 ∈ V ∧ dom ((𝑇‘𝑦) ∖ I ) ⊆ 𝐷 ∧ dom ((𝑇‘𝑦) ∖ I ) ≈ 2o))
32	26	eqcomd 2735	. . . . . . . . . 10 ⊢ ((𝐷 ∈ V ∧ 𝑦 ⊆ 𝐷 ∧ 𝑦 ≈ 2o) → 𝑦 = dom ((𝑇‘𝑦) ∖ I ))
33	32	fveq2d 6862	. . . . . . . . 9 ⊢ ((𝐷 ∈ V ∧ 𝑦 ⊆ 𝐷 ∧ 𝑦 ≈ 2o) → (𝑇‘𝑦) = (𝑇‘dom ((𝑇‘𝑦) ∖ I )))
34	31, 33	jca 511	. . . . . . . 8 ⊢ ((𝐷 ∈ V ∧ 𝑦 ⊆ 𝐷 ∧ 𝑦 ≈ 2o) → ((𝐷 ∈ V ∧ dom ((𝑇‘𝑦) ∖ I ) ⊆ 𝐷 ∧ dom ((𝑇‘𝑦) ∖ I ) ≈ 2o) ∧ (𝑇‘𝑦) = (𝑇‘dom ((𝑇‘𝑦) ∖ I ))))
35		difeq1 4082	. . . . . . . . . . 11 ⊢ ((𝑇‘𝑦) = 𝐹 → ((𝑇‘𝑦) ∖ I ) = (𝐹 ∖ I ))
36	35	dmeqd 5869	. . . . . . . . . 10 ⊢ ((𝑇‘𝑦) = 𝐹 → dom ((𝑇‘𝑦) ∖ I ) = dom (𝐹 ∖ I ))
37		pmtrfrn.p	. . . . . . . . . 10 ⊢ 𝑃 = dom (𝐹 ∖ I )
38	36, 37	eqtr4di 2782	. . . . . . . . 9 ⊢ ((𝑇‘𝑦) = 𝐹 → dom ((𝑇‘𝑦) ∖ I ) = 𝑃)
39		sseq1 3972	. . . . . . . . . . . 12 ⊢ (dom ((𝑇‘𝑦) ∖ I ) = 𝑃 → (dom ((𝑇‘𝑦) ∖ I ) ⊆ 𝐷 ↔ 𝑃 ⊆ 𝐷))
40		breq1 5110	. . . . . . . . . . . 12 ⊢ (dom ((𝑇‘𝑦) ∖ I ) = 𝑃 → (dom ((𝑇‘𝑦) ∖ I ) ≈ 2o ↔ 𝑃 ≈ 2o))
41	39, 40	3anbi23d 1441	. . . . . . . . . . 11 ⊢ (dom ((𝑇‘𝑦) ∖ I ) = 𝑃 → ((𝐷 ∈ V ∧ dom ((𝑇‘𝑦) ∖ I ) ⊆ 𝐷 ∧ dom ((𝑇‘𝑦) ∖ I ) ≈ 2o) ↔ (𝐷 ∈ V ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o)))
42	41	adantl 481	. . . . . . . . . 10 ⊢ (((𝑇‘𝑦) = 𝐹 ∧ dom ((𝑇‘𝑦) ∖ I ) = 𝑃) → ((𝐷 ∈ V ∧ dom ((𝑇‘𝑦) ∖ I ) ⊆ 𝐷 ∧ dom ((𝑇‘𝑦) ∖ I ) ≈ 2o) ↔ (𝐷 ∈ V ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o)))
43		simpl 482	. . . . . . . . . . 11 ⊢ (((𝑇‘𝑦) = 𝐹 ∧ dom ((𝑇‘𝑦) ∖ I ) = 𝑃) → (𝑇‘𝑦) = 𝐹)
44		fveq2 6858	. . . . . . . . . . . 12 ⊢ (dom ((𝑇‘𝑦) ∖ I ) = 𝑃 → (𝑇‘dom ((𝑇‘𝑦) ∖ I )) = (𝑇‘𝑃))
45	44	adantl 481	. . . . . . . . . . 11 ⊢ (((𝑇‘𝑦) = 𝐹 ∧ dom ((𝑇‘𝑦) ∖ I ) = 𝑃) → (𝑇‘dom ((𝑇‘𝑦) ∖ I )) = (𝑇‘𝑃))
46	43, 45	eqeq12d 2745	. . . . . . . . . 10 ⊢ (((𝑇‘𝑦) = 𝐹 ∧ dom ((𝑇‘𝑦) ∖ I ) = 𝑃) → ((𝑇‘𝑦) = (𝑇‘dom ((𝑇‘𝑦) ∖ I )) ↔ 𝐹 = (𝑇‘𝑃)))
47	42, 46	anbi12d 632	. . . . . . . . 9 ⊢ (((𝑇‘𝑦) = 𝐹 ∧ dom ((𝑇‘𝑦) ∖ I ) = 𝑃) → (((𝐷 ∈ V ∧ dom ((𝑇‘𝑦) ∖ I ) ⊆ 𝐷 ∧ dom ((𝑇‘𝑦) ∖ I ) ≈ 2o) ∧ (𝑇‘𝑦) = (𝑇‘dom ((𝑇‘𝑦) ∖ I ))) ↔ ((𝐷 ∈ V ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝐹 = (𝑇‘𝑃))))
48	38, 47	mpdan 687	. . . . . . . 8 ⊢ ((𝑇‘𝑦) = 𝐹 → (((𝐷 ∈ V ∧ dom ((𝑇‘𝑦) ∖ I ) ⊆ 𝐷 ∧ dom ((𝑇‘𝑦) ∖ I ) ≈ 2o) ∧ (𝑇‘𝑦) = (𝑇‘dom ((𝑇‘𝑦) ∖ I ))) ↔ ((𝐷 ∈ V ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝐹 = (𝑇‘𝑃))))
49	34, 48	syl5ibcom 245	. . . . . . 7 ⊢ ((𝐷 ∈ V ∧ 𝑦 ⊆ 𝐷 ∧ 𝑦 ≈ 2o) → ((𝑇‘𝑦) = 𝐹 → ((𝐷 ∈ V ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝐹 = (𝑇‘𝑃))))
50	49	3exp 1119	. . . . . 6 ⊢ (𝐷 ∈ V → (𝑦 ⊆ 𝐷 → (𝑦 ≈ 2o → ((𝑇‘𝑦) = 𝐹 → ((𝐷 ∈ V ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝐹 = (𝑇‘𝑃))))))
51	50	imp4a 422	. . . . 5 ⊢ (𝐷 ∈ V → (𝑦 ⊆ 𝐷 → ((𝑦 ≈ 2o ∧ (𝑇‘𝑦) = 𝐹) → ((𝐷 ∈ V ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝐹 = (𝑇‘𝑃)))))
52	24, 51	syl5 34	. . . 4 ⊢ (𝐷 ∈ V → (𝑦 ∈ 𝒫 𝐷 → ((𝑦 ≈ 2o ∧ (𝑇‘𝑦) = 𝐹) → ((𝐷 ∈ V ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝐹 = (𝑇‘𝑃)))))
53	52	rexlimdv 3132	. . 3 ⊢ (𝐷 ∈ V → (∃𝑦 ∈ 𝒫 𝐷(𝑦 ≈ 2o ∧ (𝑇‘𝑦) = 𝐹) → ((𝐷 ∈ V ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝐹 = (𝑇‘𝑃))))
54	23, 53	sylbid 240	. 2 ⊢ (𝐷 ∈ V → (𝐹 ∈ 𝑅 → ((𝐷 ∈ V ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝐹 = (𝑇‘𝑃))))
55	8, 54	mpcom 38	1 ⊢ (𝐹 ∈ 𝑅 → ((𝐷 ∈ V ∧ 𝑃 ⊆ 𝐷 ∧ 𝑃 ≈ 2o) ∧ 𝐹 = (𝑇‘𝑃)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∃wrex 3053  {crab 3405  Vcvv 3447   ∖ cdif 3911   ⊆ wss 3914  ∅c0 4296  ifcif 4488  𝒫 cpw 4563  {csn 4589  ∪ cuni 4871   class class class wbr 5107   ↦ cmpt 5188   I cid 5532  dom cdm 5638  ran crn 5639   Fn wfn 6506  ‘cfv 6511  2_oc2o 8428   ≈ cen 8915  pmTrspcpmtr 19371

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-om 7843  df-1o 8434  df-2o 8435  df-en 8919  df-pmtr 19372

This theorem is referenced by:  pmtrffv  19389  pmtrrn2  19390  pmtrfinv  19391  pmtrfmvdn0  19392  pmtrff1o  19393  pmtrfcnv  19394  pmtrfb  19395