Theorem onvf1odlem2 35286

Description: Lemma for onvf1od 35289. (Contributed by BTernaryTau, 2-Dec-2025.)

Hypotheses

Ref	Expression
onvf1odlem2.1	⊢ (𝜑 → ∀𝑧(𝑧 ≠ ∅ → (𝐺‘𝑧) ∈ 𝑧))
onvf1odlem2.2	⊢ 𝑀 = ∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴}
onvf1odlem2.3	⊢ 𝑁 = (𝐺‘((𝑅1‘𝑀) ∖ 𝐴))

Assertion

Ref	Expression
onvf1odlem2	⊢ (𝜑 → (𝐴 ∈ 𝑉 → 𝑁 ∈ ((𝑅1‘𝑀) ∖ 𝐴)))

Distinct variable groups:   𝑧,𝐴   𝑧,𝐺   𝑧,𝑀   𝑥,𝐴,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝐺(𝑥,𝑦)   𝑀(𝑥,𝑦)   𝑁(𝑥,𝑦,𝑧)   𝑉(𝑥,𝑦,𝑧)

Proof of Theorem onvf1odlem2

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		onvf1odlem2.1	. . 3 ⊢ (𝜑 → ∀𝑧(𝑧 ≠ ∅ → (𝐺‘𝑧) ∈ 𝑧))
2		onvf1odlem1 35285	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ∃𝑥 ∈ On ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴)
3		nfcv 2898	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑅1
4		nfrab1 3409	. . . . . . . . . 10 ⊢ Ⅎ𝑥{𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴}
5	4	nfint 4899	. . . . . . . . 9 ⊢ Ⅎ𝑥∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴}
6	3, 5	nffv 6850	. . . . . . . 8 ⊢ Ⅎ𝑥(𝑅1‘∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴})
7		nfv 1916	. . . . . . . 8 ⊢ Ⅎ𝑥 ¬ 𝑣 ∈ 𝐴
8	6, 7	nfrexw 3285	. . . . . . 7 ⊢ Ⅎ𝑥∃𝑣 ∈ (𝑅1‘∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴}) ¬ 𝑣 ∈ 𝐴
9		eleq1w 2819	. . . . . . . . . 10 ⊢ (𝑦 = 𝑣 → (𝑦 ∈ 𝐴 ↔ 𝑣 ∈ 𝐴))
10	9	notbid 318	. . . . . . . . 9 ⊢ (𝑦 = 𝑣 → (¬ 𝑦 ∈ 𝐴 ↔ ¬ 𝑣 ∈ 𝐴))
11	10	cbvrexvw 3216	. . . . . . . 8 ⊢ (∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴 ↔ ∃𝑣 ∈ (𝑅1‘𝑥) ¬ 𝑣 ∈ 𝐴)
12		fveq2 6840	. . . . . . . . 9 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴} → (𝑅1‘𝑥) = (𝑅1‘∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴}))
13	12	rexeqdv 3296	. . . . . . . 8 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴} → (∃𝑣 ∈ (𝑅1‘𝑥) ¬ 𝑣 ∈ 𝐴 ↔ ∃𝑣 ∈ (𝑅1‘∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴}) ¬ 𝑣 ∈ 𝐴))
14	11, 13	bitrid 283	. . . . . . 7 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴} → (∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴 ↔ ∃𝑣 ∈ (𝑅1‘∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴}) ¬ 𝑣 ∈ 𝐴))
15	8, 14	onminsb 7748	. . . . . 6 ⊢ (∃𝑥 ∈ On ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴 → ∃𝑣 ∈ (𝑅1‘∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴}) ¬ 𝑣 ∈ 𝐴)
16		onvf1odlem2.2	. . . . . . . 8 ⊢ 𝑀 = ∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴}
17	16	fveq2i 6843	. . . . . . 7 ⊢ (𝑅1‘𝑀) = (𝑅1‘∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴})
18	17	rexeqi 3294	. . . . . 6 ⊢ (∃𝑣 ∈ (𝑅1‘𝑀) ¬ 𝑣 ∈ 𝐴 ↔ ∃𝑣 ∈ (𝑅1‘∩ {𝑥 ∈ On ∣ ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴}) ¬ 𝑣 ∈ 𝐴)
19	15, 18	sylibr 234	. . . . 5 ⊢ (∃𝑥 ∈ On ∃𝑦 ∈ (𝑅1‘𝑥) ¬ 𝑦 ∈ 𝐴 → ∃𝑣 ∈ (𝑅1‘𝑀) ¬ 𝑣 ∈ 𝐴)
20	2, 19	syl 17	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ∃𝑣 ∈ (𝑅1‘𝑀) ¬ 𝑣 ∈ 𝐴)
21		df-rex 3062	. . . . 5 ⊢ (∃𝑣 ∈ (𝑅1‘𝑀) ¬ 𝑣 ∈ 𝐴 ↔ ∃𝑣(𝑣 ∈ (𝑅1‘𝑀) ∧ ¬ 𝑣 ∈ 𝐴))
22		nss 3986	. . . . 5 ⊢ (¬ (𝑅1‘𝑀) ⊆ 𝐴 ↔ ∃𝑣(𝑣 ∈ (𝑅1‘𝑀) ∧ ¬ 𝑣 ∈ 𝐴))
23		ssdif0 4306	. . . . . 6 ⊢ ((𝑅1‘𝑀) ⊆ 𝐴 ↔ ((𝑅1‘𝑀) ∖ 𝐴) = ∅)
24	23	necon3bbii 2979	. . . . 5 ⊢ (¬ (𝑅1‘𝑀) ⊆ 𝐴 ↔ ((𝑅1‘𝑀) ∖ 𝐴) ≠ ∅)
25	21, 22, 24	3bitr2i 299	. . . 4 ⊢ (∃𝑣 ∈ (𝑅1‘𝑀) ¬ 𝑣 ∈ 𝐴 ↔ ((𝑅1‘𝑀) ∖ 𝐴) ≠ ∅)
26	20, 25	sylib 218	. . 3 ⊢ (𝐴 ∈ 𝑉 → ((𝑅1‘𝑀) ∖ 𝐴) ≠ ∅)
27		fvex 6853	. . . . 5 ⊢ (𝑅1‘𝑀) ∈ V
28	27	difexi 5271	. . . 4 ⊢ ((𝑅1‘𝑀) ∖ 𝐴) ∈ V
29		neeq1 2994	. . . . 5 ⊢ (𝑧 = ((𝑅1‘𝑀) ∖ 𝐴) → (𝑧 ≠ ∅ ↔ ((𝑅1‘𝑀) ∖ 𝐴) ≠ ∅))
30		fveq2 6840	. . . . . 6 ⊢ (𝑧 = ((𝑅1‘𝑀) ∖ 𝐴) → (𝐺‘𝑧) = (𝐺‘((𝑅1‘𝑀) ∖ 𝐴)))
31		id 22	. . . . . 6 ⊢ (𝑧 = ((𝑅1‘𝑀) ∖ 𝐴) → 𝑧 = ((𝑅1‘𝑀) ∖ 𝐴))
32	30, 31	eleq12d 2830	. . . . 5 ⊢ (𝑧 = ((𝑅1‘𝑀) ∖ 𝐴) → ((𝐺‘𝑧) ∈ 𝑧 ↔ (𝐺‘((𝑅1‘𝑀) ∖ 𝐴)) ∈ ((𝑅1‘𝑀) ∖ 𝐴)))
33	29, 32	imbi12d 344	. . . 4 ⊢ (𝑧 = ((𝑅1‘𝑀) ∖ 𝐴) → ((𝑧 ≠ ∅ → (𝐺‘𝑧) ∈ 𝑧) ↔ (((𝑅1‘𝑀) ∖ 𝐴) ≠ ∅ → (𝐺‘((𝑅1‘𝑀) ∖ 𝐴)) ∈ ((𝑅1‘𝑀) ∖ 𝐴))))
34	28, 33	spcv 3547	. . 3 ⊢ (∀𝑧(𝑧 ≠ ∅ → (𝐺‘𝑧) ∈ 𝑧) → (((𝑅1‘𝑀) ∖ 𝐴) ≠ ∅ → (𝐺‘((𝑅1‘𝑀) ∖ 𝐴)) ∈ ((𝑅1‘𝑀) ∖ 𝐴)))
35	1, 26, 34	syl2im 40	. 2 ⊢ (𝜑 → (𝐴 ∈ 𝑉 → (𝐺‘((𝑅1‘𝑀) ∖ 𝐴)) ∈ ((𝑅1‘𝑀) ∖ 𝐴)))
36		onvf1odlem2.3	. . 3 ⊢ 𝑁 = (𝐺‘((𝑅1‘𝑀) ∖ 𝐴))
37	36	eleq1i 2827	. 2 ⊢ (𝑁 ∈ ((𝑅1‘𝑀) ∖ 𝐴) ↔ (𝐺‘((𝑅1‘𝑀) ∖ 𝐴)) ∈ ((𝑅1‘𝑀) ∖ 𝐴))
38	35, 37	imbitrrdi 252	1 ⊢ (𝜑 → (𝐴 ∈ 𝑉 → 𝑁 ∈ ((𝑅1‘𝑀) ∖ 𝐴)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395  ∀wal 1540   = wceq 1542  ∃wex 1781   ∈ wcel 2114   ≠ wne 2932  ∃wrex 3061  {crab 3389   ∖ cdif 3886   ⊆ wss 3889  ∅c0 4273  ∩ cint 4889  Oncon0 6323  ‘cfv 6498  𝑅₁cr1 9686

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

This theorem is referenced by:  onvf1odlem4  35288  onvf1od  35289