Theorem acexmidlemcase 6047

Description: Lemma for acexmid 6051. Here we divide the proof into cases (based on the disjunction implicit in an unordered pair, not the sort of case elimination which relies on excluded middle).

The cases are (1) the choice function evaluated at 𝐴 equals {∅}, (2) the choice function evaluated at 𝐵 equals ∅, and (3) the choice function evaluated at 𝐴 equals ∅ and the choice function evaluated at 𝐵 equals {∅}.

Because of the way we represent the choice function 𝑦, the choice function evaluated at 𝐴 is (℩𝑣 ∈ 𝐴∃𝑢 ∈ 𝑦(𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) and the choice function evaluated at 𝐵 is (℩𝑣 ∈ 𝐵∃𝑢 ∈ 𝑦(𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)). Other than the difference in notation these work just as (𝑦‘𝐴) and (𝑦‘𝐵) would if 𝑦 were a function as defined by df-fun 5356.

Although it isn't exactly about the division into cases, it is also convenient for this lemma to also include the step that if the choice function evaluated at 𝐴 equals {∅}, then {∅} ∈ 𝐴 and likewise for 𝐵.

(Contributed by Jim Kingdon, 7-Aug-2019.)

Hypotheses

Ref	Expression
acexmidlem.a	⊢ 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}
acexmidlem.b	⊢ 𝐵 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ 𝜑)}
acexmidlem.c	⊢ 𝐶 = {𝐴, 𝐵}

Assertion

Ref	Expression
acexmidlemcase	⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ({∅} ∈ 𝐴 ∨ ∅ ∈ 𝐵 ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})))

Distinct variable groups:   𝑥,𝑦,𝑧,𝑣,𝑢,𝐴   𝑥,𝐵,𝑦,𝑧,𝑣,𝑢   𝑥,𝐶,𝑦,𝑧,𝑣,𝑢   𝜑,𝑥,𝑦,𝑧,𝑣,𝑢

Proof of Theorem acexmidlemcase

Step	Hyp	Ref	Expression
1		acexmidlem.a	. . . . . . . . . . . . . 14 ⊢ 𝐴 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)}
2		onsucelsucexmidlem 4653	. . . . . . . . . . . . . 14 ⊢ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)} ∈ On
3	1, 2	eqeltri 2307	. . . . . . . . . . . . 13 ⊢ 𝐴 ∈ On
4		prid1g 3797	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ On → 𝐴 ∈ {𝐴, 𝐵})
5	3, 4	ax-mp 5	. . . . . . . . . . . 12 ⊢ 𝐴 ∈ {𝐴, 𝐵}
6		acexmidlem.c	. . . . . . . . . . . 12 ⊢ 𝐶 = {𝐴, 𝐵}
7	5, 6	eleqtrri 2310	. . . . . . . . . . 11 ⊢ 𝐴 ∈ 𝐶
8		eleq1 2297	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = 𝐴 → (𝑧 ∈ 𝑢 ↔ 𝐴 ∈ 𝑢))
9	8	anbi1d 465	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝐴 → ((𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
10	9	rexbidv 2545	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝐴 → (∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
11	10	reueqd 2757	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝐴 → (∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∃!𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
12	11	rspcv 2919	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝐶 → (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ∃!𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
13	7, 12	ax-mp 5	. . . . . . . . . 10 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ∃!𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))
14		riotacl 6021	. . . . . . . . . 10 ⊢ (∃!𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → (℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ 𝐴)
15	13, 14	syl 14	. . . . . . . . 9 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → (℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ 𝐴)
16		elrabi 2972	. . . . . . . . . 10 ⊢ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = ∅ ∨ 𝜑)} → (℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ {∅, {∅}})
17	16, 1	eleq2s 2329	. . . . . . . . 9 ⊢ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ 𝐴 → (℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ {∅, {∅}})
18		elpri 3714	. . . . . . . . 9 ⊢ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ {∅, {∅}} → ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∨ (℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))
19	15, 17, 18	3syl 17	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∨ (℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))
20		eleq1 2297	. . . . . . . . . 10 ⊢ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅} → ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ 𝐴 ↔ {∅} ∈ 𝐴))
21	15, 20	syl5ibcom 155	. . . . . . . . 9 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅} → {∅} ∈ 𝐴))
22	21	orim2d 796	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → (((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∨ (℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}) → ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∨ {∅} ∈ 𝐴)))
23	19, 22	mpd 13	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∨ {∅} ∈ 𝐴))
24		acexmidlem.b	. . . . . . . . . . . . . 14 ⊢ 𝐵 = {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ 𝜑)}
25		pp0ex 4304	. . . . . . . . . . . . . . 15 ⊢ {∅, {∅}} ∈ V
26	25	rabex 4258	. . . . . . . . . . . . . 14 ⊢ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ 𝜑)} ∈ V
27	24, 26	eqeltri 2307	. . . . . . . . . . . . 13 ⊢ 𝐵 ∈ V
28	27	prid2 3800	. . . . . . . . . . . 12 ⊢ 𝐵 ∈ {𝐴, 𝐵}
29	28, 6	eleqtrri 2310	. . . . . . . . . . 11 ⊢ 𝐵 ∈ 𝐶
30		eleq1 2297	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = 𝐵 → (𝑧 ∈ 𝑢 ↔ 𝐵 ∈ 𝑢))
31	30	anbi1d 465	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝐵 → ((𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
32	31	rexbidv 2545	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝐵 → (∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
33	32	reueqd 2757	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝐵 → (∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∃!𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
34	33	rspcv 2919	. . . . . . . . . . 11 ⊢ (𝐵 ∈ 𝐶 → (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ∃!𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
35	29, 34	ax-mp 5	. . . . . . . . . 10 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ∃!𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))
36		riotacl 6021	. . . . . . . . . 10 ⊢ (∃!𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ 𝐵)
37	35, 36	syl 14	. . . . . . . . 9 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ 𝐵)
38		elrabi 2972	. . . . . . . . . 10 ⊢ ((℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ {𝑥 ∈ {∅, {∅}} ∣ (𝑥 = {∅} ∨ 𝜑)} → (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ {∅, {∅}})
39	38, 24	eleq2s 2329	. . . . . . . . 9 ⊢ ((℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ 𝐵 → (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ {∅, {∅}})
40		elpri 3714	. . . . . . . . 9 ⊢ ((℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ {∅, {∅}} → ((℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∨ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))
41	37, 39, 40	3syl 17	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ((℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∨ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))
42		eleq1 2297	. . . . . . . . . 10 ⊢ ((℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ → ((℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) ∈ 𝐵 ↔ ∅ ∈ 𝐵))
43	37, 42	syl5ibcom 155	. . . . . . . . 9 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ((℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ → ∅ ∈ 𝐵))
44	43	orim1d 795	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → (((℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∨ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}) → (∅ ∈ 𝐵 ∨ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})))
45	41, 44	mpd 13	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → (∅ ∈ 𝐵 ∨ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))
46	23, 45	jca 306	. . . . . 6 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → (((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∨ {∅} ∈ 𝐴) ∧ (∅ ∈ 𝐵 ∨ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})))
47		anddi 829	. . . . . 6 ⊢ ((((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∨ {∅} ∈ 𝐴) ∧ (∅ ∈ 𝐵 ∨ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})) ↔ ((((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ ∅ ∈ 𝐵) ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})) ∨ (({∅} ∈ 𝐴 ∧ ∅ ∈ 𝐵) ∨ ({∅} ∈ 𝐴 ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))))
48	46, 47	sylib 122	. . . . 5 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ((((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ ∅ ∈ 𝐵) ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})) ∨ (({∅} ∈ 𝐴 ∧ ∅ ∈ 𝐵) ∨ ({∅} ∈ 𝐴 ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))))
49		simpl 109	. . . . . . 7 ⊢ (({∅} ∈ 𝐴 ∧ ∅ ∈ 𝐵) → {∅} ∈ 𝐴)
50		simpl 109	. . . . . . 7 ⊢ (({∅} ∈ 𝐴 ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}) → {∅} ∈ 𝐴)
51	49, 50	jaoi 724	. . . . . 6 ⊢ ((({∅} ∈ 𝐴 ∧ ∅ ∈ 𝐵) ∨ ({∅} ∈ 𝐴 ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})) → {∅} ∈ 𝐴)
52	51	orim2i 769	. . . . 5 ⊢ (((((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ ∅ ∈ 𝐵) ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})) ∨ (({∅} ∈ 𝐴 ∧ ∅ ∈ 𝐵) ∨ ({∅} ∈ 𝐴 ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))) → ((((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ ∅ ∈ 𝐵) ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})) ∨ {∅} ∈ 𝐴))
53	48, 52	syl 14	. . . 4 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ((((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ ∅ ∈ 𝐵) ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})) ∨ {∅} ∈ 𝐴))
54	53	orcomd 737	. . 3 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ({∅} ∈ 𝐴 ∨ (((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ ∅ ∈ 𝐵) ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))))
55		simpr 110	. . . . 5 ⊢ (((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ ∅ ∈ 𝐵) → ∅ ∈ 𝐵)
56	55	orim1i 768	. . . 4 ⊢ ((((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ ∅ ∈ 𝐵) ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})) → (∅ ∈ 𝐵 ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})))
57	56	orim2i 769	. . 3 ⊢ (({∅} ∈ 𝐴 ∨ (((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ ∅ ∈ 𝐵) ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))) → ({∅} ∈ 𝐴 ∨ (∅ ∈ 𝐵 ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))))
58	54, 57	syl 14	. 2 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ({∅} ∈ 𝐴 ∨ (∅ ∈ 𝐵 ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))))
59		3orass 1008	. 2 ⊢ (({∅} ∈ 𝐴 ∨ ∅ ∈ 𝐵 ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})) ↔ ({∅} ∈ 𝐴 ∨ (∅ ∈ 𝐵 ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅}))))
60	58, 59	sylibr 134	1 ⊢ (∀𝑧 ∈ 𝐶 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) → ({∅} ∈ 𝐴 ∨ ∅ ∈ 𝐵 ∨ ((℩𝑣 ∈ 𝐴 ∃𝑢 ∈ 𝑦 (𝐴 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = ∅ ∧ (℩𝑣 ∈ 𝐵 ∃𝑢 ∈ 𝑦 (𝐵 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)) = {∅})))

Syntax hints:   → wi 4   ∧ wa 104   ∨ wo 716   ∨ w3o 1004   = wceq 1398   ∈ wcel 2205  ∀wral 2522  ∃wrex 2523  ∃!wreu 2524  {crab 2526  Vcvv 2815  ∅c0 3510  {csn 3691  {cpr 3692  Oncon0 4486  ℩crio 6004

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-nul 4238  ax-pow 4289

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-uni 3917  df-tr 4211  df-iord 4489  df-on 4491  df-suc 4494  df-iota 5314  df-riota 6005

This theorem is referenced by:  acexmidlem1  6048