Theorem f1omvdmvd 19380

Description: A permutation of any class moves a point which is moved to a different point which is moved. (Contributed by Stefan O'Rear, 22-Aug-2015.)

Assertion

Ref	Expression
f1omvdmvd	⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → (𝐹‘𝑋) ∈ (dom (𝐹 ∖ I ) ∖ {𝑋}))

Proof of Theorem f1omvdmvd

Step	Hyp	Ref	Expression
1		simpr 484	. . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → 𝑋 ∈ dom (𝐹 ∖ I ))
2		f1ofn 6804	. . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐴 → 𝐹 Fn 𝐴)
3		difss 4102	. . . . . . . . 9 ⊢ (𝐹 ∖ I ) ⊆ 𝐹
4		dmss 5869	. . . . . . . . 9 ⊢ ((𝐹 ∖ I ) ⊆ 𝐹 → dom (𝐹 ∖ I ) ⊆ dom 𝐹)
5	3, 4	ax-mp 5	. . . . . . . 8 ⊢ dom (𝐹 ∖ I ) ⊆ dom 𝐹
6		f1odm 6807	. . . . . . . 8 ⊢ (𝐹:𝐴–1-1-onto→𝐴 → dom 𝐹 = 𝐴)
7	5, 6	sseqtrid 3992	. . . . . . 7 ⊢ (𝐹:𝐴–1-1-onto→𝐴 → dom (𝐹 ∖ I ) ⊆ 𝐴)
8	7	sselda 3949	. . . . . 6 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → 𝑋 ∈ 𝐴)
9		fnelnfp 7154	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑋 ∈ dom (𝐹 ∖ I ) ↔ (𝐹‘𝑋) ≠ 𝑋))
10	2, 8, 9	syl2an2r 685	. . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → (𝑋 ∈ dom (𝐹 ∖ I ) ↔ (𝐹‘𝑋) ≠ 𝑋))
11	1, 10	mpbid 232	. . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → (𝐹‘𝑋) ≠ 𝑋)
12		f1of1 6802	. . . . . . 7 ⊢ (𝐹:𝐴–1-1-onto→𝐴 → 𝐹:𝐴–1-1→𝐴)
13	12	adantr 480	. . . . . 6 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → 𝐹:𝐴–1-1→𝐴)
14		f1of 6803	. . . . . . . 8 ⊢ (𝐹:𝐴–1-1-onto→𝐴 → 𝐹:𝐴⟶𝐴)
15	14	adantr 480	. . . . . . 7 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → 𝐹:𝐴⟶𝐴)
16	15, 8	ffvelcdmd 7060	. . . . . 6 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → (𝐹‘𝑋) ∈ 𝐴)
17		f1fveq 7240	. . . . . 6 ⊢ ((𝐹:𝐴–1-1→𝐴 ∧ ((𝐹‘𝑋) ∈ 𝐴 ∧ 𝑋 ∈ 𝐴)) → ((𝐹‘(𝐹‘𝑋)) = (𝐹‘𝑋) ↔ (𝐹‘𝑋) = 𝑋))
18	13, 16, 8, 17	syl12anc 836	. . . . 5 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → ((𝐹‘(𝐹‘𝑋)) = (𝐹‘𝑋) ↔ (𝐹‘𝑋) = 𝑋))
19	18	necon3bid 2970	. . . 4 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → ((𝐹‘(𝐹‘𝑋)) ≠ (𝐹‘𝑋) ↔ (𝐹‘𝑋) ≠ 𝑋))
20	11, 19	mpbird 257	. . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → (𝐹‘(𝐹‘𝑋)) ≠ (𝐹‘𝑋))
21		fnelnfp 7154	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ (𝐹‘𝑋) ∈ 𝐴) → ((𝐹‘𝑋) ∈ dom (𝐹 ∖ I ) ↔ (𝐹‘(𝐹‘𝑋)) ≠ (𝐹‘𝑋)))
22	2, 16, 21	syl2an2r 685	. . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → ((𝐹‘𝑋) ∈ dom (𝐹 ∖ I ) ↔ (𝐹‘(𝐹‘𝑋)) ≠ (𝐹‘𝑋)))
23	20, 22	mpbird 257	. 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → (𝐹‘𝑋) ∈ dom (𝐹 ∖ I ))
24		eldifsn 4753	. 2 ⊢ ((𝐹‘𝑋) ∈ (dom (𝐹 ∖ I ) ∖ {𝑋}) ↔ ((𝐹‘𝑋) ∈ dom (𝐹 ∖ I ) ∧ (𝐹‘𝑋) ≠ 𝑋))
25	23, 11, 24	sylanbrc 583	1 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑋 ∈ dom (𝐹 ∖ I )) → (𝐹‘𝑋) ∈ (dom (𝐹 ∖ I ) ∖ {𝑋}))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109   ≠ wne 2926   ∖ cdif 3914   ⊆ wss 3917  {csn 4592   I cid 5535  dom cdm 5641   Fn wfn 6509  ⟶wf 6510  –1-1→wf1 6511  –1-1-onto→wf1o 6513  ‘cfv 6514

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 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-f1o 6521  df-fv 6522

This theorem is referenced by:  f1otrspeq  19384  symggen  19407  pmtrcnel  33053  pmtrcnelor  33055