Theorem onvf1odlem4 35288

Description: Lemma for onvf1od 35289. If the range of 𝐹 does not exist, then it must equal the universe. (Contributed by BTernaryTau, 4-Dec-2025.)

Hypotheses

Ref	Expression
onvf1odlem4.1	⊢ (𝜑 → ∀𝑧(𝑧 ≠ ∅ → (𝐺‘𝑧) ∈ 𝑧))
onvf1odlem4.2	⊢ 𝑀 = ∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ ran 𝑤}
onvf1odlem4.3	⊢ 𝑁 = (𝐺‘((𝑅1‘𝑀) ∖ ran 𝑤))
onvf1odlem4.4	⊢ 𝐹 = recs((𝑤 ∈ V ↦ 𝑁))
onvf1odlem4.5	⊢ 𝐵 = ∩ {𝑢 ∈ On ∣ ∃𝑣 ∈ (𝑅1‘𝑢) ¬ 𝑣 ∈ (𝐹 “ 𝑡)}
onvf1odlem4.6	⊢ 𝐶 = (𝐺‘((𝑅1‘𝐵) ∖ (𝐹 “ 𝑡)))

Assertion

Ref	Expression
onvf1odlem4	⊢ (𝜑 → (¬ ran 𝐹 ∈ V → ran 𝐹 = V))

Distinct variable groups:   𝑧,𝐵   𝑧,𝐺   𝑤,𝐺   𝑥,𝑤,𝑦   𝑡,𝐹,𝑧   𝜑,𝑡,𝑣   𝑢,𝐹,𝑣,𝑡

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤,𝑢)   𝐵(𝑥,𝑦,𝑤,𝑣,𝑢,𝑡)   𝐶(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝑡)   𝐹(𝑥,𝑦,𝑤)   𝐺(𝑥,𝑦,𝑣,𝑢,𝑡)   𝑀(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝑡)   𝑁(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝑡)

Proof of Theorem onvf1odlem4

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

Step	Hyp	Ref	Expression
1		eqv 3439	. . . 4 ⊢ (ran 𝐹 = V ↔ ∀𝑣 𝑣 ∈ ran 𝐹)
2		exnal 1829	. . . . 5 ⊢ (∃𝑣 ¬ 𝑣 ∈ ran 𝐹 ↔ ¬ ∀𝑣 𝑣 ∈ ran 𝐹)
3		onvf1odlem4.4	. . . . . . . . . . . . . . . . . 18 ⊢ 𝐹 = recs((𝑤 ∈ V ↦ 𝑁))
4	3	tfr1 8336	. . . . . . . . . . . . . . . . 17 ⊢ 𝐹 Fn On
5		fvelrnb 6900	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹 Fn On → (𝑠 ∈ ran 𝐹 ↔ ∃𝑡 ∈ On (𝐹‘𝑡) = 𝑠))
6	4, 5	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 ∈ ran 𝐹 ↔ ∃𝑡 ∈ On (𝐹‘𝑡) = 𝑠)
7		onvf1odlem4.2	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ 𝑀 = ∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ ran 𝑤}
8		onvf1odlem4.3	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ 𝑁 = (𝐺‘((𝑅1‘𝑀) ∖ ran 𝑤))
9		onvf1odlem4.5	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ 𝐵 = ∩ {𝑢 ∈ On ∣ ∃𝑣 ∈ (𝑅1‘𝑢) ¬ 𝑣 ∈ (𝐹 “ 𝑡)}
10		onvf1odlem4.6	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ 𝐶 = (𝐺‘((𝑅1‘𝐵) ∖ (𝐹 “ 𝑡)))
11	7, 8, 3, 9, 10	onvf1odlem3 35287	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑡 ∈ On → (𝐹‘𝑡) = 𝐶)
12	11	adantl 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑡 ∈ On) → (𝐹‘𝑡) = 𝐶)
13		fnfun 6598	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐹 Fn On → Fun 𝐹)
14	4, 13	ax-mp 5	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ Fun 𝐹
15		vex 3433	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ 𝑡 ∈ V
16	15	funimaex 6586	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (Fun 𝐹 → (𝐹 “ 𝑡) ∈ V)
17	14, 16	ax-mp 5	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐹 “ 𝑡) ∈ V
18		onvf1odlem4.1	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → ∀𝑧(𝑧 ≠ ∅ → (𝐺‘𝑧) ∈ 𝑧))
19	18, 9, 10	onvf1odlem2 35286	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → ((𝐹 “ 𝑡) ∈ V → 𝐶 ∈ ((𝑅1‘𝐵) ∖ (𝐹 “ 𝑡))))
20	17, 19	mpi 20	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → 𝐶 ∈ ((𝑅1‘𝐵) ∖ (𝐹 “ 𝑡)))
21	20	eldifad 3901	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → 𝐶 ∈ (𝑅1‘𝐵))
22	21	adantr 480	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑡 ∈ On) → 𝐶 ∈ (𝑅1‘𝐵))
23	12, 22	eqeltrd 2836	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑡 ∈ On) → (𝐹‘𝑡) ∈ (𝑅1‘𝐵))
24		rankr1ai 9722	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹‘𝑡) ∈ (𝑅1‘𝐵) → (rank‘(𝐹‘𝑡)) ∈ 𝐵)
25		onvf1odlem1 35285	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐹 “ 𝑡) ∈ V → ∃𝑢 ∈ On ∃𝑣 ∈ (𝑅1‘𝑢) ¬ 𝑣 ∈ (𝐹 “ 𝑡))
26	17, 25	ax-mp 5	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ∃𝑢 ∈ On ∃𝑣 ∈ (𝑅1‘𝑢) ¬ 𝑣 ∈ (𝐹 “ 𝑡)
27		onintrab2 7751	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (∃𝑢 ∈ On ∃𝑣 ∈ (𝑅1‘𝑢) ¬ 𝑣 ∈ (𝐹 “ 𝑡) ↔ ∩ {𝑢 ∈ On ∣ ∃𝑣 ∈ (𝑅1‘𝑢) ¬ 𝑣 ∈ (𝐹 “ 𝑡)} ∈ On)
28	9	eleq1i 2827	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐵 ∈ On ↔ ∩ {𝑢 ∈ On ∣ ∃𝑣 ∈ (𝑅1‘𝑢) ¬ 𝑣 ∈ (𝐹 “ 𝑡)} ∈ On)
29	27, 28	bitr4i 278	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (∃𝑢 ∈ On ∃𝑣 ∈ (𝑅1‘𝑢) ¬ 𝑣 ∈ (𝐹 “ 𝑡) ↔ 𝐵 ∈ On)
30	26, 29	mpbi 230	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ 𝐵 ∈ On
31	30	oneli 6438	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((rank‘(𝐹‘𝑡)) ∈ 𝐵 → (rank‘(𝐹‘𝑡)) ∈ On)
32		fveq2 6840	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑢 = (rank‘(𝐹‘𝑡)) → (𝑅1‘𝑢) = (𝑅1‘(rank‘(𝐹‘𝑡))))
33	32	rexeqdv 3296	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑢 = (rank‘(𝐹‘𝑡)) → (∃𝑣 ∈ (𝑅1‘𝑢) ¬ 𝑣 ∈ (𝐹 “ 𝑡) ↔ ∃𝑣 ∈ (𝑅1‘(rank‘(𝐹‘𝑡))) ¬ 𝑣 ∈ (𝐹 “ 𝑡)))
34	33	onnminsb 7753	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((rank‘(𝐹‘𝑡)) ∈ On → ((rank‘(𝐹‘𝑡)) ∈ ∩ {𝑢 ∈ On ∣ ∃𝑣 ∈ (𝑅1‘𝑢) ¬ 𝑣 ∈ (𝐹 “ 𝑡)} → ¬ ∃𝑣 ∈ (𝑅1‘(rank‘(𝐹‘𝑡))) ¬ 𝑣 ∈ (𝐹 “ 𝑡)))
35	9	eleq2i 2828	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((rank‘(𝐹‘𝑡)) ∈ 𝐵 ↔ (rank‘(𝐹‘𝑡)) ∈ ∩ {𝑢 ∈ On ∣ ∃𝑣 ∈ (𝑅1‘𝑢) ¬ 𝑣 ∈ (𝐹 “ 𝑡)})
36		dfral2 3088	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (∀𝑣 ∈ (𝑅1‘(rank‘(𝐹‘𝑡)))𝑣 ∈ (𝐹 “ 𝑡) ↔ ¬ ∃𝑣 ∈ (𝑅1‘(rank‘(𝐹‘𝑡))) ¬ 𝑣 ∈ (𝐹 “ 𝑡))
37	34, 35, 36	3imtr4g 296	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((rank‘(𝐹‘𝑡)) ∈ On → ((rank‘(𝐹‘𝑡)) ∈ 𝐵 → ∀𝑣 ∈ (𝑅1‘(rank‘(𝐹‘𝑡)))𝑣 ∈ (𝐹 “ 𝑡)))
38	31, 37	mpcom 38	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((rank‘(𝐹‘𝑡)) ∈ 𝐵 → ∀𝑣 ∈ (𝑅1‘(rank‘(𝐹‘𝑡)))𝑣 ∈ (𝐹 “ 𝑡))
39		imassrn 6036	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐹 “ 𝑡) ⊆ ran 𝐹
40	39	sseli 3917	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑣 ∈ (𝐹 “ 𝑡) → 𝑣 ∈ ran 𝐹)
41	40	ralimi 3074	. . . . . . . . . . . . . . . . . . . 20 ⊢ (∀𝑣 ∈ (𝑅1‘(rank‘(𝐹‘𝑡)))𝑣 ∈ (𝐹 “ 𝑡) → ∀𝑣 ∈ (𝑅1‘(rank‘(𝐹‘𝑡)))𝑣 ∈ ran 𝐹)
42	38, 41	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ ((rank‘(𝐹‘𝑡)) ∈ 𝐵 → ∀𝑣 ∈ (𝑅1‘(rank‘(𝐹‘𝑡)))𝑣 ∈ ran 𝐹)
43	23, 24, 42	3syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑡 ∈ On) → ∀𝑣 ∈ (𝑅1‘(rank‘(𝐹‘𝑡)))𝑣 ∈ ran 𝐹)
44		2fveq3 6845	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹‘𝑡) = 𝑠 → (𝑅1‘(rank‘(𝐹‘𝑡))) = (𝑅1‘(rank‘𝑠)))
45	44	raleqdv 3295	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹‘𝑡) = 𝑠 → (∀𝑣 ∈ (𝑅1‘(rank‘(𝐹‘𝑡)))𝑣 ∈ ran 𝐹 ↔ ∀𝑣 ∈ (𝑅1‘(rank‘𝑠))𝑣 ∈ ran 𝐹))
46	43, 45	syl5ibcom 245	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑡 ∈ On) → ((𝐹‘𝑡) = 𝑠 → ∀𝑣 ∈ (𝑅1‘(rank‘𝑠))𝑣 ∈ ran 𝐹))
47	46	rexlimdva 3138	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (∃𝑡 ∈ On (𝐹‘𝑡) = 𝑠 → ∀𝑣 ∈ (𝑅1‘(rank‘𝑠))𝑣 ∈ ran 𝐹))
48	6, 47	biimtrid 242	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑠 ∈ ran 𝐹 → ∀𝑣 ∈ (𝑅1‘(rank‘𝑠))𝑣 ∈ ran 𝐹))
49	48	imp 406	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐹) → ∀𝑣 ∈ (𝑅1‘(rank‘𝑠))𝑣 ∈ ran 𝐹)
50		df-ral 3052	. . . . . . . . . . . . . 14 ⊢ (∀𝑣 ∈ (𝑅1‘(rank‘𝑠))𝑣 ∈ ran 𝐹 ↔ ∀𝑣(𝑣 ∈ (𝑅1‘(rank‘𝑠)) → 𝑣 ∈ ran 𝐹))
51	49, 50	sylib 218	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐹) → ∀𝑣(𝑣 ∈ (𝑅1‘(rank‘𝑠)) → 𝑣 ∈ ran 𝐹))
52	51	19.21bi 2197	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐹) → (𝑣 ∈ (𝑅1‘(rank‘𝑠)) → 𝑣 ∈ ran 𝐹))
53	52	con3d 152	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐹) → (¬ 𝑣 ∈ ran 𝐹 → ¬ 𝑣 ∈ (𝑅1‘(rank‘𝑠))))
54		rankon 9719	. . . . . . . . . . . 12 ⊢ (rank‘𝑠) ∈ On
55		vex 3433	. . . . . . . . . . . . 13 ⊢ 𝑣 ∈ V
56	55	ssrankr1 9759	. . . . . . . . . . . 12 ⊢ ((rank‘𝑠) ∈ On → ((rank‘𝑠) ⊆ (rank‘𝑣) ↔ ¬ 𝑣 ∈ (𝑅1‘(rank‘𝑠))))
57	54, 56	ax-mp 5	. . . . . . . . . . 11 ⊢ ((rank‘𝑠) ⊆ (rank‘𝑣) ↔ ¬ 𝑣 ∈ (𝑅1‘(rank‘𝑠)))
58	53, 57	imbitrrdi 252	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐹) → (¬ 𝑣 ∈ ran 𝐹 → (rank‘𝑠) ⊆ (rank‘𝑣)))
59	58	impancom 451	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝑣 ∈ ran 𝐹) → (𝑠 ∈ ran 𝐹 → (rank‘𝑠) ⊆ (rank‘𝑣)))
60	59	ralrimiv 3128	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝑣 ∈ ran 𝐹) → ∀𝑠 ∈ ran 𝐹(rank‘𝑠) ⊆ (rank‘𝑣))
61		rankon 9719	. . . . . . . . 9 ⊢ (rank‘𝑣) ∈ On
62		sseq2 3948	. . . . . . . . . . 11 ⊢ (𝑟 = (rank‘𝑣) → ((rank‘𝑠) ⊆ 𝑟 ↔ (rank‘𝑠) ⊆ (rank‘𝑣)))
63	62	ralbidv 3160	. . . . . . . . . 10 ⊢ (𝑟 = (rank‘𝑣) → (∀𝑠 ∈ ran 𝐹(rank‘𝑠) ⊆ 𝑟 ↔ ∀𝑠 ∈ ran 𝐹(rank‘𝑠) ⊆ (rank‘𝑣)))
64	63	rspcev 3564	. . . . . . . . 9 ⊢ (((rank‘𝑣) ∈ On ∧ ∀𝑠 ∈ ran 𝐹(rank‘𝑠) ⊆ (rank‘𝑣)) → ∃𝑟 ∈ On ∀𝑠 ∈ ran 𝐹(rank‘𝑠) ⊆ 𝑟)
65	61, 64	mpan 691	. . . . . . . 8 ⊢ (∀𝑠 ∈ ran 𝐹(rank‘𝑠) ⊆ (rank‘𝑣) → ∃𝑟 ∈ On ∀𝑠 ∈ ran 𝐹(rank‘𝑠) ⊆ 𝑟)
66		bndrank 9765	. . . . . . . 8 ⊢ (∃𝑟 ∈ On ∀𝑠 ∈ ran 𝐹(rank‘𝑠) ⊆ 𝑟 → ran 𝐹 ∈ V)
67	60, 65, 66	3syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝑣 ∈ ran 𝐹) → ran 𝐹 ∈ V)
68	67	expcom 413	. . . . . 6 ⊢ (¬ 𝑣 ∈ ran 𝐹 → (𝜑 → ran 𝐹 ∈ V))
69	68	exlimiv 1932	. . . . 5 ⊢ (∃𝑣 ¬ 𝑣 ∈ ran 𝐹 → (𝜑 → ran 𝐹 ∈ V))
70	2, 69	sylbir 235	. . . 4 ⊢ (¬ ∀𝑣 𝑣 ∈ ran 𝐹 → (𝜑 → ran 𝐹 ∈ V))
71	1, 70	sylnbi 330	. . 3 ⊢ (¬ ran 𝐹 = V → (𝜑 → ran 𝐹 ∈ V))
72	71	com12 32	. 2 ⊢ (𝜑 → (¬ ran 𝐹 = V → ran 𝐹 ∈ V))
73	72	con1d 145	1 ⊢ (𝜑 → (¬ ran 𝐹 ∈ V → ran 𝐹 = V))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1540   = wceq 1542  ∃wex 1781   ∈ wcel 2114   ≠ wne 2932  ∀wral 3051  ∃wrex 3061  {crab 3389  Vcvv 3429   ∖ cdif 3886   ⊆ wss 3889  ∅c0 4273  ∩ cint 4889   ↦ cmpt 5166  ran crn 5632   “ cima 5634  Oncon0 6323  Fun wfun 6492   Fn wfn 6493  ‘cfv 6498  recscrecs 8310  𝑅₁cr1 9686  rankcrnk 9687

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-reg 9507  ax-inf2 9562

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-r1 9688  df-rank 9689

This theorem is referenced by:  onvf1od  35289