Theorem permsetex 18491

Description: The set of permutations of a set 𝐴 exists. (Contributed by AV, 30-Mar-2024.)

Assertion

Ref	Expression
permsetex	⊢ (𝐴 ∈ 𝑉 → {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴} ∈ V)

Distinct variable group:   𝐴,𝑓

Allowed substitution hint:   𝑉(𝑓)

Proof of Theorem permsetex

Step	Hyp	Ref	Expression
1		mapex 8405	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) → {𝑓 ∣ 𝑓:𝐴⟶𝐴} ∈ V)
2	1	anidms 569	. 2 ⊢ (𝐴 ∈ 𝑉 → {𝑓 ∣ 𝑓:𝐴⟶𝐴} ∈ V)
3		f1of 6608	. . . 4 ⊢ (𝑓:𝐴–1-1-onto→𝐴 → 𝑓:𝐴⟶𝐴)
4	3	ss2abi 4036	. . 3 ⊢ {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴} ⊆ {𝑓 ∣ 𝑓:𝐴⟶𝐴}
5	4	a1i 11	. 2 ⊢ (𝐴 ∈ 𝑉 → {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴} ⊆ {𝑓 ∣ 𝑓:𝐴⟶𝐴})
6	2, 5	ssexd 5221	1 ⊢ (𝐴 ∈ 𝑉 → {𝑓 ∣ 𝑓:𝐴–1-1-onto→𝐴} ∈ V)

Syntax hints:   → wi 4   ∈ wcel 2113  {cab 2798  Vcvv 3491   ⊆ wss 3929  ⟶wf 6344  –1-1-onto→wf1o 6347

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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5323  ax-un 7454

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ral 3142  df-rex 3143  df-rab 3146  df-v 3493  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-nul 4285  df-if 4461  df-pw 4534  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5060  df-opab 5122  df-xp 5554  df-rel 5555  df-cnv 5556  df-dm 5558  df-rn 5559  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-f1o 6355

This theorem is referenced by:  symgbasex  18493  symgplusg  18504