Theorem dnnumch1 44051

Description: Define an enumeration of a set from a choice function; second part, it restricts to a bijection. EDITORIAL: overlaps dfac8a 10109. (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 8412	. . . . . . 7 ⊢ (𝑥 ∈ On → (recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))‘𝑥) = ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥)))
3		dnnumch.f	. . . . . . . 8 ⊢ 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))
4	3	fveq1i 6886	. . . . . . 7 ⊢ (𝐹‘𝑥) = (recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))))‘𝑥)
5	3	tfr1 8405	. . . . . . . . . . 11 ⊢ 𝐹 Fn On
6		fnfun 6639	. . . . . . . . . . 11 ⊢ (𝐹 Fn On → Fun 𝐹)
7	5, 6	ax-mp 5	. . . . . . . . . 10 ⊢ Fun 𝐹
8		vex 3454	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
9		resfunexg 7221	. . . . . . . . . 10 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ V) → (𝐹 ↾ 𝑥) ∈ V)
10	7, 8, 9	mp2an 705	. . . . . . . . 9 ⊢ (𝐹 ↾ 𝑥) ∈ V
11		rneq 5917	. . . . . . . . . . . . 13 ⊢ (𝑤 = (𝐹 ↾ 𝑥) → ran 𝑤 = ran (𝐹 ↾ 𝑥))
12		df-ima 5663	. . . . . . . . . . . . 13 ⊢ (𝐹 “ 𝑥) = ran (𝐹 ↾ 𝑥)
13	11, 12	eqtr4di 2813	. . . . . . . . . . . 12 ⊢ (𝑤 = (𝐹 ↾ 𝑥) → ran 𝑤 = (𝐹 “ 𝑥))
14	13	difeq2d 4063	. . . . . . . . . . 11 ⊢ (𝑤 = (𝐹 ↾ 𝑥) → (𝐴 ∖ ran 𝑤) = (𝐴 ∖ (𝐹 “ 𝑥)))
15	14	fveq2d 6889	. . . . . . . . . 10 ⊢ (𝑤 = (𝐹 ↾ 𝑥) → (𝐺‘(𝐴 ∖ ran 𝑤)) = (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))))
16		rneq 5917	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑤 → ran 𝑧 = ran 𝑤)
17	16	difeq2d 4063	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → (𝐴 ∖ ran 𝑧) = (𝐴 ∖ ran 𝑤))
18	17	fveq2d 6889	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → (𝐺‘(𝐴 ∖ ran 𝑧)) = (𝐺‘(𝐴 ∖ ran 𝑤)))
19	18	cbvmptv 5208	. . . . . . . . . 10 ⊢ (𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧))) = (𝑤 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑤)))
20		fvex 6898	. . . . . . . . . 10 ⊢ (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ V
21	15, 19, 20	fvmpt 6993	. . . . . . . . 9 ⊢ ((𝐹 ↾ 𝑥) ∈ V → ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(𝐹 ↾ 𝑥)) = (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))))
22	10, 21	ax-mp 5	. . . . . . . 8 ⊢ ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(𝐹 ↾ 𝑥)) = (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥)))
23	3	reseq1i 5965	. . . . . . . . 9 ⊢ (𝐹 ↾ 𝑥) = (recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥)
24	23	fveq2i 6888	. . . . . . . 8 ⊢ ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(𝐹 ↾ 𝑥)) = ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥))
25	22, 24	eqtr3i 2785	. . . . . . 7 ⊢ (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) = ((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))‘(recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) ↾ 𝑥))
26	2, 4, 25	3eqtr4g 2820	. . . . . 6 ⊢ (𝑥 ∈ On → (𝐹‘𝑥) = (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))))
27	26	ad2antlr 740	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ On) ∧ (𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅) → (𝐹‘𝑥) = (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))))
28		difss 4072	. . . . . . . . 9 ⊢ (𝐴 ∖ (𝐹 “ 𝑥)) ⊆ 𝐴
29		elpw2g 5294	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ∖ (𝐹 “ 𝑥)) ∈ 𝒫 𝐴 ↔ (𝐴 ∖ (𝐹 “ 𝑥)) ⊆ 𝐴))
30	1, 29	syl 18	. . . . . . . . 9 ⊢ (𝜑 → ((𝐴 ∖ (𝐹 “ 𝑥)) ∈ 𝒫 𝐴 ↔ (𝐴 ∖ (𝐹 “ 𝑥)) ⊆ 𝐴))
31	28, 30	mpbiri 261	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ∖ (𝐹 “ 𝑥)) ∈ 𝒫 𝐴)
32		dnnumch.g	. . . . . . . 8 ⊢ (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺‘𝑦) ∈ 𝑦))
33		neeq1 3017	. . . . . . . . . 10 ⊢ (𝑦 = (𝐴 ∖ (𝐹 “ 𝑥)) → (𝑦 ≠ ∅ ↔ (𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅))
34		fveq2 6885	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐴 ∖ (𝐹 “ 𝑥)) → (𝐺‘𝑦) = (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))))
35		id 23	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐴 ∖ (𝐹 “ 𝑥)) → 𝑦 = (𝐴 ∖ (𝐹 “ 𝑥)))
36	34, 35	eleq12d 2854	. . . . . . . . . 10 ⊢ (𝑦 = (𝐴 ∖ (𝐹 “ 𝑥)) → ((𝐺‘𝑦) ∈ 𝑦 ↔ (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
37	33, 36	imbi12d 347	. . . . . . . . 9 ⊢ (𝑦 = (𝐴 ∖ (𝐹 “ 𝑥)) → ((𝑦 ≠ ∅ → (𝐺‘𝑦) ∈ 𝑦) ↔ ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ (𝐴 ∖ (𝐹 “ 𝑥)))))
38	37	rspcva 3574	. . . . . . . 8 ⊢ (((𝐴 ∖ (𝐹 “ 𝑥)) ∈ 𝒫 𝐴 ∧ ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺‘𝑦) ∈ 𝑦)) → ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
39	31, 32, 38	syl2anc 596	. . . . . . 7 ⊢ (𝜑 → ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
40	39	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ On) → ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
41	40	imp 412	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ On) ∧ (𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅) → (𝐺‘(𝐴 ∖ (𝐹 “ 𝑥))) ∈ (𝐴 ∖ (𝐹 “ 𝑥)))
42	27, 41	eqeltrd 2860	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ On) ∧ (𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅) → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)))
43	42	ex 418	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ On) → ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
44	43	ralrimiva 3154	. 2 ⊢ (𝜑 → ∀𝑥 ∈ On ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))))
45	5	tz7.49c 8456	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ On ((𝐴 ∖ (𝐹 “ 𝑥)) ≠ ∅ → (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)))) → ∃𝑥 ∈ On (𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴)
46	1, 44, 45	syl2anc 596	1 ⊢ (𝜑 → ∃𝑥 ∈ On (𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ⊆ wss 3895   ∖ cdif 4045  ∅c0 4278  𝒫 cpw 4556   ↦ cmpt 5185  ran crn 5651   ↾ cres 5652   “ cima 5653  Oncon0 6362  Fun wfun 6532   Fn wfn 6533  –1-1-onto→wf1o 6537  ‘cfv 6538  recscrecs 8378

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-suc 6368  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-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379

This theorem is used by:  dnnumch2  44052