Theorem el2mpocl 8097

Description: If the operation value of the operation value of two nested maps-to notation is not empty, all involved arguments belong to the corresponding base classes of the maps-to notations. Using implicit substitution. (Contributed by AV, 21-May-2021.)

Hypotheses

Ref	Expression
el2mpocl.o	⊢ 𝑂 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑠 ∈ 𝐶, 𝑡 ∈ 𝐷 ↦ 𝐸))
el2mpocl.e	⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝐶 = 𝐹 ∧ 𝐷 = 𝐺))

Assertion

Ref	Expression
el2mpocl	⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝐶 ∈ 𝑈 ∧ 𝐷 ∈ 𝑉) → (𝑊 ∈ (𝑆(𝑋𝑂𝑌)𝑇) → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) ∧ (𝑆 ∈ 𝐹 ∧ 𝑇 ∈ 𝐺))))

Distinct variable groups:   𝐴,𝑠,𝑡,𝑥,𝑦   𝐵,𝑠,𝑡,𝑥,𝑦   𝐶,𝑠,𝑡   𝐷,𝑠,𝑡   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦   𝑥,𝑈,𝑦   𝑥,𝑉,𝑦   𝑋,𝑠,𝑡,𝑥,𝑦   𝑌,𝑠,𝑡,𝑥,𝑦

Allowed substitution hints:   𝐶(𝑥, 𝑦)   𝐷(𝑥, 𝑦)   𝑆(𝑥, 𝑦, 𝑡, 𝑠)   𝑇(𝑥, 𝑦, 𝑡, 𝑠)   𝑈(𝑡, 𝑠)   𝐸(𝑥, 𝑦, 𝑡, 𝑠)   𝐹(𝑡, 𝑠)   𝐺(𝑡, 𝑠)   𝑂(𝑥, 𝑦, 𝑡, 𝑠)   𝑉(𝑡, 𝑠)   𝑊(𝑥, 𝑦, 𝑡, 𝑠)

Proof of Theorem el2mpocl

Step	Hyp	Ref	Expression
1		el2mpocl.o	. . 3 ⊢ 𝑂 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑠 ∈ 𝐶, 𝑡 ∈ 𝐷 ↦ 𝐸))
2	1	el2mpocsbcl 8096	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝐶 ∈ 𝑈 ∧ 𝐷 ∈ 𝑉) → (𝑊 ∈ (𝑆(𝑋𝑂𝑌)𝑇) → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) ∧ (𝑆 ∈ ⦋𝑋 / 𝑥⦌⦋𝑌 / 𝑦⦌𝐶 ∧ 𝑇 ∈ ⦋𝑋 / 𝑥⦌⦋𝑌 / 𝑦⦌𝐷))))
3		simpl 488	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐴)
4		simplr 781	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) ∧ 𝑥 = 𝑋) → 𝑌 ∈ 𝐵)
5		el2mpocl.e	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝐶 = 𝐹 ∧ 𝐷 = 𝐺))
6	5	simpld 500	. . . . . . . . 9 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → 𝐶 = 𝐹)
7	6	adantll 727	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝐶 = 𝐹)
8	4, 7	csbied 3883	. . . . . . 7 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) ∧ 𝑥 = 𝑋) → ⦋𝑌 / 𝑦⦌𝐶 = 𝐹)
9	3, 8	csbied 3883	. . . . . 6 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → ⦋𝑋 / 𝑥⦌⦋𝑌 / 𝑦⦌𝐶 = 𝐹)
10	9	eleq2d 2847	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (𝑆 ∈ ⦋𝑋 / 𝑥⦌⦋𝑌 / 𝑦⦌𝐶 ↔ 𝑆 ∈ 𝐹))
11	5	simprd 501	. . . . . . . . 9 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → 𝐷 = 𝐺)
12	11	adantll 727	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) ∧ 𝑥 = 𝑋) ∧ 𝑦 = 𝑌) → 𝐷 = 𝐺)
13	4, 12	csbied 3883	. . . . . . 7 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) ∧ 𝑥 = 𝑋) → ⦋𝑌 / 𝑦⦌𝐷 = 𝐺)
14	3, 13	csbied 3883	. . . . . 6 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → ⦋𝑋 / 𝑥⦌⦋𝑌 / 𝑦⦌𝐷 = 𝐺)
15	14	eleq2d 2847	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (𝑇 ∈ ⦋𝑋 / 𝑥⦌⦋𝑌 / 𝑦⦌𝐷 ↔ 𝑇 ∈ 𝐺))
16	10, 15	anbi12d 644	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → ((𝑆 ∈ ⦋𝑋 / 𝑥⦌⦋𝑌 / 𝑦⦌𝐶 ∧ 𝑇 ∈ ⦋𝑋 / 𝑥⦌⦋𝑌 / 𝑦⦌𝐷) ↔ (𝑆 ∈ 𝐹 ∧ 𝑇 ∈ 𝐺)))
17	16	biimpd 232	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → ((𝑆 ∈ ⦋𝑋 / 𝑥⦌⦋𝑌 / 𝑦⦌𝐶 ∧ 𝑇 ∈ ⦋𝑋 / 𝑥⦌⦋𝑌 / 𝑦⦌𝐷) → (𝑆 ∈ 𝐹 ∧ 𝑇 ∈ 𝐺)))
18	17	imdistani 579	. 2 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) ∧ (𝑆 ∈ ⦋𝑋 / 𝑥⦌⦋𝑌 / 𝑦⦌𝐶 ∧ 𝑇 ∈ ⦋𝑋 / 𝑥⦌⦋𝑌 / 𝑦⦌𝐷)) → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) ∧ (𝑆 ∈ 𝐹 ∧ 𝑇 ∈ 𝐺)))
19	2, 18	syl6 36	1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝐶 ∈ 𝑈 ∧ 𝐷 ∈ 𝑉) → (𝑊 ∈ (𝑆(𝑋𝑂𝑌)𝑇) → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) ∧ (𝑆 ∈ 𝐹 ∧ 𝑇 ∈ 𝐺))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ⦋csb 3847  (class class class)co 7420   ∈ cmpo 7422

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002

This theorem is used by:  wwlksonvtx  30444  wspthnonp  30448