Theorem pautsetN 41155

Description: The set of projective automorphisms. (Contributed by NM, 26-Jan-2012.) (New usage is discouraged.)

Hypotheses

Ref	Expression
pautset.s	⊢ 𝑆 = (PSubSp‘𝐾)
pautset.m	⊢ 𝑀 = (PAut‘𝐾)

Assertion

Ref	Expression
pautsetN	⊢ (𝐾 ∈ 𝐵 → 𝑀 = {𝑓 ∣ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))})

Distinct variable groups:   𝑥,𝑓,𝑦   𝑓,𝐾,𝑥   𝑆,𝑓,𝑥,𝑦

Allowed substitution hints:   𝐵(𝑥, 𝑦, 𝑓)   𝐾(𝑦)   𝑀(𝑥, 𝑦, 𝑓)

Proof of Theorem pautsetN

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3472	. 2 ⊢ (𝐾 ∈ 𝐵 → 𝐾 ∈ V)
2		pautset.m	. . 3 ⊢ 𝑀 = (PAut‘𝐾)
3		fveq2 6885	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (PSubSp‘𝑘) = (PSubSp‘𝐾))
4		pautset.s	. . . . . . . . 9 ⊢ 𝑆 = (PSubSp‘𝐾)
5	3, 4	eqtr4di 2814	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (PSubSp‘𝑘) = 𝑆)
6	5	f1oeq2d 6820	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (𝑓:(PSubSp‘𝑘)–1-1-onto→(PSubSp‘𝑘) ↔ 𝑓:𝑆–1-1-onto→(PSubSp‘𝑘)))
7		f1oeq3 6814	. . . . . . . 8 ⊢ ((PSubSp‘𝑘) = 𝑆 → (𝑓:𝑆–1-1-onto→(PSubSp‘𝑘) ↔ 𝑓:𝑆–1-1-onto→𝑆))
8	5, 7	syl 18	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (𝑓:𝑆–1-1-onto→(PSubSp‘𝑘) ↔ 𝑓:𝑆–1-1-onto→𝑆))
9	6, 8	bitrd 282	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑓:(PSubSp‘𝑘)–1-1-onto→(PSubSp‘𝑘) ↔ 𝑓:𝑆–1-1-onto→𝑆))
10	5	raleqdv 3320	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (∀𝑦 ∈ (PSubSp‘𝑘)(𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)) ↔ ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦))))
11	5, 10	raleqbidv 3335	. . . . . 6 ⊢ (𝑘 = 𝐾 → (∀𝑥 ∈ (PSubSp‘𝑘)∀𝑦 ∈ (PSubSp‘𝑘)(𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦))))
12	9, 11	anbi12d 644	. . . . 5 ⊢ (𝑘 = 𝐾 → ((𝑓:(PSubSp‘𝑘)–1-1-onto→(PSubSp‘𝑘) ∧ ∀𝑥 ∈ (PSubSp‘𝑘)∀𝑦 ∈ (PSubSp‘𝑘)(𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦))) ↔ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))))
13	12	abbidv 2827	. . . 4 ⊢ (𝑘 = 𝐾 → {𝑓 ∣ (𝑓:(PSubSp‘𝑘)–1-1-onto→(PSubSp‘𝑘) ∧ ∀𝑥 ∈ (PSubSp‘𝑘)∀𝑦 ∈ (PSubSp‘𝑘)(𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))} = {𝑓 ∣ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))})
14		df-pautN 41048	. . . 4 ⊢ PAut = (𝑘 ∈ V ↦ {𝑓 ∣ (𝑓:(PSubSp‘𝑘)–1-1-onto→(PSubSp‘𝑘) ∧ ∀𝑥 ∈ (PSubSp‘𝑘)∀𝑦 ∈ (PSubSp‘𝑘)(𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))})
15	4	fvexi 6899	. . . . . . . 8 ⊢ 𝑆 ∈ V
16	15, 15	mapval 8858	. . . . . . 7 ⊢ (𝑆 ↑m 𝑆) = {𝑓 ∣ 𝑓:𝑆⟶𝑆}
17		ovex 7453	. . . . . . 7 ⊢ (𝑆 ↑m 𝑆) ∈ V
18	16, 17	eqeltrri 2858	. . . . . 6 ⊢ {𝑓 ∣ 𝑓:𝑆⟶𝑆} ∈ V
19		f1of 6824	. . . . . . 7 ⊢ (𝑓:𝑆–1-1-onto→𝑆 → 𝑓:𝑆⟶𝑆)
20	19	ss2abi 4014	. . . . . 6 ⊢ {𝑓 ∣ 𝑓:𝑆–1-1-onto→𝑆} ⊆ {𝑓 ∣ 𝑓:𝑆⟶𝑆}
21	18, 20	ssexi 5284	. . . . 5 ⊢ {𝑓 ∣ 𝑓:𝑆–1-1-onto→𝑆} ∈ V
22		simpl 488	. . . . . 6 ⊢ ((𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦))) → 𝑓:𝑆–1-1-onto→𝑆)
23	22	ss2abi 4014	. . . . 5 ⊢ {𝑓 ∣ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))} ⊆ {𝑓 ∣ 𝑓:𝑆–1-1-onto→𝑆}
24	21, 23	ssexi 5284	. . . 4 ⊢ {𝑓 ∣ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))} ∈ V
25	13, 14, 24	fvmpt 6993	. . 3 ⊢ (𝐾 ∈ V → (PAut‘𝐾) = {𝑓 ∣ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))})
26	2, 25	eqtrid 2808	. 2 ⊢ (𝐾 ∈ V → 𝑀 = {𝑓 ∣ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))})
27	1, 26	syl 18	1 ⊢ (𝐾 ∈ 𝐵 → 𝑀 = {𝑓 ∣ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  ∀wral 3077  Vcvv 3451   ⊆ wss 3899  ⟶wf 6534  –1-1-onto→wf1o 6537  ‘cfv 6538  (class class class)co 7420   ↑_m cmap 8847  PSubSpcpsubsp 40553  PAutcpautN 41044

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 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8849  df-pautN 41048

This theorem is used by:  ispautN  41156