Theorem genpass 10696

Description: Associativity of an operation on reals. (Contributed by NM, 18-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
genp.1	⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ {𝑥 ∣ ∃𝑦 ∈ 𝑤 ∃𝑧 ∈ 𝑣 𝑥 = (𝑦𝐺𝑧)})
genp.2	⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
genpass.4	⊢ dom 𝐹 = (P × P)
genpass.5	⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P) → (𝑓𝐹𝑔) ∈ P)
genpass.6	⊢ ((𝑓𝐺𝑔)𝐺ℎ) = (𝑓𝐺(𝑔𝐺ℎ))

Assertion

Ref	Expression
genpass	⊢ ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶))

Distinct variable groups:   𝑥,𝑦,𝑧,𝑓,𝑔,ℎ,𝐴   𝑥,𝐵,𝑦,𝑧,𝑓,𝑔,ℎ   𝑥,𝑤,𝑣,𝐺,𝑦,𝑧,𝑓,𝑔,ℎ   𝑓,𝐹,𝑔   𝐶,𝑓,𝑔,ℎ,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧,ℎ

Allowed substitution hints:   𝐴(𝑤,𝑣)   𝐵(𝑤,𝑣)   𝐶(𝑤,𝑣)   𝐹(𝑤,𝑣)

Proof of Theorem genpass

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		genp.1	. . . . . . . . . 10 ⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ {𝑥 ∣ ∃𝑦 ∈ 𝑤 ∃𝑧 ∈ 𝑣 𝑥 = (𝑦𝐺𝑧)})
2		genp.2	. . . . . . . . . 10 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
3	1, 2	genpelv 10687	. . . . . . . . 9 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑡 ∈ (𝐵𝐹𝐶) ↔ ∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑡 = (𝑔𝐺ℎ)))
4	3	3adant1 1128	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑡 ∈ (𝐵𝐹𝐶) ↔ ∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑡 = (𝑔𝐺ℎ)))
5	4	anbi1d 629	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑡 ∈ (𝐵𝐹𝐶) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ (∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
6	5	exbidv 1925	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑡(𝑡 ∈ (𝐵𝐹𝐶) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ ∃𝑡(∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
7		df-rex 3069	. . . . . 6 ⊢ (∃𝑡 ∈ (𝐵𝐹𝐶)𝑥 = (𝑓𝐺𝑡) ↔ ∃𝑡(𝑡 ∈ (𝐵𝐹𝐶) ∧ 𝑥 = (𝑓𝐺𝑡)))
8		ovex 7288	. . . . . . . . . . . . 13 ⊢ (𝑔𝐺ℎ) ∈ V
9	8	isseti 3437	. . . . . . . . . . . 12 ⊢ ∃𝑡 𝑡 = (𝑔𝐺ℎ)
10	9	biantrur 530	. . . . . . . . . . 11 ⊢ (𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ (∃𝑡 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
11		19.41v 1954	. . . . . . . . . . 11 ⊢ (∃𝑡(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ (∃𝑡 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
12	10, 11	bitr4i 277	. . . . . . . . . 10 ⊢ (𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
13	12	rexbii 3177	. . . . . . . . 9 ⊢ (∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃ℎ ∈ 𝐶 ∃𝑡(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
14		rexcom4 3179	. . . . . . . . 9 ⊢ (∃ℎ ∈ 𝐶 ∃𝑡(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ ∃𝑡∃ℎ ∈ 𝐶 (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
15	13, 14	bitri 274	. . . . . . . 8 ⊢ (∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡∃ℎ ∈ 𝐶 (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
16	15	rexbii 3177	. . . . . . 7 ⊢ (∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑔 ∈ 𝐵 ∃𝑡∃ℎ ∈ 𝐶 (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
17		rexcom4 3179	. . . . . . 7 ⊢ (∃𝑔 ∈ 𝐵 ∃𝑡∃ℎ ∈ 𝐶 (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ ∃𝑡∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
18		oveq2 7263	. . . . . . . . . . . . . . 15 ⊢ (𝑡 = (𝑔𝐺ℎ) → (𝑓𝐺𝑡) = (𝑓𝐺(𝑔𝐺ℎ)))
19		genpass.6	. . . . . . . . . . . . . . 15 ⊢ ((𝑓𝐺𝑔)𝐺ℎ) = (𝑓𝐺(𝑔𝐺ℎ))
20	18, 19	eqtr4di 2797	. . . . . . . . . . . . . 14 ⊢ (𝑡 = (𝑔𝐺ℎ) → (𝑓𝐺𝑡) = ((𝑓𝐺𝑔)𝐺ℎ))
21	20	eqeq2d 2749	. . . . . . . . . . . . 13 ⊢ (𝑡 = (𝑔𝐺ℎ) → (𝑥 = (𝑓𝐺𝑡) ↔ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
22	21	pm5.32i 574	. . . . . . . . . . . 12 ⊢ ((𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
23	22	rexbii 3177	. . . . . . . . . . 11 ⊢ (∃ℎ ∈ 𝐶 (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ ∃ℎ ∈ 𝐶 (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
24		r19.41v 3273	. . . . . . . . . . 11 ⊢ (∃ℎ ∈ 𝐶 (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ (∃ℎ ∈ 𝐶 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)))
25	23, 24	bitr3i 276	. . . . . . . . . 10 ⊢ (∃ℎ ∈ 𝐶 (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ (∃ℎ ∈ 𝐶 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)))
26	25	rexbii 3177	. . . . . . . . 9 ⊢ (∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ ∃𝑔 ∈ 𝐵 (∃ℎ ∈ 𝐶 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)))
27		r19.41v 3273	. . . . . . . . 9 ⊢ (∃𝑔 ∈ 𝐵 (∃ℎ ∈ 𝐶 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ (∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)))
28	26, 27	bitri 274	. . . . . . . 8 ⊢ (∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ (∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)))
29	28	exbii 1851	. . . . . . 7 ⊢ (∃𝑡∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ ∃𝑡(∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)))
30	16, 17, 29	3bitri 296	. . . . . 6 ⊢ (∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡(∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)))
31	6, 7, 30	3bitr4g 313	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑡 ∈ (𝐵𝐹𝐶)𝑥 = (𝑓𝐺𝑡) ↔ ∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
32	31	rexbidv 3225	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑓 ∈ 𝐴 ∃𝑡 ∈ (𝐵𝐹𝐶)𝑥 = (𝑓𝐺𝑡) ↔ ∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
33		genpass.5	. . . . . . 7 ⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P) → (𝑓𝐹𝑔) ∈ P)
34	33	caovcl 7444	. . . . . 6 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝐵𝐹𝐶) ∈ P)
35	1, 2	genpelv 10687	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ (𝐵𝐹𝐶) ∈ P) → (𝑥 ∈ (𝐴𝐹(𝐵𝐹𝐶)) ↔ ∃𝑓 ∈ 𝐴 ∃𝑡 ∈ (𝐵𝐹𝐶)𝑥 = (𝑓𝐺𝑡)))
36	34, 35	sylan2 592	. . . . 5 ⊢ ((𝐴 ∈ P ∧ (𝐵 ∈ P ∧ 𝐶 ∈ P)) → (𝑥 ∈ (𝐴𝐹(𝐵𝐹𝐶)) ↔ ∃𝑓 ∈ 𝐴 ∃𝑡 ∈ (𝐵𝐹𝐶)𝑥 = (𝑓𝐺𝑡)))
37	36	3impb 1113	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ (𝐴𝐹(𝐵𝐹𝐶)) ↔ ∃𝑓 ∈ 𝐴 ∃𝑡 ∈ (𝐵𝐹𝐶)𝑥 = (𝑓𝐺𝑡)))
38	33	caovcl 7444	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) ∈ P)
39	1, 2	genpelv 10687	. . . . . 6 ⊢ (((𝐴𝐹𝐵) ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ ((𝐴𝐹𝐵)𝐹𝐶) ↔ ∃𝑡 ∈ (𝐴𝐹𝐵)∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)))
40	38, 39	stoic3 1780	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ ((𝐴𝐹𝐵)𝐹𝐶) ↔ ∃𝑡 ∈ (𝐴𝐹𝐵)∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)))
41	1, 2	genpelv 10687	. . . . . . . . 9 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑡 ∈ (𝐴𝐹𝐵) ↔ ∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 𝑡 = (𝑓𝐺𝑔)))
42	41	3adant3 1130	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑡 ∈ (𝐴𝐹𝐵) ↔ ∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 𝑡 = (𝑓𝐺𝑔)))
43	42	anbi1d 629	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑡 ∈ (𝐴𝐹𝐵) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)) ↔ (∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ))))
44	43	exbidv 1925	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑡(𝑡 ∈ (𝐴𝐹𝐵) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)) ↔ ∃𝑡(∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ))))
45		df-rex 3069	. . . . . 6 ⊢ (∃𝑡 ∈ (𝐴𝐹𝐵)∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ) ↔ ∃𝑡(𝑡 ∈ (𝐴𝐹𝐵) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)))
46		19.41v 1954	. . . . . . . . . . 11 ⊢ (∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ (∃𝑡 𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
47		oveq1 7262	. . . . . . . . . . . . . . 15 ⊢ (𝑡 = (𝑓𝐺𝑔) → (𝑡𝐺ℎ) = ((𝑓𝐺𝑔)𝐺ℎ))
48	47	eqeq2d 2749	. . . . . . . . . . . . . 14 ⊢ (𝑡 = (𝑓𝐺𝑔) → (𝑥 = (𝑡𝐺ℎ) ↔ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
49	48	rexbidv 3225	. . . . . . . . . . . . 13 ⊢ (𝑡 = (𝑓𝐺𝑔) → (∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ) ↔ ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
50	49	pm5.32i 574	. . . . . . . . . . . 12 ⊢ ((𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)) ↔ (𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
51	50	exbii 1851	. . . . . . . . . . 11 ⊢ (∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)) ↔ ∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
52		ovex 7288	. . . . . . . . . . . . 13 ⊢ (𝑓𝐺𝑔) ∈ V
53	52	isseti 3437	. . . . . . . . . . . 12 ⊢ ∃𝑡 𝑡 = (𝑓𝐺𝑔)
54	53	biantrur 530	. . . . . . . . . . 11 ⊢ (∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ (∃𝑡 𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
55	46, 51, 54	3bitr4ri 303	. . . . . . . . . 10 ⊢ (∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)))
56	55	rexbii 3177	. . . . . . . . 9 ⊢ (∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑔 ∈ 𝐵 ∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)))
57		rexcom4 3179	. . . . . . . . 9 ⊢ (∃𝑔 ∈ 𝐵 ∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)) ↔ ∃𝑡∃𝑔 ∈ 𝐵 (𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)))
58	56, 57	bitri 274	. . . . . . . 8 ⊢ (∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡∃𝑔 ∈ 𝐵 (𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)))
59	58	rexbii 3177	. . . . . . 7 ⊢ (∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑓 ∈ 𝐴 ∃𝑡∃𝑔 ∈ 𝐵 (𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)))
60		rexcom4 3179	. . . . . . 7 ⊢ (∃𝑓 ∈ 𝐴 ∃𝑡∃𝑔 ∈ 𝐵 (𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)) ↔ ∃𝑡∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 (𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)))
61		r19.41vv 3275	. . . . . . . 8 ⊢ (∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 (𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)) ↔ (∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)))
62	61	exbii 1851	. . . . . . 7 ⊢ (∃𝑡∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 (𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)) ↔ ∃𝑡(∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)))
63	59, 60, 62	3bitri 296	. . . . . 6 ⊢ (∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡(∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ)))
64	44, 45, 63	3bitr4g 313	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑡 ∈ (𝐴𝐹𝐵)∃ℎ ∈ 𝐶 𝑥 = (𝑡𝐺ℎ) ↔ ∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
65	40, 64	bitrd 278	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ ((𝐴𝐹𝐵)𝐹𝐶) ↔ ∃𝑓 ∈ 𝐴 ∃𝑔 ∈ 𝐵 ∃ℎ ∈ 𝐶 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
66	32, 37, 65	3bitr4rd 311	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ ((𝐴𝐹𝐵)𝐹𝐶) ↔ 𝑥 ∈ (𝐴𝐹(𝐵𝐹𝐶))))
67	66	eqrdv 2736	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)))
68		genpass.4	. . 3 ⊢ dom 𝐹 = (P × P)
69		0npr 10679	. . 3 ⊢ ¬ ∅ ∈ P
70	68, 69	ndmovass 7438	. 2 ⊢ (¬ (𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)))
71	67, 70	pm2.61i 182	1 ⊢ ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539  ∃wex 1783   ∈ wcel 2108  {cab 2715  ∃wrex 3064   × cxp 5578  dom cdm 5580  (class class class)co 7255   ∈ cmpo 7257  Qcnq 10539  Pcnp 10546

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-inf2 9329

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-ni 10559  df-nq 10599  df-np 10668

This theorem is referenced by:  addasspr  10709  mulasspr  10711