Theorem weiunlem 37090

Description: Lemma for weiunpo 37092, weiunso 37093, weiunfr 37094, and weiunse 37095. (Contributed by Matthew House, 23-Aug-2025.)

Hypotheses

Ref	Expression
weiun.1	⊢ 𝐹 = (𝑤 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↦ (℩𝑢 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵}∀𝑣 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑣𝑅𝑢))
weiun.2	⊢ 𝑇 = {⟨𝑦, 𝑧⟩ ∣ ((𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ∧ 𝑧 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) ∧ ((𝐹‘𝑦)𝑅(𝐹‘𝑧) ∨ ((𝐹‘𝑦) = (𝐹‘𝑧) ∧ 𝑦⦋(𝐹‘𝑦) / 𝑥⦌𝑆𝑧)))}
weiunlem.3	⊢ (𝜑 → 𝑅 We 𝐴)
weiunlem.4	⊢ (𝜑 → 𝑅 Se 𝐴)

Assertion

Ref	Expression
weiunlem	⊢ (𝜑 → (𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶𝐴 ∧ ∀𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵𝑡 ∈ ⦋(𝐹‘𝑡) / 𝑥⦌𝐵 ∧ ∀𝑠 ∈ 𝐴 ∀𝑡 ∈ ⦋ 𝑠 / 𝑥⦌𝐵 ¬ 𝑠𝑅(𝐹‘𝑡)))

Distinct variable groups:   𝜑,𝑡   𝐴,𝑠,𝑡,𝑢,𝑣,𝑤,𝑥   𝑦,𝐴,𝑧,𝑥   𝐵,𝑠,𝑡,𝑢,𝑣,𝑤   𝑦,𝐵,𝑧   𝐹,𝑠,𝑡,𝑦,𝑧   𝑅,𝑠,𝑡,𝑢,𝑣,𝑤   𝑦,𝑅,𝑧   𝑆,𝑠,𝑡,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑢, 𝑠)   𝐵(𝑥)   𝑅(𝑥)   𝑆(𝑥, 𝑤, 𝑣, 𝑢)   𝑇(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑢, 𝑡, 𝑠)   𝐹(𝑥, 𝑤, 𝑣, 𝑢)

Proof of Theorem weiunlem

Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		weiunlem.3	. 2 ⊢ (𝜑 → 𝑅 We 𝐴)
2		weiunlem.4	. 2 ⊢ (𝜑 → 𝑅 Se 𝐴)
3		riotaex 7378	. . . . . 6 ⊢ (℩𝑢 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵}∀𝑣 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑣𝑅𝑢) ∈ V
4		weiun.1	. . . . . 6 ⊢ 𝐹 = (𝑤 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↦ (℩𝑢 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵}∀𝑣 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑣𝑅𝑢))
5	3, 4	fnmpti 6679	. . . . 5 ⊢ 𝐹 Fn ∪ 𝑥 ∈ 𝐴 𝐵
6	5	a1i 11	. . . 4 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝐹 Fn ∪ 𝑥 ∈ 𝐴 𝐵)
7		breq2 5111	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑟 → (𝑣𝑅𝑢 ↔ 𝑣𝑅𝑟))
8	7	notbid 321	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑟 → (¬ 𝑣𝑅𝑢 ↔ ¬ 𝑣𝑅𝑟))
9	8	ralbidv 3187	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑟 → (∀𝑣 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑣𝑅𝑢 ↔ ∀𝑣 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑣𝑅𝑟))
10	9	cbvriotavw 7384	. . . . . . . . . 10 ⊢ (℩𝑢 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵}∀𝑣 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑣𝑅𝑢) = (℩𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵}∀𝑣 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑣𝑅𝑟)
11		eleq1w 2845	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑡 → (𝑤 ∈ 𝐵 ↔ 𝑡 ∈ 𝐵))
12	11	rabbidv 3421	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑡 → {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} = {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵})
13		breq1 5110	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑠 → (𝑣𝑅𝑟 ↔ 𝑠𝑅𝑟))
14	13	notbid 321	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑠 → (¬ 𝑣𝑅𝑟 ↔ ¬ 𝑠𝑅𝑟))
15	14	cbvralvw 3242	. . . . . . . . . . . 12 ⊢ (∀𝑣 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑣𝑅𝑟 ↔ ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑠𝑅𝑟)
16	12	raleqdv 3321	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑡 → (∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑠𝑅𝑟 ↔ ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟))
17	15, 16	bitrid 286	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑡 → (∀𝑣 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑣𝑅𝑟 ↔ ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟))
18	12, 17	riotaeqbidv 7377	. . . . . . . . . 10 ⊢ (𝑤 = 𝑡 → (℩𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵}∀𝑣 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑣𝑅𝑟) = (℩𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵}∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟))
19	10, 18	eqtrid 2809	. . . . . . . . 9 ⊢ (𝑤 = 𝑡 → (℩𝑢 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵}∀𝑣 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑣𝑅𝑢) = (℩𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵}∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟))
20	19, 4, 3	fvmpt3i 6996	. . . . . . . 8 ⊢ (𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 → (𝐹‘𝑡) = (℩𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵}∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟))
21	20	adantl 487	. . . . . . 7 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) → (𝐹‘𝑡) = (℩𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵}∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟))
22		eliun 4958	. . . . . . . . . 10 ⊢ (𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑡 ∈ 𝐵)
23		rabn0 4342	. . . . . . . . . 10 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ≠ ∅ ↔ ∃𝑥 ∈ 𝐴 𝑡 ∈ 𝐵)
24	22, 23	bitr4i 281	. . . . . . . . 9 ⊢ (𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ≠ ∅)
25		ssrab2 4031	. . . . . . . . . 10 ⊢ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ⊆ 𝐴
26		wereu2 5656	. . . . . . . . . 10 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ ({𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ⊆ 𝐴 ∧ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ≠ ∅)) → ∃!𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵}∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟)
27	25, 26	mpanr1 716	. . . . . . . . 9 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ≠ ∅) → ∃!𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵}∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟)
28	24, 27	sylan2b 606	. . . . . . . 8 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) → ∃!𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵}∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟)
29		riotacl2 7390	. . . . . . . 8 ⊢ (∃!𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵}∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟 → (℩𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵}∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟) ∈ {𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ∣ ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟})
30	28, 29	syl 18	. . . . . . 7 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) → (℩𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵}∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟) ∈ {𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ∣ ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟})
31	21, 30	eqeltrd 2862	. . . . . 6 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) → (𝐹‘𝑡) ∈ {𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ∣ ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟})
32		elrabi 3644	. . . . . 6 ⊢ ((𝐹‘𝑡) ∈ {𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ∣ ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟} → (𝐹‘𝑡) ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵})
33		elrabi 3644	. . . . . 6 ⊢ ((𝐹‘𝑡) ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} → (𝐹‘𝑡) ∈ 𝐴)
34	31, 32, 33	3syl 19	. . . . 5 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) → (𝐹‘𝑡) ∈ 𝐴)
35	34	ralrimiva 3156	. . . 4 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵(𝐹‘𝑡) ∈ 𝐴)
36		ffnfv 7116	. . . 4 ⊢ (𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶𝐴 ↔ (𝐹 Fn ∪ 𝑥 ∈ 𝐴 𝐵 ∧ ∀𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵(𝐹‘𝑡) ∈ 𝐴))
37	6, 35, 36	sylanbrc 595	. . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶𝐴)
38		dfsbcq 3744	. . . . . . 7 ⊢ (𝑠 = (𝐹‘𝑡) → ([𝑠 / 𝑥]𝑡 ∈ 𝐵 ↔ [(𝐹‘𝑡) / 𝑥]𝑡 ∈ 𝐵))
39		nfcv 2924	. . . . . . . . 9 ⊢ Ⅎ𝑥𝐴
40	39	elrabsf 3787	. . . . . . . 8 ⊢ (𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ↔ (𝑠 ∈ 𝐴 ∧ [𝑠 / 𝑥]𝑡 ∈ 𝐵))
41	40	simprbi 503	. . . . . . 7 ⊢ (𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} → [𝑠 / 𝑥]𝑡 ∈ 𝐵)
42	38, 41	vtoclga 3539	. . . . . 6 ⊢ ((𝐹‘𝑡) ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} → [(𝐹‘𝑡) / 𝑥]𝑡 ∈ 𝐵)
43	31, 32, 42	3syl 19	. . . . 5 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) → [(𝐹‘𝑡) / 𝑥]𝑡 ∈ 𝐵)
44		sbcel2 4379	. . . . 5 ⊢ ([(𝐹‘𝑡) / 𝑥]𝑡 ∈ 𝐵 ↔ 𝑡 ∈ ⦋(𝐹‘𝑡) / 𝑥⦌𝐵)
45	43, 44	sylib 221	. . . 4 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) → 𝑡 ∈ ⦋(𝐹‘𝑡) / 𝑥⦌𝐵)
46	45	ralrimiva 3156	. . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵𝑡 ∈ ⦋(𝐹‘𝑡) / 𝑥⦌𝐵)
47		sbcel2 4379	. . . . . . . . . . 11 ⊢ ([𝑠 / 𝑥]𝑡 ∈ 𝐵 ↔ 𝑡 ∈ ⦋𝑠 / 𝑥⦌𝐵)
48	47	anbi2i 635	. . . . . . . . . 10 ⊢ ((𝑠 ∈ 𝐴 ∧ [𝑠 / 𝑥]𝑡 ∈ 𝐵) ↔ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ ⦋𝑠 / 𝑥⦌𝐵))
49	40, 48	bitri 278	. . . . . . . . 9 ⊢ (𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ↔ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ ⦋𝑠 / 𝑥⦌𝐵))
50	49	bilanri 512	. . . . . . . 8 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ ⦋𝑠 / 𝑥⦌𝐵)) → 𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵})
51	50	ne0d 4291	. . . . . . 7 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ ⦋𝑠 / 𝑥⦌𝐵)) → {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ≠ ∅)
52	51, 24	sylibr 237	. . . . . 6 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ ⦋𝑠 / 𝑥⦌𝐵)) → 𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵)
53		breq2 5111	. . . . . . . . . . 11 ⊢ (𝑟 = (𝐹‘𝑡) → (𝑠𝑅𝑟 ↔ 𝑠𝑅(𝐹‘𝑡)))
54	53	notbid 321	. . . . . . . . . 10 ⊢ (𝑟 = (𝐹‘𝑡) → (¬ 𝑠𝑅𝑟 ↔ ¬ 𝑠𝑅(𝐹‘𝑡)))
55	54	ralbidv 3187	. . . . . . . . 9 ⊢ (𝑟 = (𝐹‘𝑡) → (∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟 ↔ ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅(𝐹‘𝑡)))
56	55	elrab 3648	. . . . . . . 8 ⊢ ((𝐹‘𝑡) ∈ {𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ∣ ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟} ↔ ((𝐹‘𝑡) ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ∧ ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅(𝐹‘𝑡)))
57	56	simprbi 503	. . . . . . 7 ⊢ ((𝐹‘𝑡) ∈ {𝑟 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ∣ ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅𝑟} → ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅(𝐹‘𝑡))
58	31, 57	syl 18	. . . . . 6 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) → ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅(𝐹‘𝑡))
59	52, 58	syldan 603	. . . . 5 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ ⦋𝑠 / 𝑥⦌𝐵)) → ∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅(𝐹‘𝑡))
60		rsp 3252	. . . . 5 ⊢ (∀𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} ¬ 𝑠𝑅(𝐹‘𝑡) → (𝑠 ∈ {𝑥 ∈ 𝐴 ∣ 𝑡 ∈ 𝐵} → ¬ 𝑠𝑅(𝐹‘𝑡)))
61	59, 50, 60	sylc 66	. . . 4 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝑠 ∈ 𝐴 ∧ 𝑡 ∈ ⦋𝑠 / 𝑥⦌𝐵)) → ¬ 𝑠𝑅(𝐹‘𝑡))
62	61	ralrimivva 3207	. . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑠 ∈ 𝐴 ∀𝑡 ∈ ⦋ 𝑠 / 𝑥⦌𝐵 ¬ 𝑠𝑅(𝐹‘𝑡))
63	37, 46, 62	3jca 1146	. 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → (𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶𝐴 ∧ ∀𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵𝑡 ∈ ⦋(𝐹‘𝑡) / 𝑥⦌𝐵 ∧ ∀𝑠 ∈ 𝐴 ∀𝑡 ∈ ⦋ 𝑠 / 𝑥⦌𝐵 ¬ 𝑠𝑅(𝐹‘𝑡)))
64	1, 2, 63	syl2anc 596	1 ⊢ (𝜑 → (𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶𝐴 ∧ ∀𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵𝑡 ∈ ⦋(𝐹‘𝑡) / 𝑥⦌𝐵 ∧ ∀𝑠 ∈ 𝐴 ∀𝑡 ∈ ⦋ 𝑠 / 𝑥⦌𝐵 ¬ 𝑠𝑅(𝐹‘𝑡)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  ∃!wreu 3365  {crab 3414  [wsbc 3742  ⦋csb 3850   ⊆ wss 3902  ∅c0 4282  ∪ ciun 4954   class class class wbr 5107  {copab 5171   ↦ cmpt 5190   Se wse 5610   We wwe 5611   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  ℩crio 7373

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-riota 7374

This theorem is used by:  weiunfrlem  37091  weiunpo  37092  weiunso  37093  weiunfr  37094  weiunse  37095