Theorem pautsetN 38561

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 3463	. 2 ⊢ (𝐾 ∈ 𝐵 → 𝐾 ∈ V)
2		pautset.m	. . 3 ⊢ 𝑀 = (PAut‘𝐾)
3		fveq2 6842	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (PSubSp‘𝑘) = (PSubSp‘𝐾))
4		pautset.s	. . . . . . . . 9 ⊢ 𝑆 = (PSubSp‘𝐾)
5	3, 4	eqtr4di 2794	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (PSubSp‘𝑘) = 𝑆)
6	5	f1oeq2d 6780	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (𝑓:(PSubSp‘𝑘)–1-1-onto→(PSubSp‘𝑘) ↔ 𝑓:𝑆–1-1-onto→(PSubSp‘𝑘)))
7		f1oeq3 6774	. . . . . . . 8 ⊢ ((PSubSp‘𝑘) = 𝑆 → (𝑓:𝑆–1-1-onto→(PSubSp‘𝑘) ↔ 𝑓:𝑆–1-1-onto→𝑆))
8	5, 7	syl 17	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (𝑓:𝑆–1-1-onto→(PSubSp‘𝑘) ↔ 𝑓:𝑆–1-1-onto→𝑆))
9	6, 8	bitrd 278	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑓:(PSubSp‘𝑘)–1-1-onto→(PSubSp‘𝑘) ↔ 𝑓:𝑆–1-1-onto→𝑆))
10	5	raleqdv 3313	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (∀𝑦 ∈ (PSubSp‘𝑘)(𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)) ↔ ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦))))
11	5, 10	raleqbidv 3319	. . . . . 6 ⊢ (𝑘 = 𝐾 → (∀𝑥 ∈ (PSubSp‘𝑘)∀𝑦 ∈ (PSubSp‘𝑘)(𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦))))
12	9, 11	anbi12d 631	. . . . 5 ⊢ (𝑘 = 𝐾 → ((𝑓:(PSubSp‘𝑘)–1-1-onto→(PSubSp‘𝑘) ∧ ∀𝑥 ∈ (PSubSp‘𝑘)∀𝑦 ∈ (PSubSp‘𝑘)(𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦))) ↔ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))))
13	12	abbidv 2805	. . . 4 ⊢ (𝑘 = 𝐾 → {𝑓 ∣ (𝑓:(PSubSp‘𝑘)–1-1-onto→(PSubSp‘𝑘) ∧ ∀𝑥 ∈ (PSubSp‘𝑘)∀𝑦 ∈ (PSubSp‘𝑘)(𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))} = {𝑓 ∣ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))})
14		df-pautN 38454	. . . 4 ⊢ PAut = (𝑘 ∈ V ↦ {𝑓 ∣ (𝑓:(PSubSp‘𝑘)–1-1-onto→(PSubSp‘𝑘) ∧ ∀𝑥 ∈ (PSubSp‘𝑘)∀𝑦 ∈ (PSubSp‘𝑘)(𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))})
15	4	fvexi 6856	. . . . . . . 8 ⊢ 𝑆 ∈ V
16	15, 15	mapval 8777	. . . . . . 7 ⊢ (𝑆 ↑m 𝑆) = {𝑓 ∣ 𝑓:𝑆⟶𝑆}
17		ovex 7390	. . . . . . 7 ⊢ (𝑆 ↑m 𝑆) ∈ V
18	16, 17	eqeltrri 2835	. . . . . 6 ⊢ {𝑓 ∣ 𝑓:𝑆⟶𝑆} ∈ V
19		f1of 6784	. . . . . . 7 ⊢ (𝑓:𝑆–1-1-onto→𝑆 → 𝑓:𝑆⟶𝑆)
20	19	ss2abi 4023	. . . . . 6 ⊢ {𝑓 ∣ 𝑓:𝑆–1-1-onto→𝑆} ⊆ {𝑓 ∣ 𝑓:𝑆⟶𝑆}
21	18, 20	ssexi 5279	. . . . 5 ⊢ {𝑓 ∣ 𝑓:𝑆–1-1-onto→𝑆} ∈ V
22		simpl 483	. . . . . 6 ⊢ ((𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦))) → 𝑓:𝑆–1-1-onto→𝑆)
23	22	ss2abi 4023	. . . . 5 ⊢ {𝑓 ∣ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))} ⊆ {𝑓 ∣ 𝑓:𝑆–1-1-onto→𝑆}
24	21, 23	ssexi 5279	. . . 4 ⊢ {𝑓 ∣ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))} ∈ V
25	13, 14, 24	fvmpt 6948	. . 3 ⊢ (𝐾 ∈ V → (PAut‘𝐾) = {𝑓 ∣ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))})
26	2, 25	eqtrid 2788	. 2 ⊢ (𝐾 ∈ V → 𝑀 = {𝑓 ∣ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))})
27	1, 26	syl 17	1 ⊢ (𝐾 ∈ 𝐵 → 𝑀 = {𝑓 ∣ (𝑓:𝑆–1-1-onto→𝑆 ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥 ⊆ 𝑦 ↔ (𝑓‘𝑥) ⊆ (𝑓‘𝑦)))})

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  {cab 2713  ∀wral 3064  Vcvv 3445   ⊆ wss 3910  ⟶wf 6492  –1-1-onto→wf1o 6495  ‘cfv 6496  (class class class)co 7357   ↑_m cmap 8765  PSubSpcpsubsp 37959  PAutcpautN 38450

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-map 8767  df-pautN 38454

This theorem is referenced by:  ispautN  38562