Theorem dmopab3rexdif 33367

Description: The domain of an ordered pair class abstraction with three nested restricted existential quantifiers with differences. (Contributed by AV, 25-Oct-2023.)

Assertion

Ref	Expression
dmopab3rexdif	⊢ ((∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) ∧ 𝑆 ⊆ 𝑈) → dom {⟨𝑥, 𝑦⟩ ∣ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑥 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑥 = 𝐴 ∧ 𝑦 = 𝐵))} = {𝑥 ∣ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 𝑥 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑥 = 𝐶) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑥 = 𝐴)})

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝐷,𝑦   𝑖,𝐼,𝑥,𝑦   𝑢,𝑆,𝑣,𝑥,𝑦   𝑢,𝑈,𝑣,𝑥,𝑦

Allowed substitution hints:   𝐴(𝑣,𝑢,𝑖)   𝐵(𝑣,𝑢,𝑖)   𝐶(𝑣,𝑢,𝑖)   𝐷(𝑣,𝑢,𝑖)   𝑆(𝑖)   𝑈(𝑖)   𝐼(𝑣,𝑢)   𝑊(𝑥,𝑦,𝑣,𝑢,𝑖)   𝑋(𝑥,𝑦,𝑣,𝑢,𝑖)

Proof of Theorem dmopab3rexdif

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		rexcom4 3233	. . . . . . . . . 10 ⊢ (∃𝑣 ∈ 𝑈 ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑦∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵))
2		rexcom4 3233	. . . . . . . . . 10 ⊢ (∃𝑖 ∈ 𝐼 ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷) ↔ ∃𝑦∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷))
3	1, 2	orbi12i 912	. . . . . . . . 9 ⊢ ((∃𝑣 ∈ 𝑈 ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ (∃𝑦∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑦∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)))
4		19.43 1885	. . . . . . . . 9 ⊢ (∃𝑦(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ (∃𝑦∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑦∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)))
5	3, 4	bitr4i 277	. . . . . . . 8 ⊢ ((∃𝑣 ∈ 𝑈 ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ ∃𝑦(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)))
6	5	rexbii 3181	. . . . . . 7 ⊢ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ ∃𝑢 ∈ (𝑈 ∖ 𝑆)∃𝑦(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)))
7		rexcom4 3233	. . . . . . 7 ⊢ (∃𝑢 ∈ (𝑈 ∖ 𝑆)∃𝑦(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ ∃𝑦∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)))
8	6, 7	bitri 274	. . . . . 6 ⊢ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ ∃𝑦∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)))
9		rexcom4 3233	. . . . . . . 8 ⊢ (∃𝑣 ∈ (𝑈 ∖ 𝑆)∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑦∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵))
10	9	rexbii 3181	. . . . . . 7 ⊢ (∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑢 ∈ 𝑆 ∃𝑦∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵))
11		rexcom4 3233	. . . . . . 7 ⊢ (∃𝑢 ∈ 𝑆 ∃𝑦∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑦∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵))
12	10, 11	bitri 274	. . . . . 6 ⊢ (∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑦∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵))
13	8, 12	orbi12i 912	. . . . 5 ⊢ ((∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵)) ↔ (∃𝑦∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑦∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵)))
14		19.43 1885	. . . . 5 ⊢ (∃𝑦(∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵)) ↔ (∃𝑦∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑦∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵)))
15	13, 14	bitr4i 277	. . . 4 ⊢ ((∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵)) ↔ ∃𝑦(∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵)))
16		difssd 4067	. . . . . . . 8 ⊢ (𝑆 ⊆ 𝑈 → (𝑈 ∖ 𝑆) ⊆ 𝑈)
17		ssralv 3987	. . . . . . . 8 ⊢ ((𝑈 ∖ 𝑆) ⊆ 𝑈 → (∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) → ∀𝑢 ∈ (𝑈 ∖ 𝑆)(∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊)))
18	16, 17	syl 17	. . . . . . 7 ⊢ (𝑆 ⊆ 𝑈 → (∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) → ∀𝑢 ∈ (𝑈 ∖ 𝑆)(∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊)))
19	18	impcom 408	. . . . . 6 ⊢ ((∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) ∧ 𝑆 ⊆ 𝑈) → ∀𝑢 ∈ (𝑈 ∖ 𝑆)(∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊))
20		simpl 483	. . . . . . . . . . . 12 ⊢ ((𝑧 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑧 = 𝐴)
21	20	exlimiv 1933	. . . . . . . . . . 11 ⊢ (∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑧 = 𝐴)
22		elisset 2820	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ 𝑋 → ∃𝑦 𝑦 = 𝐵)
23		ibar 529	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝐴 → (𝑦 = 𝐵 ↔ (𝑧 = 𝐴 ∧ 𝑦 = 𝐵)))
24	23	bicomd 222	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝐴 → ((𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ↔ 𝑦 = 𝐵))
25	24	exbidv 1924	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝐴 → (∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑦 𝑦 = 𝐵))
26	22, 25	syl5ibrcom 246	. . . . . . . . . . 11 ⊢ (𝐵 ∈ 𝑋 → (𝑧 = 𝐴 → ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵)))
27	21, 26	impbid2 225	. . . . . . . . . 10 ⊢ (𝐵 ∈ 𝑋 → (∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ↔ 𝑧 = 𝐴))
28	27	ralrexbid 3255	. . . . . . . . 9 ⊢ (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 → (∃𝑣 ∈ 𝑈 ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑣 ∈ 𝑈 𝑧 = 𝐴))
29	28	adantr 481	. . . . . . . 8 ⊢ ((∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) → (∃𝑣 ∈ 𝑈 ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑣 ∈ 𝑈 𝑧 = 𝐴))
30		simpl 483	. . . . . . . . . . . 12 ⊢ ((𝑧 = 𝐶 ∧ 𝑦 = 𝐷) → 𝑧 = 𝐶)
31	30	exlimiv 1933	. . . . . . . . . . 11 ⊢ (∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷) → 𝑧 = 𝐶)
32		elisset 2820	. . . . . . . . . . . 12 ⊢ (𝐷 ∈ 𝑊 → ∃𝑦 𝑦 = 𝐷)
33		ibar 529	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝐶 → (𝑦 = 𝐷 ↔ (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)))
34	33	bicomd 222	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝐶 → ((𝑧 = 𝐶 ∧ 𝑦 = 𝐷) ↔ 𝑦 = 𝐷))
35	34	exbidv 1924	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝐶 → (∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷) ↔ ∃𝑦 𝑦 = 𝐷))
36	32, 35	syl5ibrcom 246	. . . . . . . . . . 11 ⊢ (𝐷 ∈ 𝑊 → (𝑧 = 𝐶 → ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷)))
37	31, 36	impbid2 225	. . . . . . . . . 10 ⊢ (𝐷 ∈ 𝑊 → (∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷) ↔ 𝑧 = 𝐶))
38	37	ralrexbid 3255	. . . . . . . . 9 ⊢ (∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊 → (∃𝑖 ∈ 𝐼 ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷) ↔ ∃𝑖 ∈ 𝐼 𝑧 = 𝐶))
39	38	adantl 482	. . . . . . . 8 ⊢ ((∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) → (∃𝑖 ∈ 𝐼 ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷) ↔ ∃𝑖 ∈ 𝐼 𝑧 = 𝐶))
40	29, 39	orbi12d 916	. . . . . . 7 ⊢ ((∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) → ((∃𝑣 ∈ 𝑈 ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ (∃𝑣 ∈ 𝑈 𝑧 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑧 = 𝐶)))
41	40	ralrexbid 3255	. . . . . 6 ⊢ (∀𝑢 ∈ (𝑈 ∖ 𝑆)(∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) → (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ ∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 𝑧 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑧 = 𝐶)))
42	19, 41	syl 17	. . . . 5 ⊢ ((∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) ∧ 𝑆 ⊆ 𝑈) → (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ ∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 𝑧 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑧 = 𝐶)))
43		ssralv 3987	. . . . . . . 8 ⊢ (𝑆 ⊆ 𝑈 → (∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) → ∀𝑢 ∈ 𝑆 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊)))
44		ssralv 3987	. . . . . . . . . . 11 ⊢ ((𝑈 ∖ 𝑆) ⊆ 𝑈 → (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 → ∀𝑣 ∈ (𝑈 ∖ 𝑆)𝐵 ∈ 𝑋))
45	16, 44	syl 17	. . . . . . . . . 10 ⊢ (𝑆 ⊆ 𝑈 → (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 → ∀𝑣 ∈ (𝑈 ∖ 𝑆)𝐵 ∈ 𝑋))
46	45	adantrd 492	. . . . . . . . 9 ⊢ (𝑆 ⊆ 𝑈 → ((∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) → ∀𝑣 ∈ (𝑈 ∖ 𝑆)𝐵 ∈ 𝑋))
47	46	ralimdv 3109	. . . . . . . 8 ⊢ (𝑆 ⊆ 𝑈 → (∀𝑢 ∈ 𝑆 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) → ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ (𝑈 ∖ 𝑆)𝐵 ∈ 𝑋))
48	43, 47	syld 47	. . . . . . 7 ⊢ (𝑆 ⊆ 𝑈 → (∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) → ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ (𝑈 ∖ 𝑆)𝐵 ∈ 𝑋))
49	48	impcom 408	. . . . . 6 ⊢ ((∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) ∧ 𝑆 ⊆ 𝑈) → ∀𝑢 ∈ 𝑆 ∀𝑣 ∈ (𝑈 ∖ 𝑆)𝐵 ∈ 𝑋)
50	27	ralrexbid 3255	. . . . . . 7 ⊢ (∀𝑣 ∈ (𝑈 ∖ 𝑆)𝐵 ∈ 𝑋 → (∃𝑣 ∈ (𝑈 ∖ 𝑆)∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑧 = 𝐴))
51	50	ralrexbid 3255	. . . . . 6 ⊢ (∀𝑢 ∈ 𝑆 ∀𝑣 ∈ (𝑈 ∖ 𝑆)𝐵 ∈ 𝑋 → (∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑧 = 𝐴))
52	49, 51	syl 17	. . . . 5 ⊢ ((∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) ∧ 𝑆 ⊆ 𝑈) → (∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑧 = 𝐴))
53	42, 52	orbi12d 916	. . . 4 ⊢ ((∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) ∧ 𝑆 ⊆ 𝑈) → ((∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 ∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 ∃𝑦(𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)∃𝑦(𝑧 = 𝐴 ∧ 𝑦 = 𝐵)) ↔ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 𝑧 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑧 = 𝐶) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑧 = 𝐴)))
54	15, 53	bitr3id 285	. . 3 ⊢ ((∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) ∧ 𝑆 ⊆ 𝑈) → (∃𝑦(∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵)) ↔ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 𝑧 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑧 = 𝐶) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑧 = 𝐴)))
55		eqeq1 2742	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝐴 ↔ 𝑧 = 𝐴))
56	55	anbi1d 630	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑧 = 𝐴 ∧ 𝑦 = 𝐵)))
57	56	rexbidv 3226	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (∃𝑣 ∈ 𝑈 (𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵)))
58		eqeq1 2742	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝐶 ↔ 𝑧 = 𝐶))
59	58	anbi1d 630	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → ((𝑥 = 𝐶 ∧ 𝑦 = 𝐷) ↔ (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)))
60	59	rexbidv 3226	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (∃𝑖 ∈ 𝐼 (𝑥 = 𝐶 ∧ 𝑦 = 𝐷) ↔ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)))
61	57, 60	orbi12d 916	. . . . . . 7 ⊢ (𝑥 = 𝑧 → ((∃𝑣 ∈ 𝑈 (𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑥 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ (∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷))))
62	61	rexbidv 3226	. . . . . 6 ⊢ (𝑥 = 𝑧 → (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑥 = 𝐶 ∧ 𝑦 = 𝐷)) ↔ ∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷))))
63	56	2rexbidv 3229	. . . . . 6 ⊢ (𝑥 = 𝑧 → (∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵)))
64	62, 63	orbi12d 916	. . . . 5 ⊢ (𝑥 = 𝑧 → ((∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑥 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) ↔ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵))))
65	64	dmopabelb 5825	. . . 4 ⊢ (𝑧 ∈ V → (𝑧 ∈ dom {⟨𝑥, 𝑦⟩ ∣ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑥 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑥 = 𝐴 ∧ 𝑦 = 𝐵))} ↔ ∃𝑦(∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵))))
66	65	elv 3438	. . 3 ⊢ (𝑧 ∈ dom {⟨𝑥, 𝑦⟩ ∣ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑥 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑥 = 𝐴 ∧ 𝑦 = 𝐵))} ↔ ∃𝑦(∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑧 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑧 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑧 = 𝐴 ∧ 𝑦 = 𝐵)))
67		vex 3436	. . . 4 ⊢ 𝑧 ∈ V
68	55	rexbidv 3226	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (∃𝑣 ∈ 𝑈 𝑥 = 𝐴 ↔ ∃𝑣 ∈ 𝑈 𝑧 = 𝐴))
69	58	rexbidv 3226	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (∃𝑖 ∈ 𝐼 𝑥 = 𝐶 ↔ ∃𝑖 ∈ 𝐼 𝑧 = 𝐶))
70	68, 69	orbi12d 916	. . . . . 6 ⊢ (𝑥 = 𝑧 → ((∃𝑣 ∈ 𝑈 𝑥 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑥 = 𝐶) ↔ (∃𝑣 ∈ 𝑈 𝑧 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑧 = 𝐶)))
71	70	rexbidv 3226	. . . . 5 ⊢ (𝑥 = 𝑧 → (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 𝑥 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑥 = 𝐶) ↔ ∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 𝑧 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑧 = 𝐶)))
72	55	2rexbidv 3229	. . . . 5 ⊢ (𝑥 = 𝑧 → (∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑥 = 𝐴 ↔ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑧 = 𝐴))
73	71, 72	orbi12d 916	. . . 4 ⊢ (𝑥 = 𝑧 → ((∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 𝑥 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑥 = 𝐶) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑥 = 𝐴) ↔ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 𝑧 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑧 = 𝐶) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑧 = 𝐴)))
74	67, 73	elab 3609	. . 3 ⊢ (𝑧 ∈ {𝑥 ∣ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 𝑥 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑥 = 𝐶) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑥 = 𝐴)} ↔ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 𝑧 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑧 = 𝐶) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑧 = 𝐴))
75	54, 66, 74	3bitr4g 314	. 2 ⊢ ((∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) ∧ 𝑆 ⊆ 𝑈) → (𝑧 ∈ dom {⟨𝑥, 𝑦⟩ ∣ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑥 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑥 = 𝐴 ∧ 𝑦 = 𝐵))} ↔ 𝑧 ∈ {𝑥 ∣ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 𝑥 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑥 = 𝐶) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑥 = 𝐴)}))
76	75	eqrdv 2736	1 ⊢ ((∀𝑢 ∈ 𝑈 (∀𝑣 ∈ 𝑈 𝐵 ∈ 𝑋 ∧ ∀𝑖 ∈ 𝐼 𝐷 ∈ 𝑊) ∧ 𝑆 ⊆ 𝑈) → dom {⟨𝑥, 𝑦⟩ ∣ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 (𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ∨ ∃𝑖 ∈ 𝐼 (𝑥 = 𝐶 ∧ 𝑦 = 𝐷)) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)(𝑥 = 𝐴 ∧ 𝑦 = 𝐵))} = {𝑥 ∣ (∃𝑢 ∈ (𝑈 ∖ 𝑆)(∃𝑣 ∈ 𝑈 𝑥 = 𝐴 ∨ ∃𝑖 ∈ 𝐼 𝑥 = 𝐶) ∨ ∃𝑢 ∈ 𝑆 ∃𝑣 ∈ (𝑈 ∖ 𝑆)𝑥 = 𝐴)})

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 844   = wceq 1539  ∃wex 1782   ∈ wcel 2106  {cab 2715  ∀wral 3064  ∃wrex 3065  Vcvv 3432   ∖ cdif 3884   ⊆ wss 3887  {copab 5136  dom cdm 5589

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-dm 5599

This theorem is referenced by:  satffunlem2lem2  33368