Theorem permac8prim 45941

Description: The Axiom of Choice ac8prim 45918 holds in permutation models. Part of Exercise II.9.3 of [Kunen2] p. 149. Note that ax-ac 10509 requires Regularity for its derivation from the usual Axiom of Choice and does not necessarily hold in permutation models. (Contributed by Eric Schmidt, 16-Nov-2025.)

Hypotheses

Ref	Expression
permmodel.1	⊢ 𝐹:V–1-1-onto→V
permmodel.2	⊢ 𝑅 = (◡𝐹 ∘ E )

Assertion

Ref	Expression
permac8prim	⊢ ((∀𝑧(𝑧𝑅𝑥 → ∃𝑤 𝑤𝑅𝑧) ∧ ∀𝑧∀𝑤((𝑧𝑅𝑥 ∧ 𝑤𝑅𝑥) → (¬ 𝑧 = 𝑤 → ∀𝑦(𝑦𝑅𝑧 → ¬ 𝑦𝑅𝑤)))) → ∃𝑦∀𝑧(𝑧𝑅𝑥 → ∃𝑤∀𝑣((𝑣𝑅𝑧 ∧ 𝑣𝑅𝑦) ↔ 𝑣 = 𝑤)))

Distinct variable groups:   𝑥,𝑧,𝑦,𝑤,𝑣   𝑦,𝐹,𝑧,𝑤,𝑣

Allowed substitution hints:   𝑅(𝑥, 𝑦, 𝑧, 𝑤, 𝑣)   𝐹(𝑥)

Proof of Theorem permac8prim

Dummy variables 𝑞 𝑟 𝑠 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ral 3077	. . . 4 ⊢ (∀𝑧 ∈ (𝐹‘𝑥)(𝐹‘𝑧) ≠ ∅ ↔ ∀𝑧(𝑧 ∈ (𝐹‘𝑥) → (𝐹‘𝑧) ≠ ∅))
2		permmodel.1	. . . . . 6 ⊢ 𝐹:V–1-1-onto→V
3		f1ofn 6813	. . . . . 6 ⊢ (𝐹:V–1-1-onto→V → 𝐹 Fn V)
4	2, 3	ax-mp 5	. . . . 5 ⊢ 𝐹 Fn V
5		ssv 3954	. . . . 5 ⊢ (𝐹‘𝑥) ⊆ V
6		neeq1 3017	. . . . . 6 ⊢ (𝑡 = (𝐹‘𝑧) → (𝑡 ≠ ∅ ↔ (𝐹‘𝑧) ≠ ∅))
7	6	ralima 7231	. . . . 5 ⊢ ((𝐹 Fn V ∧ (𝐹‘𝑥) ⊆ V) → (∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))𝑡 ≠ ∅ ↔ ∀𝑧 ∈ (𝐹‘𝑥)(𝐹‘𝑧) ≠ ∅))
8	4, 5, 7	mp2an 705	. . . 4 ⊢ (∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))𝑡 ≠ ∅ ↔ ∀𝑧 ∈ (𝐹‘𝑥)(𝐹‘𝑧) ≠ ∅)
9		permmodel.2	. . . . . . 7 ⊢ 𝑅 = (◡𝐹 ∘ E )
10		vex 3454	. . . . . . 7 ⊢ 𝑧 ∈ V
11		vex 3454	. . . . . . 7 ⊢ 𝑥 ∈ V
12	2, 9, 10, 11	brpermmodel 45930	. . . . . 6 ⊢ (𝑧𝑅𝑥 ↔ 𝑧 ∈ (𝐹‘𝑥))
13		vex 3454	. . . . . . . . 9 ⊢ 𝑤 ∈ V
14	2, 9, 13, 10	brpermmodel 45930	. . . . . . . 8 ⊢ (𝑤𝑅𝑧 ↔ 𝑤 ∈ (𝐹‘𝑧))
15	14	exbii 1881	. . . . . . 7 ⊢ (∃𝑤 𝑤𝑅𝑧 ↔ ∃𝑤 𝑤 ∈ (𝐹‘𝑧))
16		n0 4299	. . . . . . 7 ⊢ ((𝐹‘𝑧) ≠ ∅ ↔ ∃𝑤 𝑤 ∈ (𝐹‘𝑧))
17	15, 16	bitr4i 281	. . . . . 6 ⊢ (∃𝑤 𝑤𝑅𝑧 ↔ (𝐹‘𝑧) ≠ ∅)
18	12, 17	imbi12i 353	. . . . 5 ⊢ ((𝑧𝑅𝑥 → ∃𝑤 𝑤𝑅𝑧) ↔ (𝑧 ∈ (𝐹‘𝑥) → (𝐹‘𝑧) ≠ ∅))
19	18	albii 1852	. . . 4 ⊢ (∀𝑧(𝑧𝑅𝑥 → ∃𝑤 𝑤𝑅𝑧) ↔ ∀𝑧(𝑧 ∈ (𝐹‘𝑥) → (𝐹‘𝑧) ≠ ∅))
20	1, 8, 19	3bitr4i 306	. . 3 ⊢ (∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))𝑡 ≠ ∅ ↔ ∀𝑧(𝑧𝑅𝑥 → ∃𝑤 𝑤𝑅𝑧))
21		neeq2 3018	. . . . . . . . 9 ⊢ (𝑞 = (𝐹‘𝑤) → (𝑡 ≠ 𝑞 ↔ 𝑡 ≠ (𝐹‘𝑤)))
22		ineq2 4159	. . . . . . . . . 10 ⊢ (𝑞 = (𝐹‘𝑤) → (𝑡 ∩ 𝑞) = (𝑡 ∩ (𝐹‘𝑤)))
23	22	eqeq1d 2762	. . . . . . . . 9 ⊢ (𝑞 = (𝐹‘𝑤) → ((𝑡 ∩ 𝑞) = ∅ ↔ (𝑡 ∩ (𝐹‘𝑤)) = ∅))
24	21, 23	imbi12d 347	. . . . . . . 8 ⊢ (𝑞 = (𝐹‘𝑤) → ((𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅) ↔ (𝑡 ≠ (𝐹‘𝑤) → (𝑡 ∩ (𝐹‘𝑤)) = ∅)))
25	24	ralima 7231	. . . . . . 7 ⊢ ((𝐹 Fn V ∧ (𝐹‘𝑥) ⊆ V) → (∀𝑞 ∈ (𝐹 “ (𝐹‘𝑥))(𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅) ↔ ∀𝑤 ∈ (𝐹‘𝑥)(𝑡 ≠ (𝐹‘𝑤) → (𝑡 ∩ (𝐹‘𝑤)) = ∅)))
26	4, 5, 25	mp2an 705	. . . . . 6 ⊢ (∀𝑞 ∈ (𝐹 “ (𝐹‘𝑥))(𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅) ↔ ∀𝑤 ∈ (𝐹‘𝑥)(𝑡 ≠ (𝐹‘𝑤) → (𝑡 ∩ (𝐹‘𝑤)) = ∅))
27	26	ralbii 3108	. . . . 5 ⊢ (∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∀𝑞 ∈ (𝐹 “ (𝐹‘𝑥))(𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅) ↔ ∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∀𝑤 ∈ (𝐹‘𝑥)(𝑡 ≠ (𝐹‘𝑤) → (𝑡 ∩ (𝐹‘𝑤)) = ∅))
28		neeq1 3017	. . . . . . . . 9 ⊢ (𝑡 = (𝐹‘𝑧) → (𝑡 ≠ (𝐹‘𝑤) ↔ (𝐹‘𝑧) ≠ (𝐹‘𝑤)))
29		ineq1 4158	. . . . . . . . . 10 ⊢ (𝑡 = (𝐹‘𝑧) → (𝑡 ∩ (𝐹‘𝑤)) = ((𝐹‘𝑧) ∩ (𝐹‘𝑤)))
30	29	eqeq1d 2762	. . . . . . . . 9 ⊢ (𝑡 = (𝐹‘𝑧) → ((𝑡 ∩ (𝐹‘𝑤)) = ∅ ↔ ((𝐹‘𝑧) ∩ (𝐹‘𝑤)) = ∅))
31	28, 30	imbi12d 347	. . . . . . . 8 ⊢ (𝑡 = (𝐹‘𝑧) → ((𝑡 ≠ (𝐹‘𝑤) → (𝑡 ∩ (𝐹‘𝑤)) = ∅) ↔ ((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ((𝐹‘𝑧) ∩ (𝐹‘𝑤)) = ∅)))
32	31	ralbidv 3185	. . . . . . 7 ⊢ (𝑡 = (𝐹‘𝑧) → (∀𝑤 ∈ (𝐹‘𝑥)(𝑡 ≠ (𝐹‘𝑤) → (𝑡 ∩ (𝐹‘𝑤)) = ∅) ↔ ∀𝑤 ∈ (𝐹‘𝑥)((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ((𝐹‘𝑧) ∩ (𝐹‘𝑤)) = ∅)))
33	32	ralima 7231	. . . . . 6 ⊢ ((𝐹 Fn V ∧ (𝐹‘𝑥) ⊆ V) → (∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∀𝑤 ∈ (𝐹‘𝑥)(𝑡 ≠ (𝐹‘𝑤) → (𝑡 ∩ (𝐹‘𝑤)) = ∅) ↔ ∀𝑧 ∈ (𝐹‘𝑥)∀𝑤 ∈ (𝐹‘𝑥)((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ((𝐹‘𝑧) ∩ (𝐹‘𝑤)) = ∅)))
34	4, 5, 33	mp2an 705	. . . . 5 ⊢ (∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∀𝑤 ∈ (𝐹‘𝑥)(𝑡 ≠ (𝐹‘𝑤) → (𝑡 ∩ (𝐹‘𝑤)) = ∅) ↔ ∀𝑧 ∈ (𝐹‘𝑥)∀𝑤 ∈ (𝐹‘𝑥)((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ((𝐹‘𝑧) ∩ (𝐹‘𝑤)) = ∅))
35		r2al 3198	. . . . 5 ⊢ (∀𝑧 ∈ (𝐹‘𝑥)∀𝑤 ∈ (𝐹‘𝑥)((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ((𝐹‘𝑧) ∩ (𝐹‘𝑤)) = ∅) ↔ ∀𝑧∀𝑤((𝑧 ∈ (𝐹‘𝑥) ∧ 𝑤 ∈ (𝐹‘𝑥)) → ((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ((𝐹‘𝑧) ∩ (𝐹‘𝑤)) = ∅)))
36	27, 34, 35	3bitri 300	. . . 4 ⊢ (∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∀𝑞 ∈ (𝐹 “ (𝐹‘𝑥))(𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅) ↔ ∀𝑧∀𝑤((𝑧 ∈ (𝐹‘𝑥) ∧ 𝑤 ∈ (𝐹‘𝑥)) → ((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ((𝐹‘𝑧) ∩ (𝐹‘𝑤)) = ∅)))
37	2, 9, 13, 11	brpermmodel 45930	. . . . . . 7 ⊢ (𝑤𝑅𝑥 ↔ 𝑤 ∈ (𝐹‘𝑥))
38	12, 37	anbi12i 640	. . . . . 6 ⊢ ((𝑧𝑅𝑥 ∧ 𝑤𝑅𝑥) ↔ (𝑧 ∈ (𝐹‘𝑥) ∧ 𝑤 ∈ (𝐹‘𝑥)))
39		df-ne 2956	. . . . . . . 8 ⊢ ((𝐹‘𝑧) ≠ (𝐹‘𝑤) ↔ ¬ (𝐹‘𝑧) = (𝐹‘𝑤))
40		f1of1 6811	. . . . . . . . . . . 12 ⊢ (𝐹:V–1-1-onto→V → 𝐹:V–1-1→V)
41	2, 40	ax-mp 5	. . . . . . . . . . 11 ⊢ 𝐹:V–1-1→V
42		f1fveq 7254	. . . . . . . . . . 11 ⊢ ((𝐹:V–1-1→V ∧ (𝑧 ∈ V ∧ 𝑤 ∈ V)) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ 𝑧 = 𝑤))
43	41, 42	mpan 703	. . . . . . . . . 10 ⊢ ((𝑧 ∈ V ∧ 𝑤 ∈ V) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ 𝑧 = 𝑤))
44	43	el2v 3457	. . . . . . . . 9 ⊢ ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ 𝑧 = 𝑤)
45	44	notbii 323	. . . . . . . 8 ⊢ (¬ (𝐹‘𝑧) = (𝐹‘𝑤) ↔ ¬ 𝑧 = 𝑤)
46	39, 45	bitr2i 279	. . . . . . 7 ⊢ (¬ 𝑧 = 𝑤 ↔ (𝐹‘𝑧) ≠ (𝐹‘𝑤))
47		vex 3454	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
48	2, 9, 47, 10	brpermmodel 45930	. . . . . . . . . 10 ⊢ (𝑦𝑅𝑧 ↔ 𝑦 ∈ (𝐹‘𝑧))
49	2, 9, 47, 13	brpermmodel 45930	. . . . . . . . . . 11 ⊢ (𝑦𝑅𝑤 ↔ 𝑦 ∈ (𝐹‘𝑤))
50	49	notbii 323	. . . . . . . . . 10 ⊢ (¬ 𝑦𝑅𝑤 ↔ ¬ 𝑦 ∈ (𝐹‘𝑤))
51	48, 50	imbi12i 353	. . . . . . . . 9 ⊢ ((𝑦𝑅𝑧 → ¬ 𝑦𝑅𝑤) ↔ (𝑦 ∈ (𝐹‘𝑧) → ¬ 𝑦 ∈ (𝐹‘𝑤)))
52	51	albii 1852	. . . . . . . 8 ⊢ (∀𝑦(𝑦𝑅𝑧 → ¬ 𝑦𝑅𝑤) ↔ ∀𝑦(𝑦 ∈ (𝐹‘𝑧) → ¬ 𝑦 ∈ (𝐹‘𝑤)))
53		disj1 4404	. . . . . . . 8 ⊢ (((𝐹‘𝑧) ∩ (𝐹‘𝑤)) = ∅ ↔ ∀𝑦(𝑦 ∈ (𝐹‘𝑧) → ¬ 𝑦 ∈ (𝐹‘𝑤)))
54	52, 53	bitr4i 281	. . . . . . 7 ⊢ (∀𝑦(𝑦𝑅𝑧 → ¬ 𝑦𝑅𝑤) ↔ ((𝐹‘𝑧) ∩ (𝐹‘𝑤)) = ∅)
55	46, 54	imbi12i 353	. . . . . 6 ⊢ ((¬ 𝑧 = 𝑤 → ∀𝑦(𝑦𝑅𝑧 → ¬ 𝑦𝑅𝑤)) ↔ ((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ((𝐹‘𝑧) ∩ (𝐹‘𝑤)) = ∅))
56	38, 55	imbi12i 353	. . . . 5 ⊢ (((𝑧𝑅𝑥 ∧ 𝑤𝑅𝑥) → (¬ 𝑧 = 𝑤 → ∀𝑦(𝑦𝑅𝑧 → ¬ 𝑦𝑅𝑤))) ↔ ((𝑧 ∈ (𝐹‘𝑥) ∧ 𝑤 ∈ (𝐹‘𝑥)) → ((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ((𝐹‘𝑧) ∩ (𝐹‘𝑤)) = ∅)))
57	56	2albii 1853	. . . 4 ⊢ (∀𝑧∀𝑤((𝑧𝑅𝑥 ∧ 𝑤𝑅𝑥) → (¬ 𝑧 = 𝑤 → ∀𝑦(𝑦𝑅𝑧 → ¬ 𝑦𝑅𝑤))) ↔ ∀𝑧∀𝑤((𝑧 ∈ (𝐹‘𝑥) ∧ 𝑤 ∈ (𝐹‘𝑥)) → ((𝐹‘𝑧) ≠ (𝐹‘𝑤) → ((𝐹‘𝑧) ∩ (𝐹‘𝑤)) = ∅)))
58	36, 57	bitr4i 281	. . 3 ⊢ (∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∀𝑞 ∈ (𝐹 “ (𝐹‘𝑥))(𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅) ↔ ∀𝑧∀𝑤((𝑧𝑅𝑥 ∧ 𝑤𝑅𝑥) → (¬ 𝑧 = 𝑤 → ∀𝑦(𝑦𝑅𝑧 → ¬ 𝑦𝑅𝑤))))
59		f1ofun 6814	. . . . 5 ⊢ (𝐹:V–1-1-onto→V → Fun 𝐹)
60		fvex 6886	. . . . . 6 ⊢ (𝐹‘𝑥) ∈ V
61	60	funimaex 6615	. . . . 5 ⊢ (Fun 𝐹 → (𝐹 “ (𝐹‘𝑥)) ∈ V)
62	2, 59, 61	mp2b 10	. . . 4 ⊢ (𝐹 “ (𝐹‘𝑥)) ∈ V
63		raleq 3316	. . . . . 6 ⊢ (𝑟 = (𝐹 “ (𝐹‘𝑥)) → (∀𝑡 ∈ 𝑟 𝑡 ≠ ∅ ↔ ∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))𝑡 ≠ ∅))
64		raleq 3316	. . . . . . 7 ⊢ (𝑟 = (𝐹 “ (𝐹‘𝑥)) → (∀𝑞 ∈ 𝑟 (𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅) ↔ ∀𝑞 ∈ (𝐹 “ (𝐹‘𝑥))(𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅)))
65	64	raleqbi1dv 3329	. . . . . 6 ⊢ (𝑟 = (𝐹 “ (𝐹‘𝑥)) → (∀𝑡 ∈ 𝑟 ∀𝑞 ∈ 𝑟 (𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅) ↔ ∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∀𝑞 ∈ (𝐹 “ (𝐹‘𝑥))(𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅)))
66	63, 65	anbi12d 644	. . . . 5 ⊢ (𝑟 = (𝐹 “ (𝐹‘𝑥)) → ((∀𝑡 ∈ 𝑟 𝑡 ≠ ∅ ∧ ∀𝑡 ∈ 𝑟 ∀𝑞 ∈ 𝑟 (𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅)) ↔ (∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))𝑡 ≠ ∅ ∧ ∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∀𝑞 ∈ (𝐹 “ (𝐹‘𝑥))(𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅))))
67		raleq 3316	. . . . . 6 ⊢ (𝑟 = (𝐹 “ (𝐹‘𝑥)) → (∀𝑡 ∈ 𝑟 ∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠) ↔ ∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠)))
68	67	exbidv 1954	. . . . 5 ⊢ (𝑟 = (𝐹 “ (𝐹‘𝑥)) → (∃𝑠∀𝑡 ∈ 𝑟 ∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠) ↔ ∃𝑠∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠)))
69	66, 68	imbi12d 347	. . . 4 ⊢ (𝑟 = (𝐹 “ (𝐹‘𝑥)) → (((∀𝑡 ∈ 𝑟 𝑡 ≠ ∅ ∧ ∀𝑡 ∈ 𝑟 ∀𝑞 ∈ 𝑟 (𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅)) → ∃𝑠∀𝑡 ∈ 𝑟 ∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠)) ↔ ((∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))𝑡 ≠ ∅ ∧ ∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∀𝑞 ∈ (𝐹 “ (𝐹‘𝑥))(𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅)) → ∃𝑠∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠))))
70		ac8 10542	. . . 4 ⊢ ((∀𝑡 ∈ 𝑟 𝑡 ≠ ∅ ∧ ∀𝑡 ∈ 𝑟 ∀𝑞 ∈ 𝑟 (𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅)) → ∃𝑠∀𝑡 ∈ 𝑟 ∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠))
71	62, 69, 70	vtocl 3520	. . 3 ⊢ ((∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))𝑡 ≠ ∅ ∧ ∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∀𝑞 ∈ (𝐹 “ (𝐹‘𝑥))(𝑡 ≠ 𝑞 → (𝑡 ∩ 𝑞) = ∅)) → ∃𝑠∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠))
72	20, 58, 71	syl2anbr 611	. 2 ⊢ ((∀𝑧(𝑧𝑅𝑥 → ∃𝑤 𝑤𝑅𝑧) ∧ ∀𝑧∀𝑤((𝑧𝑅𝑥 ∧ 𝑤𝑅𝑥) → (¬ 𝑧 = 𝑤 → ∀𝑦(𝑦𝑅𝑧 → ¬ 𝑦𝑅𝑤)))) → ∃𝑠∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠))
73		ineq1 4158	. . . . . . . . 9 ⊢ (𝑡 = (𝐹‘𝑧) → (𝑡 ∩ 𝑠) = ((𝐹‘𝑧) ∩ 𝑠))
74	73	eleq2d 2846	. . . . . . . 8 ⊢ (𝑡 = (𝐹‘𝑧) → (𝑣 ∈ (𝑡 ∩ 𝑠) ↔ 𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠)))
75	74	eubidv 2611	. . . . . . 7 ⊢ (𝑡 = (𝐹‘𝑧) → (∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠) ↔ ∃!𝑣 𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠)))
76	75	ralima 7231	. . . . . 6 ⊢ ((𝐹 Fn V ∧ (𝐹‘𝑥) ⊆ V) → (∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠) ↔ ∀𝑧 ∈ (𝐹‘𝑥)∃!𝑣 𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠)))
77	4, 5, 76	mp2an 705	. . . . 5 ⊢ (∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠) ↔ ∀𝑧 ∈ (𝐹‘𝑥)∃!𝑣 𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠))
78		df-ral 3077	. . . . 5 ⊢ (∀𝑧 ∈ (𝐹‘𝑥)∃!𝑣 𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠) ↔ ∀𝑧(𝑧 ∈ (𝐹‘𝑥) → ∃!𝑣 𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠)))
79	77, 78	bitri 278	. . . 4 ⊢ (∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠) ↔ ∀𝑧(𝑧 ∈ (𝐹‘𝑥) → ∃!𝑣 𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠)))
80		fvex 6886	. . . . 5 ⊢ (◡𝐹‘𝑠) ∈ V
81	12	a1i 11	. . . . . . 7 ⊢ (𝑦 = (◡𝐹‘𝑠) → (𝑧𝑅𝑥 ↔ 𝑧 ∈ (𝐹‘𝑥)))
82		vex 3454	. . . . . . . . . . . . . 14 ⊢ 𝑣 ∈ V
83	2, 9, 82, 10	brpermmodel 45930	. . . . . . . . . . . . 13 ⊢ (𝑣𝑅𝑧 ↔ 𝑣 ∈ (𝐹‘𝑧))
84	83	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑦 = (◡𝐹‘𝑠) → (𝑣𝑅𝑧 ↔ 𝑣 ∈ (𝐹‘𝑧)))
85		breq2 5106	. . . . . . . . . . . . 13 ⊢ (𝑦 = (◡𝐹‘𝑠) → (𝑣𝑅𝑦 ↔ 𝑣𝑅(◡𝐹‘𝑠)))
86		vex 3454	. . . . . . . . . . . . . 14 ⊢ 𝑠 ∈ V
87	2, 9, 82, 86	brpermmodelcnv 45931	. . . . . . . . . . . . 13 ⊢ (𝑣𝑅(◡𝐹‘𝑠) ↔ 𝑣 ∈ 𝑠)
88	85, 87	bitrdi 290	. . . . . . . . . . . 12 ⊢ (𝑦 = (◡𝐹‘𝑠) → (𝑣𝑅𝑦 ↔ 𝑣 ∈ 𝑠))
89	84, 88	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑦 = (◡𝐹‘𝑠) → ((𝑣𝑅𝑧 ∧ 𝑣𝑅𝑦) ↔ (𝑣 ∈ (𝐹‘𝑧) ∧ 𝑣 ∈ 𝑠)))
90	89	bibi1d 346	. . . . . . . . . 10 ⊢ (𝑦 = (◡𝐹‘𝑠) → (((𝑣𝑅𝑧 ∧ 𝑣𝑅𝑦) ↔ 𝑣 = 𝑤) ↔ ((𝑣 ∈ (𝐹‘𝑧) ∧ 𝑣 ∈ 𝑠) ↔ 𝑣 = 𝑤)))
91	90	albidv 1953	. . . . . . . . 9 ⊢ (𝑦 = (◡𝐹‘𝑠) → (∀𝑣((𝑣𝑅𝑧 ∧ 𝑣𝑅𝑦) ↔ 𝑣 = 𝑤) ↔ ∀𝑣((𝑣 ∈ (𝐹‘𝑧) ∧ 𝑣 ∈ 𝑠) ↔ 𝑣 = 𝑤)))
92	91	exbidv 1954	. . . . . . . 8 ⊢ (𝑦 = (◡𝐹‘𝑠) → (∃𝑤∀𝑣((𝑣𝑅𝑧 ∧ 𝑣𝑅𝑦) ↔ 𝑣 = 𝑤) ↔ ∃𝑤∀𝑣((𝑣 ∈ (𝐹‘𝑧) ∧ 𝑣 ∈ 𝑠) ↔ 𝑣 = 𝑤)))
93		elin 3914	. . . . . . . . . 10 ⊢ (𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠) ↔ (𝑣 ∈ (𝐹‘𝑧) ∧ 𝑣 ∈ 𝑠))
94	93	eubii 2610	. . . . . . . . 9 ⊢ (∃!𝑣 𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠) ↔ ∃!𝑣(𝑣 ∈ (𝐹‘𝑧) ∧ 𝑣 ∈ 𝑠))
95		eu6 2599	. . . . . . . . 9 ⊢ (∃!𝑣(𝑣 ∈ (𝐹‘𝑧) ∧ 𝑣 ∈ 𝑠) ↔ ∃𝑤∀𝑣((𝑣 ∈ (𝐹‘𝑧) ∧ 𝑣 ∈ 𝑠) ↔ 𝑣 = 𝑤))
96	94, 95	bitri 278	. . . . . . . 8 ⊢ (∃!𝑣 𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠) ↔ ∃𝑤∀𝑣((𝑣 ∈ (𝐹‘𝑧) ∧ 𝑣 ∈ 𝑠) ↔ 𝑣 = 𝑤))
97	92, 96	bitr4di 292	. . . . . . 7 ⊢ (𝑦 = (◡𝐹‘𝑠) → (∃𝑤∀𝑣((𝑣𝑅𝑧 ∧ 𝑣𝑅𝑦) ↔ 𝑣 = 𝑤) ↔ ∃!𝑣 𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠)))
98	81, 97	imbi12d 347	. . . . . 6 ⊢ (𝑦 = (◡𝐹‘𝑠) → ((𝑧𝑅𝑥 → ∃𝑤∀𝑣((𝑣𝑅𝑧 ∧ 𝑣𝑅𝑦) ↔ 𝑣 = 𝑤)) ↔ (𝑧 ∈ (𝐹‘𝑥) → ∃!𝑣 𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠))))
99	98	albidv 1953	. . . . 5 ⊢ (𝑦 = (◡𝐹‘𝑠) → (∀𝑧(𝑧𝑅𝑥 → ∃𝑤∀𝑣((𝑣𝑅𝑧 ∧ 𝑣𝑅𝑦) ↔ 𝑣 = 𝑤)) ↔ ∀𝑧(𝑧 ∈ (𝐹‘𝑥) → ∃!𝑣 𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠))))
100	80, 99	spcev 3560	. . . 4 ⊢ (∀𝑧(𝑧 ∈ (𝐹‘𝑥) → ∃!𝑣 𝑣 ∈ ((𝐹‘𝑧) ∩ 𝑠)) → ∃𝑦∀𝑧(𝑧𝑅𝑥 → ∃𝑤∀𝑣((𝑣𝑅𝑧 ∧ 𝑣𝑅𝑦) ↔ 𝑣 = 𝑤)))
101	79, 100	sylbi 220	. . 3 ⊢ (∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠) → ∃𝑦∀𝑧(𝑧𝑅𝑥 → ∃𝑤∀𝑣((𝑣𝑅𝑧 ∧ 𝑣𝑅𝑦) ↔ 𝑣 = 𝑤)))
102	101	exlimiv 1963	. 2 ⊢ (∃𝑠∀𝑡 ∈ (𝐹 “ (𝐹‘𝑥))∃!𝑣 𝑣 ∈ (𝑡 ∩ 𝑠) → ∃𝑦∀𝑧(𝑧𝑅𝑥 → ∃𝑤∀𝑣((𝑣𝑅𝑧 ∧ 𝑣𝑅𝑦) ↔ 𝑣 = 𝑤)))
103	72, 102	syl 18	1 ⊢ ((∀𝑧(𝑧𝑅𝑥 → ∃𝑤 𝑤𝑅𝑧) ∧ ∀𝑧∀𝑤((𝑧𝑅𝑥 ∧ 𝑤𝑅𝑥) → (¬ 𝑧 = 𝑤 → ∀𝑦(𝑦𝑅𝑧 → ¬ 𝑦𝑅𝑤)))) → ∃𝑦∀𝑧(𝑧𝑅𝑥 → ∃𝑤∀𝑣((𝑣𝑅𝑧 ∧ 𝑣𝑅𝑦) ↔ 𝑣 = 𝑤)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃!weu 2593   ≠ wne 2955  ∀wral 3076  Vcvv 3450   ∩ cin 3897   ⊆ wss 3898  ∅c0 4278   class class class wbr 5102   E cep 5546  ^◡ccnv 5646   “ cima 5650   ∘ ccom 5651  Fun wfun 6521   Fn wfn 6522  –1-1→wf1 6524  –1-1-onto→wf1o 6526  ‘cfv 6527

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734  ax-ac2 10513

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-eprel 5547  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-ac 10167

This theorem is used by: (None)