Theorem dfac3 10120

Description: Equivalence of two versions of the Axiom of Choice. The left-hand side is defined as the Axiom of Choice (first form) of [Enderton] p. 49. The right-hand side is the Axiom of Choice of [TakeutiZaring] p. 83. The proof does not depend on AC. (Contributed by NM, 24-Mar-2004.) (Revised by Stefan O'Rear, 22-Feb-2015.)

Assertion

Ref	Expression
dfac3	⊢ (CHOICE ↔ ∀𝑥∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))

Distinct variable group:   𝑥,𝑓,𝑧

Proof of Theorem dfac3

Dummy variables 𝑦 𝑤 𝑣 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ac 10115	. 2 ⊢ (CHOICE ↔ ∀𝑦∃𝑓(𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦))
2		vex 3476	. . . . . . . 8 ⊢ 𝑥 ∈ V
3		vuniex 7733	. . . . . . . 8 ⊢ ∪ 𝑥 ∈ V
4	2, 3	xpex 7744	. . . . . . 7 ⊢ (𝑥 × ∪ 𝑥) ∈ V
5		simpl 481	. . . . . . . . . 10 ⊢ ((𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤) → 𝑤 ∈ 𝑥)
6		elunii 4914	. . . . . . . . . . 11 ⊢ ((𝑣 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥) → 𝑣 ∈ ∪ 𝑥)
7	6	ancoms 457	. . . . . . . . . 10 ⊢ ((𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤) → 𝑣 ∈ ∪ 𝑥)
8	5, 7	jca 510	. . . . . . . . 9 ⊢ ((𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤) → (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ ∪ 𝑥))
9	8	ssopab2i 5551	. . . . . . . 8 ⊢ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ ∪ 𝑥)}
10		df-xp 5683	. . . . . . . 8 ⊢ (𝑥 × ∪ 𝑥) = {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ ∪ 𝑥)}
11	9, 10	sseqtrri 4020	. . . . . . 7 ⊢ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ⊆ (𝑥 × ∪ 𝑥)
12	4, 11	ssexi 5323	. . . . . 6 ⊢ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∈ V
13		sseq2 4009	. . . . . . . 8 ⊢ (𝑦 = {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} → (𝑓 ⊆ 𝑦 ↔ 𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}))
14		dmeq 5904	. . . . . . . . 9 ⊢ (𝑦 = {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} → dom 𝑦 = dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)})
15	14	fneq2d 6644	. . . . . . . 8 ⊢ (𝑦 = {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} → (𝑓 Fn dom 𝑦 ↔ 𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}))
16	13, 15	anbi12d 629	. . . . . . 7 ⊢ (𝑦 = {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} → ((𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦) ↔ (𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∧ 𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)})))
17	16	exbidv 1922	. . . . . 6 ⊢ (𝑦 = {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} → (∃𝑓(𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦) ↔ ∃𝑓(𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∧ 𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)})))
18	12, 17	spcv 3596	. . . . 5 ⊢ (∀𝑦∃𝑓(𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦) → ∃𝑓(𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∧ 𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}))
19		fndm 6653	. . . . . . . . . . . . 13 ⊢ (𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} → dom 𝑓 = dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)})
20		dmopab 5916	. . . . . . . . . . . . . . . 16 ⊢ dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} = {𝑤 ∣ ∃𝑣(𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}
21	20	eleq2i 2823	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ↔ 𝑧 ∈ {𝑤 ∣ ∃𝑣(𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)})
22		vex 3476	. . . . . . . . . . . . . . . 16 ⊢ 𝑧 ∈ V
23		elequ1 2111	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑤 = 𝑧 → (𝑤 ∈ 𝑥 ↔ 𝑧 ∈ 𝑥))
24		eleq2 2820	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑤 = 𝑧 → (𝑣 ∈ 𝑤 ↔ 𝑣 ∈ 𝑧))
25	23, 24	anbi12d 629	. . . . . . . . . . . . . . . . 17 ⊢ (𝑤 = 𝑧 → ((𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤) ↔ (𝑧 ∈ 𝑥 ∧ 𝑣 ∈ 𝑧)))
26	25	exbidv 1922	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = 𝑧 → (∃𝑣(𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤) ↔ ∃𝑣(𝑧 ∈ 𝑥 ∧ 𝑣 ∈ 𝑧)))
27	22, 26	elab 3669	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ {𝑤 ∣ ∃𝑣(𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ↔ ∃𝑣(𝑧 ∈ 𝑥 ∧ 𝑣 ∈ 𝑧))
28		19.42v 1955	. . . . . . . . . . . . . . . 16 ⊢ (∃𝑣(𝑧 ∈ 𝑥 ∧ 𝑣 ∈ 𝑧) ↔ (𝑧 ∈ 𝑥 ∧ ∃𝑣 𝑣 ∈ 𝑧))
29		n0 4347	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 ≠ ∅ ↔ ∃𝑣 𝑣 ∈ 𝑧)
30	29	anbi2i 621	. . . . . . . . . . . . . . . 16 ⊢ ((𝑧 ∈ 𝑥 ∧ 𝑧 ≠ ∅) ↔ (𝑧 ∈ 𝑥 ∧ ∃𝑣 𝑣 ∈ 𝑧))
31	28, 30	bitr4i 277	. . . . . . . . . . . . . . 15 ⊢ (∃𝑣(𝑧 ∈ 𝑥 ∧ 𝑣 ∈ 𝑧) ↔ (𝑧 ∈ 𝑥 ∧ 𝑧 ≠ ∅))
32	21, 27, 31	3bitrri 297	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑥 ∧ 𝑧 ≠ ∅) ↔ 𝑧 ∈ dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)})
33		eleq2 2820	. . . . . . . . . . . . . 14 ⊢ (dom 𝑓 = dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} → (𝑧 ∈ dom 𝑓 ↔ 𝑧 ∈ dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}))
34	32, 33	bitr4id 289	. . . . . . . . . . . . 13 ⊢ (dom 𝑓 = dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} → ((𝑧 ∈ 𝑥 ∧ 𝑧 ≠ ∅) ↔ 𝑧 ∈ dom 𝑓))
35	19, 34	syl 17	. . . . . . . . . . . 12 ⊢ (𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} → ((𝑧 ∈ 𝑥 ∧ 𝑧 ≠ ∅) ↔ 𝑧 ∈ dom 𝑓))
36	35	adantl 480	. . . . . . . . . . 11 ⊢ ((𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∧ 𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}) → ((𝑧 ∈ 𝑥 ∧ 𝑧 ≠ ∅) ↔ 𝑧 ∈ dom 𝑓))
37		fnfun 6650	. . . . . . . . . . . 12 ⊢ (𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} → Fun 𝑓)
38		funfvima3 7241	. . . . . . . . . . . . 13 ⊢ ((Fun 𝑓 ∧ 𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}) → (𝑧 ∈ dom 𝑓 → (𝑓‘𝑧) ∈ ({⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} “ {𝑧})))
39	38	ancoms 457	. . . . . . . . . . . 12 ⊢ ((𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∧ Fun 𝑓) → (𝑧 ∈ dom 𝑓 → (𝑓‘𝑧) ∈ ({⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} “ {𝑧})))
40	37, 39	sylan2 591	. . . . . . . . . . 11 ⊢ ((𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∧ 𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}) → (𝑧 ∈ dom 𝑓 → (𝑓‘𝑧) ∈ ({⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} “ {𝑧})))
41	36, 40	sylbid 239	. . . . . . . . . 10 ⊢ ((𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∧ 𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}) → ((𝑧 ∈ 𝑥 ∧ 𝑧 ≠ ∅) → (𝑓‘𝑧) ∈ ({⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} “ {𝑧})))
42	41	imp 405	. . . . . . . . 9 ⊢ (((𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∧ 𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}) ∧ (𝑧 ∈ 𝑥 ∧ 𝑧 ≠ ∅)) → (𝑓‘𝑧) ∈ ({⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} “ {𝑧}))
43		imasng 6083	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ V → ({⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} “ {𝑧}) = {𝑢 ∣ 𝑧{⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}𝑢})
44	43	elv 3478	. . . . . . . . . . . . 13 ⊢ ({⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} “ {𝑧}) = {𝑢 ∣ 𝑧{⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}𝑢}
45		vex 3476	. . . . . . . . . . . . . . 15 ⊢ 𝑢 ∈ V
46		elequ1 2111	. . . . . . . . . . . . . . . 16 ⊢ (𝑣 = 𝑢 → (𝑣 ∈ 𝑧 ↔ 𝑢 ∈ 𝑧))
47	46	anbi2d 627	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = 𝑢 → ((𝑧 ∈ 𝑥 ∧ 𝑣 ∈ 𝑧) ↔ (𝑧 ∈ 𝑥 ∧ 𝑢 ∈ 𝑧)))
48		eqid 2730	. . . . . . . . . . . . . . 15 ⊢ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} = {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}
49	22, 45, 25, 47, 48	brab 5544	. . . . . . . . . . . . . 14 ⊢ (𝑧{⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}𝑢 ↔ (𝑧 ∈ 𝑥 ∧ 𝑢 ∈ 𝑧))
50	49	abbii 2800	. . . . . . . . . . . . 13 ⊢ {𝑢 ∣ 𝑧{⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}𝑢} = {𝑢 ∣ (𝑧 ∈ 𝑥 ∧ 𝑢 ∈ 𝑧)}
51	44, 50	eqtri 2758	. . . . . . . . . . . 12 ⊢ ({⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} “ {𝑧}) = {𝑢 ∣ (𝑧 ∈ 𝑥 ∧ 𝑢 ∈ 𝑧)}
52		ibar 527	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝑥 → (𝑢 ∈ 𝑧 ↔ (𝑧 ∈ 𝑥 ∧ 𝑢 ∈ 𝑧)))
53	52	eqabdv 2865	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ 𝑥 → 𝑧 = {𝑢 ∣ (𝑧 ∈ 𝑥 ∧ 𝑢 ∈ 𝑧)})
54	51, 53	eqtr4id 2789	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝑥 → ({⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} “ {𝑧}) = 𝑧)
55	54	eleq2d 2817	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝑥 → ((𝑓‘𝑧) ∈ ({⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} “ {𝑧}) ↔ (𝑓‘𝑧) ∈ 𝑧))
56	55	ad2antrl 724	. . . . . . . . 9 ⊢ (((𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∧ 𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}) ∧ (𝑧 ∈ 𝑥 ∧ 𝑧 ≠ ∅)) → ((𝑓‘𝑧) ∈ ({⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} “ {𝑧}) ↔ (𝑓‘𝑧) ∈ 𝑧))
57	42, 56	mpbid 231	. . . . . . . 8 ⊢ (((𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∧ 𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}) ∧ (𝑧 ∈ 𝑥 ∧ 𝑧 ≠ ∅)) → (𝑓‘𝑧) ∈ 𝑧)
58	57	exp32 419	. . . . . . 7 ⊢ ((𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∧ 𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}) → (𝑧 ∈ 𝑥 → (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧)))
59	58	ralrimiv 3143	. . . . . 6 ⊢ ((𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∧ 𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}) → ∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))
60	59	eximi 1835	. . . . 5 ⊢ (∃𝑓(𝑓 ⊆ {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)} ∧ 𝑓 Fn dom {⟨𝑤, 𝑣⟩ ∣ (𝑤 ∈ 𝑥 ∧ 𝑣 ∈ 𝑤)}) → ∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))
61	18, 60	syl 17	. . . 4 ⊢ (∀𝑦∃𝑓(𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦) → ∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))
62	61	alrimiv 1928	. . 3 ⊢ (∀𝑦∃𝑓(𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦) → ∀𝑥∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))
63		eqid 2730	. . . . 5 ⊢ (𝑤 ∈ dom 𝑦 ↦ (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢})) = (𝑤 ∈ dom 𝑦 ↦ (𝑓‘{𝑢 ∣ 𝑤𝑦𝑢}))
64	63	aceq3lem 10119	. . . 4 ⊢ (∀𝑥∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∃𝑓(𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦))
65	64	alrimiv 1928	. . 3 ⊢ (∀𝑥∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧) → ∀𝑦∃𝑓(𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦))
66	62, 65	impbii 208	. 2 ⊢ (∀𝑦∃𝑓(𝑓 ⊆ 𝑦 ∧ 𝑓 Fn dom 𝑦) ↔ ∀𝑥∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))
67	1, 66	bitri 274	1 ⊢ (CHOICE ↔ ∀𝑥∃𝑓∀𝑧 ∈ 𝑥 (𝑧 ≠ ∅ → (𝑓‘𝑧) ∈ 𝑧))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394  ∀wal 1537   = wceq 1539  ∃wex 1779   ∈ wcel 2104  {cab 2707   ≠ wne 2938  ∀wral 3059  Vcvv 3472   ⊆ wss 3949  ∅c0 4323  {csn 4629  ∪ cuni 4909   class class class wbr 5149  {copab 5211   ↦ cmpt 5232   × cxp 5675  dom cdm 5677   “ cima 5680  Fun wfun 6538   Fn wfn 6539  ‘cfv 6544  CHOICEwac 10114

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7729

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3431  df-v 3474  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-fv 6552  df-ac 10115

This theorem is referenced by:  dfac4  10121  dfac5  10127  dfac2a  10128  dfac2b  10129  dfac8  10134  dfac9  10135  ac4  10474  dfac11  42108