Theorem weiunfrlem 37348

Description: Lemma for weiunfr 37351. (Contributed by Matthew House, 23-Aug-2025.)

Hypotheses

Ref	Expression
weiun.1	⊢ 𝐹 = (𝑤 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↦ (℩𝑢 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵}∀𝑣 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑣𝑅𝑢))
weiun.2	⊢ 𝑇 = {⟨𝑦, 𝑧⟩ ∣ ((𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ∧ 𝑧 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) ∧ ((𝐹‘𝑦)𝑅(𝐹‘𝑧) ∨ ((𝐹‘𝑦) = (𝐹‘𝑧) ∧ 𝑦⦋(𝐹‘𝑦) / 𝑥⦌𝑆𝑧)))}
weiunlem.3	⊢ (𝜑 → 𝑅 We 𝐴)
weiunlem.4	⊢ (𝜑 → 𝑅 Se 𝐴)
weiunfrlem.5	⊢ 𝐸 = (℩𝑝 ∈ (𝐹 “ 𝑟)∀𝑞 ∈ (𝐹 “ 𝑟) ¬ 𝑞𝑅𝑝)
weiunfrlem.6	⊢ (𝜑 → 𝑟 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
weiunfrlem.7	⊢ (𝜑 → 𝑟 ≠ ∅)

Assertion

Ref	Expression
weiunfrlem	⊢ (𝜑 → (𝐸 ∈ (𝐹 “ 𝑟) ∧ ∀𝑡 ∈ 𝑟 ¬ (𝐹‘𝑡)𝑅𝐸 ∧ ∀𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)(𝐹‘𝑡) = 𝐸))

Distinct variable groups:   𝜑,𝑡   𝐴,𝑝,𝑞,𝑟,𝑡,𝑢,𝑣,𝑤,𝑥   𝑦,𝐴,𝑧,𝑥   𝐵,𝑝,𝑞,𝑟,𝑡,𝑢,𝑣,𝑤   𝑦,𝐵,𝑧   𝑡,𝐸   𝐹,𝑝,𝑞,𝑟,𝑡,𝑦,𝑧   𝑅,𝑝,𝑞,𝑟,𝑡,𝑢,𝑣,𝑤   𝑦,𝑅,𝑧   𝑆,𝑝,𝑞,𝑟,𝑡,𝑦,𝑧   𝑇,𝑝,𝑞,𝑟

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

Proof of Theorem weiunfrlem

Dummy variables 𝑛 𝑜 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		weiunlem.3	. . . . . . 7 ⊢ (𝜑 → 𝑅 We 𝐴)
2		weiunlem.4	. . . . . . 7 ⊢ (𝜑 → 𝑅 Se 𝐴)
3		weiun.1	. . . . . . . . . 10 ⊢ 𝐹 = (𝑤 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↦ (℩𝑢 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵}∀𝑣 ∈ {𝑥 ∈ 𝐴 ∣ 𝑤 ∈ 𝐵} ¬ 𝑣𝑅𝑢))
4		weiun.2	. . . . . . . . . 10 ⊢ 𝑇 = {⟨𝑦, 𝑧⟩ ∣ ((𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ∧ 𝑧 ∈ ∪ 𝑥 ∈ 𝐴 𝐵) ∧ ((𝐹‘𝑦)𝑅(𝐹‘𝑧) ∨ ((𝐹‘𝑦) = (𝐹‘𝑧) ∧ 𝑦⦋(𝐹‘𝑦) / 𝑥⦌𝑆𝑧)))}
5	3, 4, 1, 2	weiunlem 37347	. . . . . . . . 9 ⊢ (𝜑 → (𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶𝐴 ∧ ∀𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵𝑡 ∈ ⦋(𝐹‘𝑡) / 𝑥⦌𝐵 ∧ ∀𝑠 ∈ 𝐴 ∀𝑡 ∈ ⦋ 𝑠 / 𝑥⦌𝐵 ¬ 𝑠𝑅(𝐹‘𝑡)))
6	5	simp1d 1160	. . . . . . . 8 ⊢ (𝜑 → 𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶𝐴)
7	6	fimassd 6736	. . . . . . 7 ⊢ (𝜑 → (𝐹 “ 𝑟) ⊆ 𝐴)
8		weiunfrlem.6	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑟 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
9	6	fdmd 6725	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐹 = ∪ 𝑥 ∈ 𝐴 𝐵)
10	8, 9	sseqtrrd 3946	. . . . . . . . . 10 ⊢ (𝜑 → 𝑟 ⊆ dom 𝐹)
11		sseqin2 4119	. . . . . . . . . 10 ⊢ (𝑟 ⊆ dom 𝐹 ↔ (dom 𝐹 ∩ 𝑟) = 𝑟)
12	10, 11	sylib 221	. . . . . . . . 9 ⊢ (𝜑 → (dom 𝐹 ∩ 𝑟) = 𝑟)
13		weiunfrlem.7	. . . . . . . . 9 ⊢ (𝜑 → 𝑟 ≠ ∅)
14	12, 13	eqnetrd 3022	. . . . . . . 8 ⊢ (𝜑 → (dom 𝐹 ∩ 𝑟) ≠ ∅)
15	14	imadisjlnd 6080	. . . . . . 7 ⊢ (𝜑 → (𝐹 “ 𝑟) ≠ ∅)
16		wereu2 5648	. . . . . . 7 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ ((𝐹 “ 𝑟) ⊆ 𝐴 ∧ (𝐹 “ 𝑟) ≠ ∅)) → ∃!𝑝 ∈ (𝐹 “ 𝑟)∀𝑞 ∈ (𝐹 “ 𝑟) ¬ 𝑞𝑅𝑝)
17	1, 2, 7, 15, 16	syl22anc 852	. . . . . 6 ⊢ (𝜑 → ∃!𝑝 ∈ (𝐹 “ 𝑟)∀𝑞 ∈ (𝐹 “ 𝑟) ¬ 𝑞𝑅𝑝)
18		riotacl2 7397	. . . . . 6 ⊢ (∃!𝑝 ∈ (𝐹 “ 𝑟)∀𝑞 ∈ (𝐹 “ 𝑟) ¬ 𝑞𝑅𝑝 → (℩𝑝 ∈ (𝐹 “ 𝑟)∀𝑞 ∈ (𝐹 “ 𝑟) ¬ 𝑞𝑅𝑝) ∈ {𝑝 ∈ (𝐹 “ 𝑟) ∣ ∀𝑞 ∈ (𝐹 “ 𝑟) ¬ 𝑞𝑅𝑝})
19	17, 18	syl 18	. . . . 5 ⊢ (𝜑 → (℩𝑝 ∈ (𝐹 “ 𝑟)∀𝑞 ∈ (𝐹 “ 𝑟) ¬ 𝑞𝑅𝑝) ∈ {𝑝 ∈ (𝐹 “ 𝑟) ∣ ∀𝑞 ∈ (𝐹 “ 𝑟) ¬ 𝑞𝑅𝑝})
20		weiunfrlem.5	. . . . 5 ⊢ 𝐸 = (℩𝑝 ∈ (𝐹 “ 𝑟)∀𝑞 ∈ (𝐹 “ 𝑟) ¬ 𝑞𝑅𝑝)
21		simpr 490	. . . . . . . . 9 ⊢ ((𝑛 = 𝑝 ∧ 𝑜 = 𝑞) → 𝑜 = 𝑞)
22		simpl 488	. . . . . . . . 9 ⊢ ((𝑛 = 𝑝 ∧ 𝑜 = 𝑞) → 𝑛 = 𝑝)
23	21, 22	breq12d 5115	. . . . . . . 8 ⊢ ((𝑛 = 𝑝 ∧ 𝑜 = 𝑞) → (𝑜𝑅𝑛 ↔ 𝑞𝑅𝑝))
24	23	notbid 321	. . . . . . 7 ⊢ ((𝑛 = 𝑝 ∧ 𝑜 = 𝑞) → (¬ 𝑜𝑅𝑛 ↔ ¬ 𝑞𝑅𝑝))
25	24	cbvraldva 3242	. . . . . 6 ⊢ (𝑛 = 𝑝 → (∀𝑜 ∈ (𝐹 “ 𝑟) ¬ 𝑜𝑅𝑛 ↔ ∀𝑞 ∈ (𝐹 “ 𝑟) ¬ 𝑞𝑅𝑝))
26	25	cbvrabv 3422	. . . . 5 ⊢ {𝑛 ∈ (𝐹 “ 𝑟) ∣ ∀𝑜 ∈ (𝐹 “ 𝑟) ¬ 𝑜𝑅𝑛} = {𝑝 ∈ (𝐹 “ 𝑟) ∣ ∀𝑞 ∈ (𝐹 “ 𝑟) ¬ 𝑞𝑅𝑝}
27	19, 20, 26	3eltr4g 2877	. . . 4 ⊢ (𝜑 → 𝐸 ∈ {𝑛 ∈ (𝐹 “ 𝑟) ∣ ∀𝑜 ∈ (𝐹 “ 𝑟) ¬ 𝑜𝑅𝑛})
28		breq2 5106	. . . . . . 7 ⊢ (𝑛 = 𝐸 → (𝑜𝑅𝑛 ↔ 𝑜𝑅𝐸))
29	28	notbid 321	. . . . . 6 ⊢ (𝑛 = 𝐸 → (¬ 𝑜𝑅𝑛 ↔ ¬ 𝑜𝑅𝐸))
30	29	ralbidv 3185	. . . . 5 ⊢ (𝑛 = 𝐸 → (∀𝑜 ∈ (𝐹 “ 𝑟) ¬ 𝑜𝑅𝑛 ↔ ∀𝑜 ∈ (𝐹 “ 𝑟) ¬ 𝑜𝑅𝐸))
31	30	elrab 3644	. . . 4 ⊢ (𝐸 ∈ {𝑛 ∈ (𝐹 “ 𝑟) ∣ ∀𝑜 ∈ (𝐹 “ 𝑟) ¬ 𝑜𝑅𝑛} ↔ (𝐸 ∈ (𝐹 “ 𝑟) ∧ ∀𝑜 ∈ (𝐹 “ 𝑟) ¬ 𝑜𝑅𝐸))
32	27, 31	sylib 221	. . 3 ⊢ (𝜑 → (𝐸 ∈ (𝐹 “ 𝑟) ∧ ∀𝑜 ∈ (𝐹 “ 𝑟) ¬ 𝑜𝑅𝐸))
33	32	simpld 500	. 2 ⊢ (𝜑 → 𝐸 ∈ (𝐹 “ 𝑟))
34	32	simprd 501	. . 3 ⊢ (𝜑 → ∀𝑜 ∈ (𝐹 “ 𝑟) ¬ 𝑜𝑅𝐸)
35	6	ffnd 6715	. . . 4 ⊢ (𝜑 → 𝐹 Fn ∪ 𝑥 ∈ 𝐴 𝐵)
36		breq1 5105	. . . . . 6 ⊢ (𝑜 = (𝐹‘𝑡) → (𝑜𝑅𝐸 ↔ (𝐹‘𝑡)𝑅𝐸))
37	36	notbid 321	. . . . 5 ⊢ (𝑜 = (𝐹‘𝑡) → (¬ 𝑜𝑅𝐸 ↔ ¬ (𝐹‘𝑡)𝑅𝐸))
38	37	ralima 7247	. . . 4 ⊢ ((𝐹 Fn ∪ 𝑥 ∈ 𝐴 𝐵 ∧ 𝑟 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) → (∀𝑜 ∈ (𝐹 “ 𝑟) ¬ 𝑜𝑅𝐸 ↔ ∀𝑡 ∈ 𝑟 ¬ (𝐹‘𝑡)𝑅𝐸))
39	35, 8, 38	syl2anc 596	. . 3 ⊢ (𝜑 → (∀𝑜 ∈ (𝐹 “ 𝑟) ¬ 𝑜𝑅𝐸 ↔ ∀𝑡 ∈ 𝑟 ¬ (𝐹‘𝑡)𝑅𝐸))
40	34, 39	mpbid 235	. 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝑟 ¬ (𝐹‘𝑡)𝑅𝐸)
41		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)) → 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵))
42	41	elin1d 4100	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)) → 𝑡 ∈ 𝑟)
43		rspa 3251	. . . . 5 ⊢ ((∀𝑡 ∈ 𝑟 ¬ (𝐹‘𝑡)𝑅𝐸 ∧ 𝑡 ∈ 𝑟) → ¬ (𝐹‘𝑡)𝑅𝐸)
44	40, 42, 43	syl2an2r 698	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)) → ¬ (𝐹‘𝑡)𝑅𝐸)
45		csbeq1 3850	. . . . . . 7 ⊢ (𝑠 = 𝐸 → ⦋𝑠 / 𝑥⦌𝐵 = ⦋𝐸 / 𝑥⦌𝐵)
46		breq1 5105	. . . . . . . 8 ⊢ (𝑠 = 𝐸 → (𝑠𝑅(𝐹‘𝑡) ↔ 𝐸𝑅(𝐹‘𝑡)))
47	46	notbid 321	. . . . . . 7 ⊢ (𝑠 = 𝐸 → (¬ 𝑠𝑅(𝐹‘𝑡) ↔ ¬ 𝐸𝑅(𝐹‘𝑡)))
48	45, 47	raleqbidv 3334	. . . . . 6 ⊢ (𝑠 = 𝐸 → (∀𝑡 ∈ ⦋ 𝑠 / 𝑥⦌𝐵 ¬ 𝑠𝑅(𝐹‘𝑡) ↔ ∀𝑡 ∈ ⦋ 𝐸 / 𝑥⦌𝐵 ¬ 𝐸𝑅(𝐹‘𝑡)))
49	5	simp3d 1162	. . . . . 6 ⊢ (𝜑 → ∀𝑠 ∈ 𝐴 ∀𝑡 ∈ ⦋ 𝑠 / 𝑥⦌𝐵 ¬ 𝑠𝑅(𝐹‘𝑡))
50	7, 33	sseldd 3910	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ 𝐴)
51	48, 49, 50	rspcdva 3577	. . . . 5 ⊢ (𝜑 → ∀𝑡 ∈ ⦋ 𝐸 / 𝑥⦌𝐵 ¬ 𝐸𝑅(𝐹‘𝑡))
52	41	elin2d 4101	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)) → 𝑡 ∈ ⦋𝐸 / 𝑥⦌𝐵)
53		rspa 3251	. . . . 5 ⊢ ((∀𝑡 ∈ ⦋ 𝐸 / 𝑥⦌𝐵 ¬ 𝐸𝑅(𝐹‘𝑡) ∧ 𝑡 ∈ ⦋𝐸 / 𝑥⦌𝐵) → ¬ 𝐸𝑅(𝐹‘𝑡))
54	51, 52, 53	syl2an2r 698	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)) → ¬ 𝐸𝑅(𝐹‘𝑡))
55		weso 5642	. . . . . . 7 ⊢ (𝑅 We 𝐴 → 𝑅 Or 𝐴)
56	1, 55	syl 18	. . . . . 6 ⊢ (𝜑 → 𝑅 Or 𝐴)
57	56	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)) → 𝑅 Or 𝐴)
58	6	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)) → 𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶𝐴)
59	8	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)) → 𝑟 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
60	59, 42	sseldd 3910	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)) → 𝑡 ∈ ∪ 𝑥 ∈ 𝐴 𝐵)
61	58, 60	ffvelcdmd 7090	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)) → (𝐹‘𝑡) ∈ 𝐴)
62	50	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)) → 𝐸 ∈ 𝐴)
63		sotrieq2 5591	. . . . 5 ⊢ ((𝑅 Or 𝐴 ∧ ((𝐹‘𝑡) ∈ 𝐴 ∧ 𝐸 ∈ 𝐴)) → ((𝐹‘𝑡) = 𝐸 ↔ (¬ (𝐹‘𝑡)𝑅𝐸 ∧ ¬ 𝐸𝑅(𝐹‘𝑡))))
64	57, 61, 62, 63	syl12anc 850	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)) → ((𝐹‘𝑡) = 𝐸 ↔ (¬ (𝐹‘𝑡)𝑅𝐸 ∧ ¬ 𝐸𝑅(𝐹‘𝑡))))
65	44, 54, 64	mpbir2and 726	. . 3 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)) → (𝐹‘𝑡) = 𝐸)
66	65	ralrimiva 3154	. 2 ⊢ (𝜑 → ∀𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)(𝐹‘𝑡) = 𝐸)
67	33, 40, 66	3jca 1146	1 ⊢ (𝜑 → (𝐸 ∈ (𝐹 “ 𝑟) ∧ ∀𝑡 ∈ 𝑟 ¬ (𝐹‘𝑡)𝑅𝐸 ∧ ∀𝑡 ∈ (𝑟 ∩ ⦋𝐸 / 𝑥⦌𝐵)(𝐹‘𝑡) = 𝐸))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076  ∃!wreu 3363  {crab 3412  ⦋csb 3847   ⊆ wss 3896   ∩ cin 4088  ∅c0 4277  ∪ ciun 4950   class class class wbr 5102  {copab 5166   ↦ cmpt 5185   Or wor 5558   Se wse 5602   We wwe 5603  dom cdm 5651   “ cima 5654   Fn wfn 6538  ⟶wf 6539  ‘cfv 6543  ℩crio 7380

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-riota 7381

This theorem is used by:  weiunfr  37351