Theorem elxp5 4829

Description: Membership in a cross product requiring no quantifiers or dummy variables. Provides a slightly shorter version of elxp4 4828 when the double intersection does not create class existence problems (caused by int0 3650). (Contributed by NM, 1-Aug-2004.)

Assertion

Ref	Expression
elxp5	⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∧ (∩ ∩ 𝐴 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))

Proof of Theorem elxp5

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 2610	. 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) → 𝐴 ∈ V)
2		elex 2610	. . . 4 ⊢ (∩ ∩ 𝐴 ∈ 𝐵 → ∩ ∩ 𝐴 ∈ V)
3		elex 2610	. . . 4 ⊢ (∪ ran {𝐴} ∈ 𝐶 → ∪ ran {𝐴} ∈ V)
4	2, 3	anim12i 331	. . 3 ⊢ ((∩ ∩ 𝐴 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶) → (∩ ∩ 𝐴 ∈ V ∧ ∪ ran {𝐴} ∈ V))
5		opexg 3983	. . . . 5 ⊢ ((∩ ∩ 𝐴 ∈ V ∧ ∪ ran {𝐴} ∈ V) → ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∈ V)
6	5	adantl 271	. . . 4 ⊢ ((𝐴 = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∧ (∩ ∩ 𝐴 ∈ V ∧ ∪ ran {𝐴} ∈ V)) → ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∈ V)
7		eleq1 2141	. . . . 5 ⊢ (𝐴 = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ → (𝐴 ∈ V ↔ ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∈ V))
8	7	adantr 270	. . . 4 ⊢ ((𝐴 = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∧ (∩ ∩ 𝐴 ∈ V ∧ ∪ ran {𝐴} ∈ V)) → (𝐴 ∈ V ↔ ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∈ V))
9	6, 8	mpbird 165	. . 3 ⊢ ((𝐴 = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∧ (∩ ∩ 𝐴 ∈ V ∧ ∪ ran {𝐴} ∈ V)) → 𝐴 ∈ V)
10	4, 9	sylan2 280	. 2 ⊢ ((𝐴 = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∧ (∩ ∩ 𝐴 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)) → 𝐴 ∈ V)
11		elxp 4380	. . . 4 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))
12		sneq 3409	. . . . . . . . . . . . . 14 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → {𝐴} = {⟨𝑥, 𝑦⟩})
13	12	rneqd 4581	. . . . . . . . . . . . 13 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → ran {𝐴} = ran {⟨𝑥, 𝑦⟩})
14	13	unieqd 3612	. . . . . . . . . . . 12 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → ∪ ran {𝐴} = ∪ ran {⟨𝑥, 𝑦⟩})
15		vex 2604	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
16		vex 2604	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
17	15, 16	op2nda 4825	. . . . . . . . . . . 12 ⊢ ∪ ran {⟨𝑥, 𝑦⟩} = 𝑦
18	14, 17	syl6req 2130	. . . . . . . . . . 11 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → 𝑦 = ∪ ran {𝐴})
19	18	pm4.71ri 384	. . . . . . . . . 10 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ ↔ (𝑦 = ∪ ran {𝐴} ∧ 𝐴 = ⟨𝑥, 𝑦⟩))
20	19	anbi1i 445	. . . . . . . . 9 ⊢ ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ((𝑦 = ∪ ran {𝐴} ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)))
21		anass 393	. . . . . . . . 9 ⊢ (((𝑦 = ∪ ran {𝐴} ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝑦 = ∪ ran {𝐴} ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))))
22	20, 21	bitri 182	. . . . . . . 8 ⊢ ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝑦 = ∪ ran {𝐴} ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))))
23	22	exbii 1536	. . . . . . 7 ⊢ (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ∃𝑦(𝑦 = ∪ ran {𝐴} ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))))
24		snexg 3956	. . . . . . . . . 10 ⊢ (𝐴 ∈ V → {𝐴} ∈ V)
25		rnexg 4615	. . . . . . . . . 10 ⊢ ({𝐴} ∈ V → ran {𝐴} ∈ V)
26	24, 25	syl 14	. . . . . . . . 9 ⊢ (𝐴 ∈ V → ran {𝐴} ∈ V)
27		uniexg 4193	. . . . . . . . 9 ⊢ (ran {𝐴} ∈ V → ∪ ran {𝐴} ∈ V)
28	26, 27	syl 14	. . . . . . . 8 ⊢ (𝐴 ∈ V → ∪ ran {𝐴} ∈ V)
29		opeq2 3571	. . . . . . . . . . 11 ⊢ (𝑦 = ∪ ran {𝐴} → ⟨𝑥, 𝑦⟩ = ⟨𝑥, ∪ ran {𝐴}⟩)
30	29	eqeq2d 2092	. . . . . . . . . 10 ⊢ (𝑦 = ∪ ran {𝐴} → (𝐴 = ⟨𝑥, 𝑦⟩ ↔ 𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩))
31		eleq1 2141	. . . . . . . . . . 11 ⊢ (𝑦 = ∪ ran {𝐴} → (𝑦 ∈ 𝐶 ↔ ∪ ran {𝐴} ∈ 𝐶))
32	31	anbi2d 451	. . . . . . . . . 10 ⊢ (𝑦 = ∪ ran {𝐴} → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))
33	30, 32	anbi12d 456	. . . . . . . . 9 ⊢ (𝑦 = ∪ ran {𝐴} → ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
34	33	ceqsexgv 2724	. . . . . . . 8 ⊢ (∪ ran {𝐴} ∈ V → (∃𝑦(𝑦 = ∪ ran {𝐴} ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) ↔ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
35	28, 34	syl 14	. . . . . . 7 ⊢ (𝐴 ∈ V → (∃𝑦(𝑦 = ∪ ran {𝐴} ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) ↔ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
36	23, 35	syl5bb 190	. . . . . 6 ⊢ (𝐴 ∈ V → (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
37		inteq 3639	. . . . . . . . . . . 12 ⊢ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ → ∩ 𝐴 = ∩ ⟨𝑥, ∪ ran {𝐴}⟩)
38	37	inteqd 3641	. . . . . . . . . . 11 ⊢ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ → ∩ ∩ 𝐴 = ∩ ∩ ⟨𝑥, ∪ ran {𝐴}⟩)
39	38	adantl 271	. . . . . . . . . 10 ⊢ ((𝐴 ∈ V ∧ 𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩) → ∩ ∩ 𝐴 = ∩ ∩ ⟨𝑥, ∪ ran {𝐴}⟩)
40		op1stbg 4228	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ V ∧ ∪ ran {𝐴} ∈ V) → ∩ ∩ ⟨𝑥, ∪ ran {𝐴}⟩ = 𝑥)
41	15, 28, 40	sylancr 405	. . . . . . . . . . 11 ⊢ (𝐴 ∈ V → ∩ ∩ ⟨𝑥, ∪ ran {𝐴}⟩ = 𝑥)
42	41	adantr 270	. . . . . . . . . 10 ⊢ ((𝐴 ∈ V ∧ 𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩) → ∩ ∩ ⟨𝑥, ∪ ran {𝐴}⟩ = 𝑥)
43	39, 42	eqtr2d 2114	. . . . . . . . 9 ⊢ ((𝐴 ∈ V ∧ 𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩) → 𝑥 = ∩ ∩ 𝐴)
44	43	ex 113	. . . . . . . 8 ⊢ (𝐴 ∈ V → (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ → 𝑥 = ∩ ∩ 𝐴))
45	44	pm4.71rd 386	. . . . . . 7 ⊢ (𝐴 ∈ V → (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ↔ (𝑥 = ∩ ∩ 𝐴 ∧ 𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩)))
46	45	anbi1d 452	. . . . . 6 ⊢ (𝐴 ∈ V → ((𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)) ↔ ((𝑥 = ∩ ∩ 𝐴 ∧ 𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩) ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
47		anass 393	. . . . . . 7 ⊢ (((𝑥 = ∩ ∩ 𝐴 ∧ 𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩) ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)) ↔ (𝑥 = ∩ ∩ 𝐴 ∧ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
48	47	a1i 9	. . . . . 6 ⊢ (𝐴 ∈ V → (((𝑥 = ∩ ∩ 𝐴 ∧ 𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩) ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)) ↔ (𝑥 = ∩ ∩ 𝐴 ∧ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))))
49	36, 46, 48	3bitrd 212	. . . . 5 ⊢ (𝐴 ∈ V → (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ (𝑥 = ∩ ∩ 𝐴 ∧ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))))
50	49	exbidv 1746	. . . 4 ⊢ (𝐴 ∈ V → (∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) ↔ ∃𝑥(𝑥 = ∩ ∩ 𝐴 ∧ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))))
51	11, 50	syl5bb 190	. . 3 ⊢ (𝐴 ∈ V → (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥(𝑥 = ∩ ∩ 𝐴 ∧ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))))
52		eqvisset 2609	. . . . . 6 ⊢ (𝑥 = ∩ ∩ 𝐴 → ∩ ∩ 𝐴 ∈ V)
53	52	adantr 270	. . . . 5 ⊢ ((𝑥 = ∩ ∩ 𝐴 ∧ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))) → ∩ ∩ 𝐴 ∈ V)
54	53	exlimiv 1529	. . . 4 ⊢ (∃𝑥(𝑥 = ∩ ∩ 𝐴 ∧ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))) → ∩ ∩ 𝐴 ∈ V)
55	2	ad2antrl 473	. . . 4 ⊢ ((𝐴 = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∧ (∩ ∩ 𝐴 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)) → ∩ ∩ 𝐴 ∈ V)
56		opeq1 3570	. . . . . . 7 ⊢ (𝑥 = ∩ ∩ 𝐴 → ⟨𝑥, ∪ ran {𝐴}⟩ = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩)
57	56	eqeq2d 2092	. . . . . 6 ⊢ (𝑥 = ∩ ∩ 𝐴 → (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ↔ 𝐴 = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩))
58		eleq1 2141	. . . . . . 7 ⊢ (𝑥 = ∩ ∩ 𝐴 → (𝑥 ∈ 𝐵 ↔ ∩ ∩ 𝐴 ∈ 𝐵))
59	58	anbi1d 452	. . . . . 6 ⊢ (𝑥 = ∩ ∩ 𝐴 → ((𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶) ↔ (∩ ∩ 𝐴 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))
60	57, 59	anbi12d 456	. . . . 5 ⊢ (𝑥 = ∩ ∩ 𝐴 → ((𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)) ↔ (𝐴 = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∧ (∩ ∩ 𝐴 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
61	60	ceqsexgv 2724	. . . 4 ⊢ (∩ ∩ 𝐴 ∈ V → (∃𝑥(𝑥 = ∩ ∩ 𝐴 ∧ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))) ↔ (𝐴 = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∧ (∩ ∩ 𝐴 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
62	54, 55, 61	pm5.21nii 652	. . 3 ⊢ (∃𝑥(𝑥 = ∩ ∩ 𝐴 ∧ (𝐴 = ⟨𝑥, ∪ ran {𝐴}⟩ ∧ (𝑥 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))) ↔ (𝐴 = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∧ (∩ ∩ 𝐴 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))
63	51, 62	syl6bb 194	. 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∧ (∩ ∩ 𝐴 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶))))
64	1, 10, 63	pm5.21nii 652	1 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨∩ ∩ 𝐴, ∪ ran {𝐴}⟩ ∧ (∩ ∩ 𝐴 ∈ 𝐵 ∧ ∪ ran {𝐴} ∈ 𝐶)))

Syntax hints:   ∧ wa 102   ↔ wb 103   = wceq 1284  ∃wex 1421   ∈ wcel 1433  Vcvv 2601  {csn 3398  ⟨cop 3401  ∪ cuni 3601  ∩ cint 3636   × cxp 4361  ran crn 4364

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188

This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-br 3786  df-opab 3840  df-xp 4369  df-rel 4370  df-cnv 4371  df-dm 4373  df-rn 4374

This theorem is referenced by: (None)