Theorem aceq3lem 10100

Description: Lemma for dfac3 10101. (Contributed by NM, 2-Apr-2004.) (Revised by Mario Carneiro, 26-Jun-2015.)

Hypothesis

Ref	Expression
aceq3lem.1	⊢ 𝐹 = (𝑤 ∈ dom 𝑦 ↦ (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}))

Assertion

Ref	Expression
aceq3lem	⊢ (∀𝑥∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∃𝑓(𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦))

Distinct variable group:   𝑥,𝑦,𝑧,𝑤,𝑢,𝑓

Allowed substitution hints:   𝐹(𝑥,𝑦,𝑧,𝑤,𝑢,𝑓)

Proof of Theorem aceq3lem

Dummy variables ℎ 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3467	. . . . . 6 ⊢ 𝑦 ∈ V
2	1	rnex 7903	. . . . 5 ⊢ ran 𝑦 ∈ V
3	2	pwex 5349	. . . 4 ⊢ 𝒫 ran 𝑦 ∈ V
4		raleq 3326	. . . . 5 ⊢ (𝑥 = 𝒫 ran 𝑦 → (∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) ↔ ∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧)))
5	4	exbidv 1948	. . . 4 ⊢ (𝑥 = 𝒫 ran 𝑦 → (∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) ↔ ∃𝑓∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧)))
6	3, 5	spcv 3573	. . 3 ⊢ (∀𝑥∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∃𝑓∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))
7		aceq3lem.1	. . . . . . 7 ⊢ 𝐹 = (𝑤 ∈ dom 𝑦 ↦ (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}))
8		df-mpt 5194	. . . . . . 7 ⊢ (𝑤 ∈ dom 𝑦 ↦ (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢})) = {⟨𝑤, ℎ⟩ ∣ (𝑤 ∈ dom 𝑦 ∧ ℎ = (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}))}
9	7, 8	eqtri 2792	. . . . . 6 ⊢ 𝐹 = {⟨𝑤, ℎ⟩ ∣ (𝑤 ∈ dom 𝑦 ∧ ℎ = (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}))}
10		vex 3467	. . . . . . . . . . . . . . 15 ⊢ 𝑤 ∈ V
11	10	eldm 5888	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ dom 𝑦 ↔ ∃𝑢 𝑤𝑦𝑢)
12		abn0 4347	. . . . . . . . . . . . . 14 ⊢ ({𝑢 ∣ 𝑤𝑦𝑢} ≠ ∅ ↔ ∃𝑢 𝑤𝑦𝑢)
13	11, 12	bitr4i 281	. . . . . . . . . . . . 13 ⊢ (𝑤 ∈ dom 𝑦 ↔ {𝑢 ∣ 𝑤𝑦𝑢} ≠ ∅)
14		vex 3467	. . . . . . . . . . . . . . . . 17 ⊢ 𝑢 ∈ V
15	10, 14	brelrn 5930	. . . . . . . . . . . . . . . 16 ⊢ (𝑤𝑦𝑢 → 𝑢 ∈ ran 𝑦)
16	15	abssi 4030	. . . . . . . . . . . . . . 15 ⊢ {𝑢 ∣ 𝑤𝑦𝑢} ⊆ ran 𝑦
17	2, 16	elpwi2 5303	. . . . . . . . . . . . . 14 ⊢ {𝑢 ∣ 𝑤𝑦𝑢} ∈ 𝒫 ran 𝑦
18		neeq1 3026	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = {𝑢 ∣ 𝑤𝑦𝑢} → (𝑧 ≠ ∅ ↔ {𝑢 ∣ 𝑤𝑦𝑢} ≠ ∅))
19		fveq2 6879	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = {𝑢 ∣ 𝑤𝑦𝑢} → (𝑓‘𝑧) = (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}))
20		id 23	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = {𝑢 ∣ 𝑤𝑦𝑢} → 𝑧 = {𝑢 ∣ 𝑤𝑦𝑢})
21	19, 20	eleq12d 2863	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = {𝑢 ∣ 𝑤𝑦𝑢} → ((𝑓‘𝑧) ∈ 𝑧 ↔ (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}) ∈ {𝑢 ∣ 𝑤𝑦𝑢}))
22	18, 21	imbi12d 347	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = {𝑢 ∣ 𝑤𝑦𝑢} → ((𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) ↔ ({𝑢 ∣ 𝑤𝑦𝑢} ≠ ∅ → (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}) ∈ {𝑢 ∣ 𝑤𝑦𝑢})))
23	22	rspcv 3586	. . . . . . . . . . . . . 14 ⊢ ({𝑢 ∣ 𝑤𝑦𝑢} ∈ 𝒫 ran 𝑦 → (∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ({𝑢 ∣ 𝑤𝑦𝑢} ≠ ∅ → (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}) ∈ {𝑢 ∣ 𝑤𝑦𝑢})))
24	17, 23	ax-mp 5	. . . . . . . . . . . . 13 ⊢ (∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ({𝑢 ∣ 𝑤𝑦𝑢} ≠ ∅ → (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}) ∈ {𝑢 ∣ 𝑤𝑦𝑢}))
25	13, 24	biimtrid 245	. . . . . . . . . . . 12 ⊢ (∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → (𝑤 ∈ dom 𝑦 → (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}) ∈ {𝑢 ∣ 𝑤𝑦𝑢}))
26	25	imp 411	. . . . . . . . . . 11 ⊢ ((∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) ∧ 𝑤 ∈ dom 𝑦) → (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}) ∈ {𝑢 ∣ 𝑤𝑦𝑢})
27		fvex 6892	. . . . . . . . . . . 12 ⊢ (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}) ∈ V
28		breq2 5114	. . . . . . . . . . . 12 ⊢ (𝑧 = (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}) → (𝑤𝑦𝑧 ↔ 𝑤𝑦(𝑓‘{𝑢 ∣ 𝑤𝑦𝑢})))
29		breq2 5114	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑧 → (𝑤𝑦𝑢 ↔ 𝑤𝑦𝑧))
30	29	cbvabv 2839	. . . . . . . . . . . 12 ⊢ {𝑢 ∣ 𝑤𝑦𝑢} = {𝑧 ∣ 𝑤𝑦𝑧}
31	27, 28, 30	elab2 3650	. . . . . . . . . . 11 ⊢ ((𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}) ∈ {𝑢 ∣ 𝑤𝑦𝑢} ↔ 𝑤𝑦(𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}))
32	26, 31	sylib 221	. . . . . . . . . 10 ⊢ ((∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) ∧ 𝑤 ∈ dom 𝑦) → 𝑤𝑦(𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}))
33		breq2 5114	. . . . . . . . . 10 ⊢ (ℎ = (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}) → (𝑤𝑦ℎ ↔ 𝑤𝑦(𝑓‘{𝑢 ∣ 𝑤𝑦𝑢})))
34	32, 33	syl5ibrcom 250	. . . . . . . . 9 ⊢ ((∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) ∧ 𝑤 ∈ dom 𝑦) → (ℎ = (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}) → 𝑤𝑦ℎ))
35	34	expimpd 458	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ((𝑤 ∈ dom 𝑦 ∧ ℎ = (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢})) → 𝑤𝑦ℎ))
36	35	ssopab2dv 5534	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → {⟨𝑤, ℎ⟩ ∣ (𝑤 ∈ dom 𝑦 ∧ ℎ = (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}))} ⊆ {⟨𝑤, ℎ⟩ ∣ 𝑤𝑦ℎ})
37		opabss 5176	. . . . . . 7 ⊢ {⟨𝑤, ℎ⟩ ∣ 𝑤𝑦ℎ} ⊆ 𝑦
38	36, 37	sstrdi 3957	. . . . . 6 ⊢ (∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → {⟨𝑤, ℎ⟩ ∣ (𝑤 ∈ dom 𝑦 ∧ ℎ = (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}))} ⊆ 𝑦)
39	9, 38	eqsstrid 3983	. . . . 5 ⊢ (∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → 𝐹 ⊆ 𝑦)
40	27, 7	fnmpti 6676	. . . . 5 ⊢ 𝐹 Fn dom 𝑦
41	1	ssex 5289	. . . . . . 7 ⊢ (𝐹 ⊆ 𝑦 → 𝐹 ∈ V)
42	41	adantr 485	. . . . . 6 ⊢ ((𝐹 ⊆ 𝑦 ∧ 𝐹 Fn dom 𝑦) → 𝐹 ∈ V)
43		sseq1 3970	. . . . . . . 8 ⊢ (𝑔 = 𝐹 → (𝑔 ⊆ 𝑦 ↔ 𝐹 ⊆ 𝑦))
44		fneq1 6624	. . . . . . . 8 ⊢ (𝑔 = 𝐹 → (𝑔 Fn dom 𝑦 ↔ 𝐹 Fn dom 𝑦))
45	43, 44	anbi12d 643	. . . . . . 7 ⊢ (𝑔 = 𝐹 → ((𝑔 ⊆ 𝑦 ∧ 𝑔 Fn dom 𝑦) ↔ (𝐹 ⊆ 𝑦 ∧ 𝐹 Fn dom 𝑦)))
46	45	spcegv 3565	. . . . . 6 ⊢ (𝐹 ∈ V → ((𝐹 ⊆ 𝑦 ∧ 𝐹 Fn dom 𝑦) → ∃𝑔(𝑔 ⊆ 𝑦 ∧ 𝑔 Fn dom 𝑦)))
47	42, 46	mpcom 39	. . . . 5 ⊢ ((𝐹 ⊆ 𝑦 ∧ 𝐹 Fn dom 𝑦) → ∃𝑔(𝑔 ⊆ 𝑦 ∧ 𝑔 Fn dom 𝑦))
48	39, 40, 47	sylancl 597	. . . 4 ⊢ (∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∃𝑔(𝑔 ⊆ 𝑦 ∧ 𝑔 Fn dom 𝑦))
49	48	exlimiv 1957	. . 3 ⊢ (∃𝑓∀𝑧 ∈ 𝒫 ran 𝑦(𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∃𝑔(𝑔 ⊆ 𝑦 ∧ 𝑔 Fn dom 𝑦))
50	6, 49	syl 18	. 2 ⊢ (∀𝑥∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∃𝑔(𝑔 ⊆ 𝑦 ∧ 𝑔 Fn dom 𝑦))
51		sseq1 3970	. . . 4 ⊢ (𝑔 = 𝑓 → (𝑔 ⊆ 𝑦 ↔ 𝑓 ⊆ 𝑦))
52		fneq1 6624	. . . 4 ⊢ (𝑔 = 𝑓 → (𝑔 Fn dom 𝑦 ↔ 𝑓 Fn dom 𝑦))
53	51, 52	anbi12d 643	. . 3 ⊢ (𝑔 = 𝑓 → ((𝑔 ⊆ 𝑦 ∧ 𝑔 Fn dom 𝑦) ↔ (𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦)))
54	53	cbvexvw 2064	. 2 ⊢ (∃𝑔(𝑔 ⊆ 𝑦 ∧ 𝑔 Fn dom 𝑦) ↔ ∃𝑓(𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦))
55	50, 54	sylib 221	1 ⊢ (∀𝑥∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∃𝑓(𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦))

Syntax hints:   → wi 4   ∧ wa 400  ∀wal 1565   = wceq 1567  ∃wex 1806   ∈ wcel 2149  {cab 2747   ≠ wne 2964  ∀wral 3085  Vcvv 3463   ⊆ wss 3913  ∅c0 4294  𝒫 cpw 4564   class class class wbr 5110  {copab 5174   ↦ cmpt 5193  dom cdm 5659  ran crn 5660   Fn wfn 6528  ‘cfv 6533

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6489  df-fun 6535  df-fn 6536  df-fv 6541

This theorem is referenced by:  dfac3  10101