Theorem dnnumch1 40785

Description: Define an enumeration of a set from a choice function; second part, it restricts to a bijection. EDITORIAL: overlaps dfac8a 9717. (Contributed by Stefan O'Rear, 18-Jan-2015.)

Hypotheses

Ref	Expression
dnnumch.f	⊢ 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))
dnnumch.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
dnnumch.g	⊢ (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺‘𝑦) ∈ 𝑦))

Assertion

Ref	Expression
dnnumch1	⊢ (𝜑 → ∃𝑥 ∈ On (𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴)

Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦,𝑧   𝑥,𝐴,𝑦,𝑧   𝜑,𝑥

Allowed substitution hints:   𝜑(𝑦,𝑧)   𝐹(𝑧)   𝑉(𝑥,𝑦,𝑧)

Proof of Theorem dnnumch1

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dnnumch.a	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
2		recsval 8206	. . . . . . 7 ⊢ (𝑥 ∈ On → (recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))‘𝑥) = ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥)))
3		dnnumch.f	. . . . . . . 8 ⊢ 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))
4	3	fveq1i 6757	. . . . . . 7 ⊢ (𝐹‘𝑥) = (recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))‘𝑥)
5	3	tfr1 8199	. . . . . . . . . . 11 ⊢ 𝐹 Fn On
6		fnfun 6517	. . . . . . . . . . 11 ⊢ (𝐹 Fn On → Fun 𝐹)
7	5, 6	ax-mp 5	. . . . . . . . . 10 ⊢ Fun 𝐹
8		vex 3426	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
9		resfunexg 7073	. . . . . . . . . 10 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ V) → (𝐹 ↾ 𝑥) ∈ V)
10	7, 8, 9	mp2an 688	. . . . . . . . 9 ⊢ (𝐹 ↾ 𝑥) ∈ V
11		rneq 5834	. . . . . . . . . . . . 13 ⊢ (𝑤 = (𝐹 ↾ 𝑥) → ran 𝑤 = ran (𝐹 ↾ 𝑥))
12		df-ima 5593	. . . . . . . . . . . . 13 ⊢ (𝐹 “ 𝑥) = ran (𝐹 ↾ 𝑥)
13	11, 12	eqtr4di 2797	. . . . . . . . . . . 12 ⊢ (𝑤 = (𝐹 ↾ 𝑥) → ran 𝑤 = (𝐹 “ 𝑥))
14	13	difeq2d 4053	. . . . . . . . . . 11 ⊢ (𝑤 = (𝐹 ↾ 𝑥) → (𝐴 ∖ ran 𝑤) = (𝐴 ∖ (𝐹 “ 𝑥)))
15	14	fveq2d 6760	. . . . . . . . . 10 ⊢ (𝑤 = (𝐹 ↾ 𝑥) → (𝐺‘(𝐴 ∖ ran 𝑤)) = (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))))
16		rneq 5834	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑤 → ran 𝑧 = ran 𝑤)
17	16	difeq2d 4053	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → (𝐴 ∖ ran 𝑧) = (𝐴 ∖ ran 𝑤))
18	17	fveq2d 6760	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → (𝐺‘(𝐴 ∖ ran 𝑧)) = (𝐺‘(𝐴 ∖ ran 𝑤)))
19	18	cbvmptv 5183	. . . . . . . . . 10 ⊢ (𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))) = (𝑤 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑤)))
20		fvex 6769	. . . . . . . . . 10 ⊢ (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ V
21	15, 19, 20	fvmpt 6857	. . . . . . . . 9 ⊢ ((𝐹 ↾ 𝑥) ∈ V → ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(𝐹 ↾ 𝑥)) = (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))))
22	10, 21	ax-mp 5	. . . . . . . 8 ⊢ ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(𝐹 ↾ 𝑥)) = (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥)))
23	3	reseq1i 5876	. . . . . . . . 9 ⊢ (𝐹 ↾ 𝑥) = (recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥)
24	23	fveq2i 6759	. . . . . . . 8 ⊢ ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(𝐹 ↾ 𝑥)) = ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥))
25	22, 24	eqtr3i 2768	. . . . . . 7 ⊢ (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) = ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥))
26	2, 4, 25	3eqtr4g 2804	. . . . . 6 ⊢ (𝑥 ∈ On → (𝐹‘𝑥) = (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))))
27	26	ad2antlr 723	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ On) ∧ (𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅) → (𝐹‘𝑥) = (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))))
28		difss 4062	. . . . . . . . 9 ⊢ (𝐴 ∖ (𝐹 “ 𝑥)) ⊆ 𝐴
29		elpw2g 5263	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ∖ (𝐹 “ 𝑥)) ∈ 𝒫 𝐴 ↔ (𝐴 ∖ (𝐹 “ 𝑥)) ⊆ 𝐴))
30	1, 29	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ((𝐴 ∖ (𝐹 “ 𝑥)) ∈ 𝒫 𝐴 ↔ (𝐴 ∖ (𝐹 “ 𝑥)) ⊆ 𝐴))
31	28, 30	mpbiri 257	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ∖ (𝐹 “ 𝑥)) ∈ 𝒫 𝐴)
32		dnnumch.g	. . . . . . . 8 ⊢ (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺‘𝑦) ∈ 𝑦))
33		neeq1 3005	. . . . . . . . . 10 ⊢ (𝑦 = (𝐴 ∖ (𝐹 “ 𝑥)) → (𝑦 ≠ ∅ ↔ (𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅))
34		fveq2 6756	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐴 ∖ (𝐹 “ 𝑥)) → (𝐺‘𝑦) = (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))))
35		id 22	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐴 ∖ (𝐹 “ 𝑥)) → 𝑦 = (𝐴 ∖ (𝐹 “ 𝑥)))
36	34, 35	eleq12d 2833	. . . . . . . . . 10 ⊢ (𝑦 = (𝐴 ∖ (𝐹 “ 𝑥)) → ((𝐺‘𝑦) ∈ 𝑦 ↔ (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
37	33, 36	imbi12d 344	. . . . . . . . 9 ⊢ (𝑦 = (𝐴 ∖ (𝐹 “ 𝑥)) → ((𝑦 ≠ ∅ → (𝐺‘𝑦) ∈ 𝑦) ↔ ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ (𝐴 ∖ (𝐹 “ 𝑥)))))
38	37	rspcva 3550	. . . . . . . 8 ⊢ (((𝐴 ∖ (𝐹 “ 𝑥)) ∈ 𝒫 𝐴 ∧ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺‘𝑦) ∈ 𝑦)) → ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
39	31, 32, 38	syl2anc 583	. . . . . . 7 ⊢ (𝜑 → ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
40	39	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ On) → ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
41	40	imp 406	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ On) ∧ (𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅) → (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ (𝐴 ∖ (𝐹 “ 𝑥)))
42	27, 41	eqeltrd 2839	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ On) ∧ (𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅) → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)))
43	42	ex 412	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ On) → ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
44	43	ralrimiva 3107	. 2 ⊢ (𝜑 → ∀𝑥 ∈ On ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
45	5	tz7.49c 8247	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ On ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)))) → ∃𝑥 ∈ On (𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴)
46	1, 44, 45	syl2anc 583	1 ⊢ (𝜑 → ∃𝑥 ∈ On (𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108   ≠ wne 2942  ∀wral 3063  ∃wrex 3064  Vcvv 3422   ∖ cdif 3880   ⊆ wss 3883  ∅c0 4253  𝒫 cpw 4530   ↦ cmpt 5153  ran crn 5581   ↾ cres 5582   “ cima 5583  Oncon0 6251  Fun wfun 6412   Fn wfn 6413  –1-1-onto→wf1o 6417  ‘cfv 6418  recscrecs 8172

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173

This theorem is referenced by:  dnnumch2  40786