Theorem tpres 6940

Description: An unordered triple of ordered pairs restricted to all but one first components of the pairs is an unordered pair of ordered pairs. (Contributed by AV, 14-Mar-2020.)

Hypotheses

Ref	Expression
tpres.t	⊢ (𝜑 → 𝑇 = {⟨𝐴, 𝐷⟩, ⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩})
tpres.b	⊢ (𝜑 → 𝐵 ∈ 𝑉)
tpres.c	⊢ (𝜑 → 𝐶 ∈ 𝑉)
tpres.e	⊢ (𝜑 → 𝐸 ∈ 𝑉)
tpres.f	⊢ (𝜑 → 𝐹 ∈ 𝑉)
tpres.1	⊢ (𝜑 → 𝐵 ≠ 𝐴)
tpres.2	⊢ (𝜑 → 𝐶 ≠ 𝐴)

Assertion

Ref	Expression
tpres	⊢ (𝜑 → (𝑇 ↾ (V ∖ {𝐴})) = {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩})

Proof of Theorem tpres

Dummy variables 𝑎 𝑏 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-res 5531	. 2 ⊢ (𝑇 ↾ (V ∖ {𝐴})) = (𝑇 ∩ ((V ∖ {𝐴}) × V))
2		elin 3897	. . . 4 ⊢ (𝑥 ∈ (𝑇 ∩ ((V ∖ {𝐴}) × V)) ↔ (𝑥 ∈ 𝑇 ∧ 𝑥 ∈ ((V ∖ {𝐴}) × V)))
3		elxp 5542	. . . . . 6 ⊢ (𝑥 ∈ ((V ∖ {𝐴}) × V) ↔ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)))
4	3	anbi2i 625	. . . . 5 ⊢ ((𝑥 ∈ 𝑇 ∧ 𝑥 ∈ ((V ∖ {𝐴}) × V)) ↔ (𝑥 ∈ 𝑇 ∧ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V))))
5		tpres.t	. . . . . . . . 9 ⊢ (𝜑 → 𝑇 = {⟨𝐴, 𝐷⟩, ⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩})
6	5	eleq2d 2875	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝑇 ↔ 𝑥 ∈ {⟨𝐴, 𝐷⟩, ⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩}))
7		vex 3444	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
8	7	eltp 4586	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ {⟨𝐴, 𝐷⟩, ⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩} ↔ (𝑥 = ⟨𝐴, 𝐷⟩ ∨ 𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))
9		eldifsn 4680	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 ∈ (V ∖ {𝐴}) ↔ (𝑎 ∈ V ∧ 𝑎 ≠ 𝐴))
10		eqeq1 2802	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (𝑥 = ⟨𝐴, 𝐷⟩ ↔ ⟨𝑎, 𝑏⟩ = ⟨𝐴, 𝐷⟩))
11	10	adantl 485	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑎 ≠ 𝐴 ∧ 𝑥 = ⟨𝑎, 𝑏⟩) → (𝑥 = ⟨𝐴, 𝐷⟩ ↔ ⟨𝑎, 𝑏⟩ = ⟨𝐴, 𝐷⟩))
12		vex 3444	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ 𝑎 ∈ V
13		vex 3444	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ 𝑏 ∈ V
14	12, 13	opth 5333	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (⟨𝑎, 𝑏⟩ = ⟨𝐴, 𝐷⟩ ↔ (𝑎 = 𝐴 ∧ 𝑏 = 𝐷))
15		eqneqall 2998	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑎 = 𝐴 → (𝑎 ≠ 𝐴 → (𝑏 = 𝐷 → (𝜑 → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩)))))
16	15	com12 32	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑎 ≠ 𝐴 → (𝑎 = 𝐴 → (𝑏 = 𝐷 → (𝜑 → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩)))))
17	16	impd 414	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑎 ≠ 𝐴 → ((𝑎 = 𝐴 ∧ 𝑏 = 𝐷) → (𝜑 → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))))
18	14, 17	syl5bi 245	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑎 ≠ 𝐴 → (⟨𝑎, 𝑏⟩ = ⟨𝐴, 𝐷⟩ → (𝜑 → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))))
19	18	adantr 484	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑎 ≠ 𝐴 ∧ 𝑥 = ⟨𝑎, 𝑏⟩) → (⟨𝑎, 𝑏⟩ = ⟨𝐴, 𝐷⟩ → (𝜑 → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))))
20	11, 19	sylbid 243	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑎 ≠ 𝐴 ∧ 𝑥 = ⟨𝑎, 𝑏⟩) → (𝑥 = ⟨𝐴, 𝐷⟩ → (𝜑 → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))))
21	20	impd 414	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑎 ≠ 𝐴 ∧ 𝑥 = ⟨𝑎, 𝑏⟩) → ((𝑥 = ⟨𝐴, 𝐷⟩ ∧ 𝜑) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩)))
22	21	ex 416	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑎 ≠ 𝐴 → (𝑥 = ⟨𝑎, 𝑏⟩ → ((𝑥 = ⟨𝐴, 𝐷⟩ ∧ 𝜑) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))))
23	22	adantl 485	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) → (𝑥 = ⟨𝑎, 𝑏⟩ → ((𝑥 = ⟨𝐴, 𝐷⟩ ∧ 𝜑) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))))
24	9, 23	sylbi 220	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 ∈ (V ∖ {𝐴}) → (𝑥 = ⟨𝑎, 𝑏⟩ → ((𝑥 = ⟨𝐴, 𝐷⟩ ∧ 𝜑) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))))
25	24	adantr 484	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V) → (𝑥 = ⟨𝑎, 𝑏⟩ → ((𝑥 = ⟨𝐴, 𝐷⟩ ∧ 𝜑) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))))
26	25	impcom 411	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)) → ((𝑥 = ⟨𝐴, 𝐷⟩ ∧ 𝜑) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩)))
27	26	com12 32	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 = ⟨𝐴, 𝐷⟩ ∧ 𝜑) → ((𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩)))
28	27	exlimdvv 1935	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 = ⟨𝐴, 𝐷⟩ ∧ 𝜑) → (∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩)))
29	28	ex 416	. . . . . . . . . . . . . 14 ⊢ (𝑥 = ⟨𝐴, 𝐷⟩ → (𝜑 → (∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))))
30	29	impd 414	. . . . . . . . . . . . 13 ⊢ (𝑥 = ⟨𝐴, 𝐷⟩ → ((𝜑 ∧ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V))) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩)))
31		orc 864	. . . . . . . . . . . . . 14 ⊢ (𝑥 = ⟨𝐵, 𝐸⟩ → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))
32	31	a1d 25	. . . . . . . . . . . . 13 ⊢ (𝑥 = ⟨𝐵, 𝐸⟩ → ((𝜑 ∧ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V))) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩)))
33		olc 865	. . . . . . . . . . . . . 14 ⊢ (𝑥 = ⟨𝐶, 𝐹⟩ → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))
34	33	a1d 25	. . . . . . . . . . . . 13 ⊢ (𝑥 = ⟨𝐶, 𝐹⟩ → ((𝜑 ∧ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V))) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩)))
35	30, 32, 34	3jaoi 1424	. . . . . . . . . . . 12 ⊢ ((𝑥 = ⟨𝐴, 𝐷⟩ ∨ 𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩) → ((𝜑 ∧ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V))) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩)))
36	8, 35	sylbi 220	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {⟨𝐴, 𝐷⟩, ⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩} → ((𝜑 ∧ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V))) → (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩)))
37	7	elpr 4548	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩} ↔ (𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))
38	36, 37	syl6ibr 255	. . . . . . . . . 10 ⊢ (𝑥 ∈ {⟨𝐴, 𝐷⟩, ⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩} → ((𝜑 ∧ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V))) → 𝑥 ∈ {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩}))
39	38	expd 419	. . . . . . . . 9 ⊢ (𝑥 ∈ {⟨𝐴, 𝐷⟩, ⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩} → (𝜑 → (∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)) → 𝑥 ∈ {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩})))
40	39	com12 32	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ {⟨𝐴, 𝐷⟩, ⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩} → (∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)) → 𝑥 ∈ {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩})))
41	6, 40	sylbid 243	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝑇 → (∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)) → 𝑥 ∈ {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩})))
42	41	impd 414	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ 𝑇 ∧ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V))) → 𝑥 ∈ {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩}))
43		3mix2 1328	. . . . . . . . . . . . 13 ⊢ (𝑥 = ⟨𝐵, 𝐸⟩ → (𝑥 = ⟨𝐴, 𝐷⟩ ∨ 𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))
44		3mix3 1329	. . . . . . . . . . . . 13 ⊢ (𝑥 = ⟨𝐶, 𝐹⟩ → (𝑥 = ⟨𝐴, 𝐷⟩ ∨ 𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))
45	43, 44	jaoi 854	. . . . . . . . . . . 12 ⊢ ((𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩) → (𝑥 = ⟨𝐴, 𝐷⟩ ∨ 𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))
46	45	adantr 484	. . . . . . . . . . 11 ⊢ (((𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩) ∧ 𝜑) → (𝑥 = ⟨𝐴, 𝐷⟩ ∨ 𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩))
47	6, 8	syl6bb 290	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ 𝑇 ↔ (𝑥 = ⟨𝐴, 𝐷⟩ ∨ 𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩)))
48	47	adantl 485	. . . . . . . . . . 11 ⊢ (((𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩) ∧ 𝜑) → (𝑥 ∈ 𝑇 ↔ (𝑥 = ⟨𝐴, 𝐷⟩ ∨ 𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩)))
49	46, 48	mpbird 260	. . . . . . . . . 10 ⊢ (((𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩) ∧ 𝜑) → 𝑥 ∈ 𝑇)
50		tpres.b	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
51	50	elexd 3461	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐵 ∈ V)
52		tpres.1	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐵 ≠ 𝐴)
53		tpres.e	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐸 ∈ 𝑉)
54	53	elexd 3461	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐸 ∈ V)
55	51, 52, 54	jca31 518	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝐵 ∈ V ∧ 𝐵 ≠ 𝐴) ∧ 𝐸 ∈ V))
56	55	anim2i 619	. . . . . . . . . . . . 13 ⊢ ((𝑥 = ⟨𝐵, 𝐸⟩ ∧ 𝜑) → (𝑥 = ⟨𝐵, 𝐸⟩ ∧ ((𝐵 ∈ V ∧ 𝐵 ≠ 𝐴) ∧ 𝐸 ∈ V)))
57		opeq12 4767	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑎 = 𝐵 ∧ 𝑏 = 𝐸) → ⟨𝑎, 𝑏⟩ = ⟨𝐵, 𝐸⟩)
58	57	eqeq2d 2809	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑎 = 𝐵 ∧ 𝑏 = 𝐸) → (𝑥 = ⟨𝑎, 𝑏⟩ ↔ 𝑥 = ⟨𝐵, 𝐸⟩))
59		eleq1 2877	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = 𝐵 → (𝑎 ∈ V ↔ 𝐵 ∈ V))
60		neeq1 3049	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = 𝐵 → (𝑎 ≠ 𝐴 ↔ 𝐵 ≠ 𝐴))
61	59, 60	anbi12d 633	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 = 𝐵 → ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ↔ (𝐵 ∈ V ∧ 𝐵 ≠ 𝐴)))
62		eleq1 2877	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 = 𝐸 → (𝑏 ∈ V ↔ 𝐸 ∈ V))
63	61, 62	bi2anan9 638	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑎 = 𝐵 ∧ 𝑏 = 𝐸) → (((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V) ↔ ((𝐵 ∈ V ∧ 𝐵 ≠ 𝐴) ∧ 𝐸 ∈ V)))
64	58, 63	anbi12d 633	. . . . . . . . . . . . . . . 16 ⊢ ((𝑎 = 𝐵 ∧ 𝑏 = 𝐸) → ((𝑥 = ⟨𝑎, 𝑏⟩ ∧ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V)) ↔ (𝑥 = ⟨𝐵, 𝐸⟩ ∧ ((𝐵 ∈ V ∧ 𝐵 ≠ 𝐴) ∧ 𝐸 ∈ V))))
65	64	spc2egv 3548	. . . . . . . . . . . . . . 15 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐸 ∈ 𝑉) → ((𝑥 = ⟨𝐵, 𝐸⟩ ∧ ((𝐵 ∈ V ∧ 𝐵 ≠ 𝐴) ∧ 𝐸 ∈ V)) → ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V))))
66	50, 53, 65	syl2anc 587	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝑥 = ⟨𝐵, 𝐸⟩ ∧ ((𝐵 ∈ V ∧ 𝐵 ≠ 𝐴) ∧ 𝐸 ∈ V)) → ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V))))
67	66	adantl 485	. . . . . . . . . . . . 13 ⊢ ((𝑥 = ⟨𝐵, 𝐸⟩ ∧ 𝜑) → ((𝑥 = ⟨𝐵, 𝐸⟩ ∧ ((𝐵 ∈ V ∧ 𝐵 ≠ 𝐴) ∧ 𝐸 ∈ V)) → ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V))))
68	56, 67	mpd 15	. . . . . . . . . . . 12 ⊢ ((𝑥 = ⟨𝐵, 𝐸⟩ ∧ 𝜑) → ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V)))
69		tpres.c	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
70	69	elexd 3461	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐶 ∈ V)
71		tpres.2	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐶 ≠ 𝐴)
72		tpres.f	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
73	72	elexd 3461	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹 ∈ V)
74	70, 71, 73	jca31 518	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝐶 ∈ V ∧ 𝐶 ≠ 𝐴) ∧ 𝐹 ∈ V))
75	74	anim2i 619	. . . . . . . . . . . . 13 ⊢ ((𝑥 = ⟨𝐶, 𝐹⟩ ∧ 𝜑) → (𝑥 = ⟨𝐶, 𝐹⟩ ∧ ((𝐶 ∈ V ∧ 𝐶 ≠ 𝐴) ∧ 𝐹 ∈ V)))
76		opeq12 4767	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑎 = 𝐶 ∧ 𝑏 = 𝐹) → ⟨𝑎, 𝑏⟩ = ⟨𝐶, 𝐹⟩)
77	76	eqeq2d 2809	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑎 = 𝐶 ∧ 𝑏 = 𝐹) → (𝑥 = ⟨𝑎, 𝑏⟩ ↔ 𝑥 = ⟨𝐶, 𝐹⟩))
78		eleq1 2877	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = 𝐶 → (𝑎 ∈ V ↔ 𝐶 ∈ V))
79		neeq1 3049	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = 𝐶 → (𝑎 ≠ 𝐴 ↔ 𝐶 ≠ 𝐴))
80	78, 79	anbi12d 633	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 = 𝐶 → ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ↔ (𝐶 ∈ V ∧ 𝐶 ≠ 𝐴)))
81		eleq1 2877	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 = 𝐹 → (𝑏 ∈ V ↔ 𝐹 ∈ V))
82	80, 81	bi2anan9 638	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑎 = 𝐶 ∧ 𝑏 = 𝐹) → (((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V) ↔ ((𝐶 ∈ V ∧ 𝐶 ≠ 𝐴) ∧ 𝐹 ∈ V)))
83	77, 82	anbi12d 633	. . . . . . . . . . . . . . . 16 ⊢ ((𝑎 = 𝐶 ∧ 𝑏 = 𝐹) → ((𝑥 = ⟨𝑎, 𝑏⟩ ∧ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V)) ↔ (𝑥 = ⟨𝐶, 𝐹⟩ ∧ ((𝐶 ∈ V ∧ 𝐶 ≠ 𝐴) ∧ 𝐹 ∈ V))))
84	83	spc2egv 3548	. . . . . . . . . . . . . . 15 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐹 ∈ 𝑉) → ((𝑥 = ⟨𝐶, 𝐹⟩ ∧ ((𝐶 ∈ V ∧ 𝐶 ≠ 𝐴) ∧ 𝐹 ∈ V)) → ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V))))
85	69, 72, 84	syl2anc 587	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝑥 = ⟨𝐶, 𝐹⟩ ∧ ((𝐶 ∈ V ∧ 𝐶 ≠ 𝐴) ∧ 𝐹 ∈ V)) → ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V))))
86	85	adantl 485	. . . . . . . . . . . . 13 ⊢ ((𝑥 = ⟨𝐶, 𝐹⟩ ∧ 𝜑) → ((𝑥 = ⟨𝐶, 𝐹⟩ ∧ ((𝐶 ∈ V ∧ 𝐶 ≠ 𝐴) ∧ 𝐹 ∈ V)) → ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V))))
87	75, 86	mpd 15	. . . . . . . . . . . 12 ⊢ ((𝑥 = ⟨𝐶, 𝐹⟩ ∧ 𝜑) → ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V)))
88	68, 87	jaoian 954	. . . . . . . . . . 11 ⊢ (((𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩) ∧ 𝜑) → ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V)))
89	9	anbi1i 626	. . . . . . . . . . . . 13 ⊢ ((𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V) ↔ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V))
90	89	anbi2i 625	. . . . . . . . . . . 12 ⊢ ((𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)) ↔ (𝑥 = ⟨𝑎, 𝑏⟩ ∧ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V)))
91	90	2exbii 1850	. . . . . . . . . . 11 ⊢ (∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)) ↔ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ ((𝑎 ∈ V ∧ 𝑎 ≠ 𝐴) ∧ 𝑏 ∈ V)))
92	88, 91	sylibr 237	. . . . . . . . . 10 ⊢ (((𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩) ∧ 𝜑) → ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)))
93	49, 92	jca 515	. . . . . . . . 9 ⊢ (((𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩) ∧ 𝜑) → (𝑥 ∈ 𝑇 ∧ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V))))
94	93	ex 416	. . . . . . . 8 ⊢ ((𝑥 = ⟨𝐵, 𝐸⟩ ∨ 𝑥 = ⟨𝐶, 𝐹⟩) → (𝜑 → (𝑥 ∈ 𝑇 ∧ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)))))
95	37, 94	sylbi 220	. . . . . . 7 ⊢ (𝑥 ∈ {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩} → (𝜑 → (𝑥 ∈ 𝑇 ∧ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)))))
96	95	com12 32	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩} → (𝑥 ∈ 𝑇 ∧ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V)))))
97	42, 96	impbid 215	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝑇 ∧ ∃𝑎∃𝑏(𝑥 = ⟨𝑎, 𝑏⟩ ∧ (𝑎 ∈ (V ∖ {𝐴}) ∧ 𝑏 ∈ V))) ↔ 𝑥 ∈ {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩}))
98	4, 97	syl5bb 286	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝑇 ∧ 𝑥 ∈ ((V ∖ {𝐴}) × V)) ↔ 𝑥 ∈ {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩}))
99	2, 98	syl5bb 286	. . 3 ⊢ (𝜑 → (𝑥 ∈ (𝑇 ∩ ((V ∖ {𝐴}) × V)) ↔ 𝑥 ∈ {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩}))
100	99	eqrdv 2796	. 2 ⊢ (𝜑 → (𝑇 ∩ ((V ∖ {𝐴}) × V)) = {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩})
101	1, 100	syl5eq 2845	1 ⊢ (𝜑 → (𝑇 ↾ (V ∖ {𝐴})) = {⟨𝐵, 𝐸⟩, ⟨𝐶, 𝐹⟩})

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∨ wo 844   ∨ w3o 1083   = wceq 1538  ∃wex 1781   ∈ wcel 2111   ≠ wne 2987  Vcvv 3441   ∖ cdif 3878   ∩ cin 3880  {csn 4525  {cpr 4527  {ctp 4529  ⟨cop 4531   × cxp 5517   ↾ cres 5521

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-opab 5093  df-xp 5525  df-res 5531

This theorem is referenced by:  estrres  17381  symgvalstruct  18517