Theorem acunirnmpt2f 30900

Description: Axiom of choice for the union of the range of a mapping to function. (Contributed by Thierry Arnoux, 7-Nov-2019.)

Hypotheses

Ref	Expression
acunirnmpt.0	⊢ (𝜑 → 𝐴 ∈ 𝑉)
acunirnmpt.1	⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐵 ≠ ∅)
aciunf1lem.a	⊢ Ⅎ𝑗𝐴
acunirnmpt2f.c	⊢ Ⅎ𝑗𝐶
acunirnmpt2f.d	⊢ Ⅎ𝑗𝐷
acunirnmpt2f.2	⊢ 𝐶 = ∪ 𝑗 ∈ 𝐴 𝐵
acunirnmpt2f.3	⊢ (𝑗 = (𝑓‘𝑥) → 𝐵 = 𝐷)
acunirnmpt2f.4	⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐵 ∈ 𝑊)

Assertion

Ref	Expression
acunirnmpt2f	⊢ (𝜑 → ∃𝑓(𝑓:𝐶⟶𝐴 ∧ ∀𝑥 ∈ 𝐶 𝑥 ∈ 𝐷))

Distinct variable groups:   𝑥,𝑓,𝐴   𝐵,𝑓   𝐶,𝑓,𝑥   𝑓,𝑗,𝜑,𝑥

Allowed substitution hints:   𝐴(𝑗)   𝐵(𝑥,𝑗)   𝐶(𝑗)   𝐷(𝑥,𝑓,𝑗)   𝑉(𝑥,𝑓,𝑗)   𝑊(𝑥,𝑓,𝑗)

Proof of Theorem acunirnmpt2f

Dummy variables 𝑐 𝑦 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplr 765	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) → 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵))
2		vex 3426	. . . . . . 7 ⊢ 𝑦 ∈ V
3		eqid 2738	. . . . . . . 8 ⊢ (𝑗 ∈ 𝐴 ↦ 𝐵) = (𝑗 ∈ 𝐴 ↦ 𝐵)
4	3	elrnmpt 5854	. . . . . . 7 ⊢ (𝑦 ∈ V → (𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵) ↔ ∃𝑗 ∈ 𝐴 𝑦 = 𝐵))
5	2, 4	ax-mp 5	. . . . . 6 ⊢ (𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵) ↔ ∃𝑗 ∈ 𝐴 𝑦 = 𝐵)
6	1, 5	sylib 217	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) → ∃𝑗 ∈ 𝐴 𝑦 = 𝐵)
7		nfv 1918	. . . . . . . . 9 ⊢ Ⅎ𝑗𝜑
8		acunirnmpt2f.c	. . . . . . . . . 10 ⊢ Ⅎ𝑗𝐶
9	8	nfcri 2893	. . . . . . . . 9 ⊢ Ⅎ𝑗 𝑥 ∈ 𝐶
10	7, 9	nfan 1903	. . . . . . . 8 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑥 ∈ 𝐶)
11		nfcv 2906	. . . . . . . . 9 ⊢ Ⅎ𝑗𝑦
12		nfmpt1 5178	. . . . . . . . . 10 ⊢ Ⅎ𝑗(𝑗 ∈ 𝐴 ↦ 𝐵)
13	12	nfrn 5850	. . . . . . . . 9 ⊢ Ⅎ𝑗ran (𝑗 ∈ 𝐴 ↦ 𝐵)
14	11, 13	nfel 2920	. . . . . . . 8 ⊢ Ⅎ𝑗 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)
15	10, 14	nfan 1903	. . . . . . 7 ⊢ Ⅎ𝑗((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵))
16		nfv 1918	. . . . . . 7 ⊢ Ⅎ𝑗 𝑥 ∈ 𝑦
17	15, 16	nfan 1903	. . . . . 6 ⊢ Ⅎ𝑗(((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦)
18		simpllr 772	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) ∧ 𝑗 ∈ 𝐴) ∧ 𝑦 = 𝐵) → 𝑥 ∈ 𝑦)
19		simpr 484	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) ∧ 𝑗 ∈ 𝐴) ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵)
20	18, 19	eleqtrd 2841	. . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) ∧ 𝑗 ∈ 𝐴) ∧ 𝑦 = 𝐵) → 𝑥 ∈ 𝐵)
21	20	ex 412	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) ∧ 𝑗 ∈ 𝐴) → (𝑦 = 𝐵 → 𝑥 ∈ 𝐵))
22	21	ex 412	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) → (𝑗 ∈ 𝐴 → (𝑦 = 𝐵 → 𝑥 ∈ 𝐵)))
23	17, 22	reximdai 3239	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) → (∃𝑗 ∈ 𝐴 𝑦 = 𝐵 → ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵))
24	6, 23	mpd 15	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) → ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵)
25		acunirnmpt2f.2	. . . . . . . 8 ⊢ 𝐶 = ∪ 𝑗 ∈ 𝐴 𝐵
26		acunirnmpt2f.4	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐵 ∈ 𝑊)
27	26	ralrimiva 3107	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑗 ∈ 𝐴 𝐵 ∈ 𝑊)
28		dfiun3g 5862	. . . . . . . . 9 ⊢ (∀𝑗 ∈ 𝐴 𝐵 ∈ 𝑊 → ∪ 𝑗 ∈ 𝐴 𝐵 = ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵))
29	27, 28	syl 17	. . . . . . . 8 ⊢ (𝜑 → ∪ 𝑗 ∈ 𝐴 𝐵 = ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵))
30	25, 29	syl5eq 2791	. . . . . . 7 ⊢ (𝜑 → 𝐶 = ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵))
31	30	eleq2d 2824	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↔ 𝑥 ∈ ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵)))
32	31	biimpa 476	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵))
33		eluni2 4840	. . . . 5 ⊢ (𝑥 ∈ ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵) ↔ ∃𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)𝑥 ∈ 𝑦)
34	32, 33	sylib 217	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∃𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)𝑥 ∈ 𝑦)
35	24, 34	r19.29a 3217	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵)
36	35	ralrimiva 3107	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐶 ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵)
37		acunirnmpt.0	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
38		aciunf1lem.a	. . . . . . 7 ⊢ Ⅎ𝑗𝐴
39		nfcv 2906	. . . . . . 7 ⊢ Ⅎ𝑘𝐴
40		nfcv 2906	. . . . . . 7 ⊢ Ⅎ𝑘𝐵
41		nfcsb1v 3853	. . . . . . 7 ⊢ Ⅎ𝑗⦋𝑘 / 𝑗⦌𝐵
42		csbeq1a 3842	. . . . . . 7 ⊢ (𝑗 = 𝑘 → 𝐵 = ⦋𝑘 / 𝑗⦌𝐵)
43	38, 39, 40, 41, 42	cbvmptf 5179	. . . . . 6 ⊢ (𝑗 ∈ 𝐴 ↦ 𝐵) = (𝑘 ∈ 𝐴 ↦ ⦋𝑘 / 𝑗⦌𝐵)
44		mptexg 7079	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝑘 ∈ 𝐴 ↦ ⦋𝑘 / 𝑗⦌𝐵) ∈ V)
45	43, 44	eqeltrid 2843	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝑗 ∈ 𝐴 ↦ 𝐵) ∈ V)
46		rnexg 7725	. . . . 5 ⊢ ((𝑗 ∈ 𝐴 ↦ 𝐵) ∈ V → ran (𝑗 ∈ 𝐴 ↦ 𝐵) ∈ V)
47		uniexg 7571	. . . . 5 ⊢ (ran (𝑗 ∈ 𝐴 ↦ 𝐵) ∈ V → ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵) ∈ V)
48	37, 45, 46, 47	4syl 19	. . . 4 ⊢ (𝜑 → ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵) ∈ V)
49	30, 48	eqeltrd 2839	. . 3 ⊢ (𝜑 → 𝐶 ∈ V)
50		id 22	. . . . . 6 ⊢ (𝑐 = 𝐶 → 𝑐 = 𝐶)
51	50	raleqdv 3339	. . . . 5 ⊢ (𝑐 = 𝐶 → (∀𝑥 ∈ 𝑐 ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵 ↔ ∀𝑥 ∈ 𝐶 ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵))
52	50	feq2d 6570	. . . . . . 7 ⊢ (𝑐 = 𝐶 → (𝑓:𝑐⟶𝐴 ↔ 𝑓:𝐶⟶𝐴))
53	50	raleqdv 3339	. . . . . . 7 ⊢ (𝑐 = 𝐶 → (∀𝑥 ∈ 𝑐 𝑥 ∈ 𝐷 ↔ ∀𝑥 ∈ 𝐶 𝑥 ∈ 𝐷))
54	52, 53	anbi12d 630	. . . . . 6 ⊢ (𝑐 = 𝐶 → ((𝑓:𝑐⟶𝐴 ∧ ∀𝑥 ∈ 𝑐 𝑥 ∈ 𝐷) ↔ (𝑓:𝐶⟶𝐴 ∧ ∀𝑥 ∈ 𝐶 𝑥 ∈ 𝐷)))
55	54	exbidv 1925	. . . . 5 ⊢ (𝑐 = 𝐶 → (∃𝑓(𝑓:𝑐⟶𝐴 ∧ ∀𝑥 ∈ 𝑐 𝑥 ∈ 𝐷) ↔ ∃𝑓(𝑓:𝐶⟶𝐴 ∧ ∀𝑥 ∈ 𝐶 𝑥 ∈ 𝐷)))
56	51, 55	imbi12d 344	. . . 4 ⊢ (𝑐 = 𝐶 → ((∀𝑥 ∈ 𝑐 ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵 → ∃𝑓(𝑓:𝑐⟶𝐴 ∧ ∀𝑥 ∈ 𝑐 𝑥 ∈ 𝐷)) ↔ (∀𝑥 ∈ 𝐶 ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵 → ∃𝑓(𝑓:𝐶⟶𝐴 ∧ ∀𝑥 ∈ 𝐶 𝑥 ∈ 𝐷))))
57		acunirnmpt2f.d	. . . . . 6 ⊢ Ⅎ𝑗𝐷
58	57	nfcri 2893	. . . . 5 ⊢ Ⅎ𝑗 𝑥 ∈ 𝐷
59		vex 3426	. . . . 5 ⊢ 𝑐 ∈ V
60		acunirnmpt2f.3	. . . . . 6 ⊢ (𝑗 = (𝑓‘𝑥) → 𝐵 = 𝐷)
61	60	eleq2d 2824	. . . . 5 ⊢ (𝑗 = (𝑓‘𝑥) → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ 𝐷))
62	38, 58, 59, 61	ac6sf2 30861	. . . 4 ⊢ (∀𝑥 ∈ 𝑐 ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵 → ∃𝑓(𝑓:𝑐⟶𝐴 ∧ ∀𝑥 ∈ 𝑐 𝑥 ∈ 𝐷))
63	56, 62	vtoclg 3495	. . 3 ⊢ (𝐶 ∈ V → (∀𝑥 ∈ 𝐶 ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵 → ∃𝑓(𝑓:𝐶⟶𝐴 ∧ ∀𝑥 ∈ 𝐶 𝑥 ∈ 𝐷)))
64	49, 63	syl 17	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐶 ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵 → ∃𝑓(𝑓:𝐶⟶𝐴 ∧ ∀𝑥 ∈ 𝐶 𝑥 ∈ 𝐷)))
65	36, 64	mpd 15	1 ⊢ (𝜑 → ∃𝑓(𝑓:𝐶⟶𝐴 ∧ ∀𝑥 ∈ 𝐶 𝑥 ∈ 𝐷))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539  ∃wex 1783   ∈ wcel 2108  Ⅎwnfc 2886   ≠ wne 2942  ∀wral 3063  ∃wrex 3064  Vcvv 3422  ⦋csb 3828  ∅c0 4253  ∪ cuni 4836  ∪ ciun 4921   ↦ cmpt 5153  ran crn 5581  ⟶wf 6414  ‘cfv 6418

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-pow 5283  ax-pr 5347  ax-un 7566  ax-reg 9281  ax-inf2 9329  ax-ac2 10150

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-rmo 3071  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-iin 4924  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-se 5536  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-lim 6256  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-isom 6427  df-riota 7212  df-ov 7258  df-om 7688  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-en 8692  df-r1 9453  df-rank 9454  df-card 9628  df-ac 9803

This theorem is referenced by:  aciunf1lem  30901