genpassl - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > genpassl		GIF version

Theorem genpassl 7644

Description: Associativity of lower cuts. Lemma for genpassg 7646. (Contributed by Jim Kingdon, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
genpelvl.1	⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
genpelvl.2	⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
genpassg.4	⊢ dom 𝐹 = (P × P)
genpassg.5	⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P) → (𝑓𝐹𝑔) ∈ P)
genpassg.6	⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q) → ((𝑓𝐺𝑔)𝐺ℎ) = (𝑓𝐺(𝑔𝐺ℎ)))

**Assertion**
Ref	Expression
genpassl	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (1^st ‘((𝐴𝐹𝐵)𝐹𝐶)) = (1^st ‘(𝐴𝐹(𝐵𝐹𝐶))))

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

Proof of Theorem genpassl Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		prop 7595	. . . . . . . . 9 ⊢ (𝐴 ∈ P → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
2		elprnql 7601	. . . . . . . . 9 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → 𝑓 ∈ Q)
3	1, 2	sylan 283	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴)) → 𝑓 ∈ Q)
4		prop 7595	. . . . . . . . . . . . . . . 16 ⊢ (𝐵 ∈ P → ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P)
5		elprnql 7601	. . . . . . . . . . . . . . . 16 ⊢ ((⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P ∧ 𝑔 ∈ (1^st ‘𝐵)) → 𝑔 ∈ Q)
6	4, 5	sylan 283	. . . . . . . . . . . . . . 15 ⊢ ((𝐵 ∈ P ∧ 𝑔 ∈ (1^st ‘𝐵)) → 𝑔 ∈ Q)
7		prop 7595	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐶 ∈ P → ⟨(1^st ‘𝐶), (2^nd ‘𝐶)⟩ ∈ P)
8		elprnql 7601	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((⟨(1^st ‘𝐶), (2^nd ‘𝐶)⟩ ∈ P ∧ ℎ ∈ (1^st ‘𝐶)) → ℎ ∈ Q)
9	7, 8	sylan 283	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐶 ∈ P ∧ ℎ ∈ (1^st ‘𝐶)) → ℎ ∈ Q)
10		oveq2 5959	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑡 = (𝑔𝐺ℎ) → (𝑓𝐺𝑡) = (𝑓𝐺(𝑔𝐺ℎ)))
11	10	adantr 276	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑡 = (𝑔𝐺ℎ) ∧ (𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q)) → (𝑓𝐺𝑡) = (𝑓𝐺(𝑔𝐺ℎ)))
12		genpassg.6	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q) → ((𝑓𝐺𝑔)𝐺ℎ) = (𝑓𝐺(𝑔𝐺ℎ)))
13	12	adantl 277	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑡 = (𝑔𝐺ℎ) ∧ (𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q)) → ((𝑓𝐺𝑔)𝐺ℎ) = (𝑓𝐺(𝑔𝐺ℎ)))
14	11, 13	eqtr4d 2242	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑡 = (𝑔𝐺ℎ) ∧ (𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q)) → (𝑓𝐺𝑡) = ((𝑓𝐺𝑔)𝐺ℎ))
15	14	eqeq2d 2218	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑡 = (𝑔𝐺ℎ) ∧ (𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q)) → (𝑥 = (𝑓𝐺𝑡) ↔ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
16	15	expcom 116	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑡 = (𝑔𝐺ℎ) → (𝑥 = (𝑓𝐺𝑡) ↔ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
17	16	pm5.32d 450	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q) → ((𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
18	17	3expa 1206	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑓 ∈ Q ∧ 𝑔 ∈ Q) ∧ ℎ ∈ Q) → ((𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
19	9, 18	sylan2 286	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑓 ∈ Q ∧ 𝑔 ∈ Q) ∧ (𝐶 ∈ P ∧ ℎ ∈ (1^st ‘𝐶))) → ((𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
20	19	anassrs 400	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑓 ∈ Q ∧ 𝑔 ∈ Q) ∧ 𝐶 ∈ P) ∧ ℎ ∈ (1^st ‘𝐶)) → ((𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ (𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
21	20	rexbidva 2504	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑓 ∈ Q ∧ 𝑔 ∈ Q) ∧ 𝐶 ∈ P) → (∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ ∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
22		r19.41v 2663	. . . . . . . . . . . . . . . . 17 ⊢ (∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ (∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)))
23	21, 22	bitr3di 195	. . . . . . . . . . . . . . . 16 ⊢ (((𝑓 ∈ Q ∧ 𝑔 ∈ Q) ∧ 𝐶 ∈ P) → (∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ (∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
24	23	an32s 568	. . . . . . . . . . . . . . 15 ⊢ (((𝑓 ∈ Q ∧ 𝐶 ∈ P) ∧ 𝑔 ∈ Q) → (∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ (∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
25	6, 24	sylan2 286	. . . . . . . . . . . . . 14 ⊢ (((𝑓 ∈ Q ∧ 𝐶 ∈ P) ∧ (𝐵 ∈ P ∧ 𝑔 ∈ (1^st ‘𝐵))) → (∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ (∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
26	25	anassrs 400	. . . . . . . . . . . . 13 ⊢ ((((𝑓 ∈ Q ∧ 𝐶 ∈ P) ∧ 𝐵 ∈ P) ∧ 𝑔 ∈ (1^st ‘𝐵)) → (∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ (∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
27	26	rexbidva 2504	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ Q ∧ 𝐶 ∈ P) ∧ 𝐵 ∈ P) → (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ ∃𝑔 ∈ (1^st ‘𝐵)(∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
28		r19.41v 2663	. . . . . . . . . . . 12 ⊢ (∃𝑔 ∈ (1^st ‘𝐵)(∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡)))
29	27, 28	bitrdi 196	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ Q ∧ 𝐶 ∈ P) ∧ 𝐵 ∈ P) → (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
30	29	an31s 570	. . . . . . . . . 10 ⊢ (((𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ 𝑓 ∈ Q) → (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
31	30	exbidv 1849	. . . . . . . . 9 ⊢ (((𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ 𝑓 ∈ Q) → (∃𝑡∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ ∃𝑡(∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
32		genpelvl.2	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
33	32	caovcl 6108	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑔𝐺ℎ) ∈ Q)
34		elisset 2787	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑔𝐺ℎ) ∈ Q → ∃𝑡 𝑡 = (𝑔𝐺ℎ))
35	33, 34	syl 14	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → ∃𝑡 𝑡 = (𝑔𝐺ℎ))
36	35	biantrurd 305	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ (∃𝑡 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
37		19.41v 1927	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (∃𝑡(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ (∃𝑡 𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
38	36, 37	bitr4di 198	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
39	9, 38	sylan2 286	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑔 ∈ Q ∧ (𝐶 ∈ P ∧ ℎ ∈ (1^st ‘𝐶))) → (𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
40	39	anassrs 400	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑔 ∈ Q ∧ 𝐶 ∈ P) ∧ ℎ ∈ (1^st ‘𝐶)) → (𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
41	40	rexbidva 2504	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑔 ∈ Q ∧ 𝐶 ∈ P) → (∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃ℎ ∈ (1^st ‘𝐶)∃𝑡(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
42		rexcom4 2796	. . . . . . . . . . . . . . . . 17 ⊢ (∃ℎ ∈ (1^st ‘𝐶)∃𝑡(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ ∃𝑡∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
43	41, 42	bitrdi 196	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔 ∈ Q ∧ 𝐶 ∈ P) → (∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
44	43	ancoms 268	. . . . . . . . . . . . . . 15 ⊢ ((𝐶 ∈ P ∧ 𝑔 ∈ Q) → (∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
45	6, 44	sylan2 286	. . . . . . . . . . . . . 14 ⊢ ((𝐶 ∈ P ∧ (𝐵 ∈ P ∧ 𝑔 ∈ (1^st ‘𝐵))) → (∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
46	45	anassrs 400	. . . . . . . . . . . . 13 ⊢ (((𝐶 ∈ P ∧ 𝐵 ∈ P) ∧ 𝑔 ∈ (1^st ‘𝐵)) → (∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
47	46	rexbidva 2504	. . . . . . . . . . . 12 ⊢ ((𝐶 ∈ P ∧ 𝐵 ∈ P) → (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑔 ∈ (1^st ‘𝐵)∃𝑡∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
48	47	ancoms 268	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑔 ∈ (1^st ‘𝐵)∃𝑡∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
49		rexcom4 2796	. . . . . . . . . . 11 ⊢ (∃𝑔 ∈ (1^st ‘𝐵)∃𝑡∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ ∃𝑡∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
50	48, 49	bitrdi 196	. . . . . . . . . 10 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
51	50	adantr 276	. . . . . . . . 9 ⊢ (((𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ 𝑓 ∈ Q) → (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)(𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
52		df-rex 2491	. . . . . . . . . . 11 ⊢ (∃𝑡 ∈ (1^st ‘(𝐵𝐹𝐶))𝑥 = (𝑓𝐺𝑡) ↔ ∃𝑡(𝑡 ∈ (1^st ‘(𝐵𝐹𝐶)) ∧ 𝑥 = (𝑓𝐺𝑡)))
53		genpelvl.1	. . . . . . . . . . . . . 14 ⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦𝐺𝑧))}⟩)
54	53, 32	genpelvl 7632	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑡 ∈ (1^st ‘(𝐵𝐹𝐶)) ↔ ∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ)))
55	54	anbi1d 465	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑡 ∈ (1^st ‘(𝐵𝐹𝐶)) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
56	55	exbidv 1849	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑡(𝑡 ∈ (1^st ‘(𝐵𝐹𝐶)) ∧ 𝑥 = (𝑓𝐺𝑡)) ↔ ∃𝑡(∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
57	52, 56	bitrid 192	. . . . . . . . . 10 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑡 ∈ (1^st ‘(𝐵𝐹𝐶))𝑥 = (𝑓𝐺𝑡) ↔ ∃𝑡(∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
58	57	adantr 276	. . . . . . . . 9 ⊢ (((𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ 𝑓 ∈ Q) → (∃𝑡 ∈ (1^st ‘(𝐵𝐹𝐶))𝑥 = (𝑓𝐺𝑡) ↔ ∃𝑡(∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑡 = (𝑔𝐺ℎ) ∧ 𝑥 = (𝑓𝐺𝑡))))
59	31, 51, 58	3bitr4rd 221	. . . . . . . 8 ⊢ (((𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ 𝑓 ∈ Q) → (∃𝑡 ∈ (1^st ‘(𝐵𝐹𝐶))𝑥 = (𝑓𝐺𝑡) ↔ ∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
60	3, 59	sylan2 286	. . . . . . 7 ⊢ (((𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ (𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴))) → (∃𝑡 ∈ (1^st ‘(𝐵𝐹𝐶))𝑥 = (𝑓𝐺𝑡) ↔ ∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
61	60	anassrs 400	. . . . . 6 ⊢ ((((𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ 𝐴 ∈ P) ∧ 𝑓 ∈ (1^st ‘𝐴)) → (∃𝑡 ∈ (1^st ‘(𝐵𝐹𝐶))𝑥 = (𝑓𝐺𝑡) ↔ ∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
62	61	rexbidva 2504	. . . . 5 ⊢ (((𝐵 ∈ P ∧ 𝐶 ∈ P) ∧ 𝐴 ∈ P) → (∃𝑓 ∈ (1^st ‘𝐴)∃𝑡 ∈ (1^st ‘(𝐵𝐹𝐶))𝑥 = (𝑓𝐺𝑡) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
63	62	ancoms 268	. . . 4 ⊢ ((𝐴 ∈ P ∧ (𝐵 ∈ P ∧ 𝐶 ∈ P)) → (∃𝑓 ∈ (1^st ‘𝐴)∃𝑡 ∈ (1^st ‘(𝐵𝐹𝐶))𝑥 = (𝑓𝐺𝑡) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
64	63	3impb 1202	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑓 ∈ (1^st ‘𝐴)∃𝑡 ∈ (1^st ‘(𝐵𝐹𝐶))𝑥 = (𝑓𝐺𝑡) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
65		genpassg.5	. . . . . 6 ⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P) → (𝑓𝐹𝑔) ∈ P)
66	65	caovcl 6108	. . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝐵𝐹𝐶) ∈ P)
67	53, 32	genpelvl 7632	. . . . 5 ⊢ ((𝐴 ∈ P ∧ (𝐵𝐹𝐶) ∈ P) → (𝑥 ∈ (1^st ‘(𝐴𝐹(𝐵𝐹𝐶))) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑡 ∈ (1^st ‘(𝐵𝐹𝐶))𝑥 = (𝑓𝐺𝑡)))
68	66, 67	sylan2 286	. . . 4 ⊢ ((𝐴 ∈ P ∧ (𝐵 ∈ P ∧ 𝐶 ∈ P)) → (𝑥 ∈ (1^st ‘(𝐴𝐹(𝐵𝐹𝐶))) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑡 ∈ (1^st ‘(𝐵𝐹𝐶))𝑥 = (𝑓𝐺𝑡)))
69	68	3impb 1202	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ (1^st ‘(𝐴𝐹(𝐵𝐹𝐶))) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑡 ∈ (1^st ‘(𝐵𝐹𝐶))𝑥 = (𝑓𝐺𝑡)))
70		df-rex 2491	. . . . 5 ⊢ (∃𝑡 ∈ (1^st ‘(𝐴𝐹𝐵))∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ) ↔ ∃𝑡(𝑡 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)))
71	53, 32	genpelvl 7632	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑡 ∈ (1^st ‘(𝐴𝐹𝐵)) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔)))
72	71	3adant3 1020	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑡 ∈ (1^st ‘(𝐴𝐹𝐵)) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔)))
73	72	anbi1d 465	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝑡 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)) ↔ (∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
74	73	exbidv 1849	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑡(𝑡 ∈ (1^st ‘(𝐴𝐹𝐵)) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)) ↔ ∃𝑡(∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
75	70, 74	bitrid 192	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑡 ∈ (1^st ‘(𝐴𝐹𝐵))∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ) ↔ ∃𝑡(∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
76	65	caovcl 6108	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴𝐹𝐵) ∈ P)
77	53, 32	genpelvl 7632	. . . . . 6 ⊢ (((𝐴𝐹𝐵) ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ (1^st ‘((𝐴𝐹𝐵)𝐹𝐶)) ↔ ∃𝑡 ∈ (1^st ‘(𝐴𝐹𝐵))∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)))
78	76, 77	sylan 283	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐶 ∈ P) → (𝑥 ∈ (1^st ‘((𝐴𝐹𝐵)𝐹𝐶)) ↔ ∃𝑡 ∈ (1^st ‘(𝐴𝐹𝐵))∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)))
79	78	3impa 1197	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ (1^st ‘((𝐴𝐹𝐵)𝐹𝐶)) ↔ ∃𝑡 ∈ (1^st ‘(𝐴𝐹𝐵))∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)))
80	32	caovcl 6108	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q) → (𝑓𝐺𝑔) ∈ Q)
81		elisset 2787	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑓𝐺𝑔) ∈ Q → ∃𝑡 𝑡 = (𝑓𝐺𝑔))
82	80, 81	syl 14	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q) → ∃𝑡 𝑡 = (𝑓𝐺𝑔))
83	82	biantrurd 305	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q) → (∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ (∃𝑡 𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ))))
84		oveq1 5958	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑡 = (𝑓𝐺𝑔) → (𝑡𝐺ℎ) = ((𝑓𝐺𝑔)𝐺ℎ))
85	84	eqeq2d 2218	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑡 = (𝑓𝐺𝑔) → (𝑥 = (𝑡𝐺ℎ) ↔ 𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
86	85	rexbidv 2508	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑡 = (𝑓𝐺𝑔) → (∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ) ↔ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
87	86	pm5.32i 454	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)) ↔ (𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
88	87	exbii 1629	. . . . . . . . . . . . . . . . . 18 ⊢ (∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)) ↔ ∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
89		19.41v 1927	. . . . . . . . . . . . . . . . . 18 ⊢ (∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)) ↔ (∃𝑡 𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
90	88, 89	bitri 184	. . . . . . . . . . . . . . . . 17 ⊢ (∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)) ↔ (∃𝑡 𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
91	83, 90	bitr4di 198	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q) → (∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
92	6, 91	sylan2 286	. . . . . . . . . . . . . . 15 ⊢ ((𝑓 ∈ Q ∧ (𝐵 ∈ P ∧ 𝑔 ∈ (1^st ‘𝐵))) → (∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
93	92	anassrs 400	. . . . . . . . . . . . . 14 ⊢ (((𝑓 ∈ Q ∧ 𝐵 ∈ P) ∧ 𝑔 ∈ (1^st ‘𝐵)) → (∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
94	93	rexbidva 2504	. . . . . . . . . . . . 13 ⊢ ((𝑓 ∈ Q ∧ 𝐵 ∈ P) → (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑔 ∈ (1^st ‘𝐵)∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
95		rexcom4 2796	. . . . . . . . . . . . 13 ⊢ (∃𝑔 ∈ (1^st ‘𝐵)∃𝑡(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)) ↔ ∃𝑡∃𝑔 ∈ (1^st ‘𝐵)(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)))
96	94, 95	bitrdi 196	. . . . . . . . . . . 12 ⊢ ((𝑓 ∈ Q ∧ 𝐵 ∈ P) → (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡∃𝑔 ∈ (1^st ‘𝐵)(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
97	96	ancoms 268	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ P ∧ 𝑓 ∈ Q) → (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡∃𝑔 ∈ (1^st ‘𝐵)(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
98	3, 97	sylan2 286	. . . . . . . . . 10 ⊢ ((𝐵 ∈ P ∧ (𝐴 ∈ P ∧ 𝑓 ∈ (1^st ‘𝐴))) → (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡∃𝑔 ∈ (1^st ‘𝐵)(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
99	98	anassrs 400	. . . . . . . . 9 ⊢ (((𝐵 ∈ P ∧ 𝐴 ∈ P) ∧ 𝑓 ∈ (1^st ‘𝐴)) → (∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡∃𝑔 ∈ (1^st ‘𝐵)(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
100	99	rexbidva 2504	. . . . . . . 8 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P) → (∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑡∃𝑔 ∈ (1^st ‘𝐵)(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
101		rexcom4 2796	. . . . . . . 8 ⊢ (∃𝑓 ∈ (1^st ‘𝐴)∃𝑡∃𝑔 ∈ (1^st ‘𝐵)(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)) ↔ ∃𝑡∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)))
102	100, 101	bitrdi 196	. . . . . . 7 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P) → (∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
103		r19.41v 2663	. . . . . . . . . 10 ⊢ (∃𝑔 ∈ (1^st ‘𝐵)(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)) ↔ (∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)))
104	103	rexbii 2514	. . . . . . . . 9 ⊢ (∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)) ↔ ∃𝑓 ∈ (1^st ‘𝐴)(∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)))
105		r19.41v 2663	. . . . . . . . 9 ⊢ (∃𝑓 ∈ (1^st ‘𝐴)(∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)) ↔ (∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)))
106	104, 105	bitri 184	. . . . . . . 8 ⊢ (∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)) ↔ (∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)))
107	106	exbii 1629	. . . . . . 7 ⊢ (∃𝑡∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)(𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)) ↔ ∃𝑡(∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ)))
108	102, 107	bitrdi 196	. . . . . 6 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P) → (∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡(∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
109	108	ancoms 268	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡(∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
110	109	3adant3 1020	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ) ↔ ∃𝑡(∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)𝑡 = (𝑓𝐺𝑔) ∧ ∃ℎ ∈ (1^st ‘𝐶)𝑥 = (𝑡𝐺ℎ))))
111	75, 79, 110	3bitr4d 220	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ (1^st ‘((𝐴𝐹𝐵)𝐹𝐶)) ↔ ∃𝑓 ∈ (1^st ‘𝐴)∃𝑔 ∈ (1^st ‘𝐵)∃ℎ ∈ (1^st ‘𝐶)𝑥 = ((𝑓𝐺𝑔)𝐺ℎ)))
112	64, 69, 111	3bitr4rd 221	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (𝑥 ∈ (1^st ‘((𝐴𝐹𝐵)𝐹𝐶)) ↔ 𝑥 ∈ (1^st ‘(𝐴𝐹(𝐵𝐹𝐶)))))
113	112	eqrdv 2204	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → (1^st ‘((𝐴𝐹𝐵)𝐹𝐶)) = (1^st ‘(𝐴𝐹(𝐵𝐹𝐶))))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 981 = wceq 1373 ∃wex 1516 ∈ wcel 2177 ∃wrex 2486 {crab 2489 ⟨cop 3637 × cxp 4677 dom cdm 4679 ‘cfv 5276 (class class class)co 5951 ∈ cmpo 5953 1^st c1st 6231 2^nd c2nd 6232 Qcnq 7400 Pcnp 7411

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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-coll 4163 ax-sep 4166 ax-pow 4222 ax-pr 4257 ax-un 4484 ax-setind 4589 ax-iinf 4640

This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3000 df-csb 3095 df-dif 3169 df-un 3171 df-in 3173 df-ss 3180 df-pw 3619 df-sn 3640 df-pr 3641 df-op 3643 df-uni 3853 df-int 3888 df-iun 3931 df-br 4048 df-opab 4110 df-mpt 4111 df-id 4344 df-iom 4643 df-xp 4685 df-rel 4686 df-cnv 4687 df-co 4688 df-dm 4689 df-rn 4690 df-res 4691 df-ima 4692 df-iota 5237 df-fun 5278 df-fn 5279 df-f 5280 df-f1 5281 df-fo 5282 df-f1o 5283 df-fv 5284 df-ov 5954 df-oprab 5955 df-mpo 5956 df-1st 6233 df-2nd 6234 df-qs 6633 df-ni 7424 df-nqqs 7468 df-inp 7586

This theorem is referenced by: genpassg 7646

W3C validator