Theorem ovmpt3rab1 7619

Description: The value of an operation defined by the maps-to notation with a function into a class abstraction as a result. The domain of the function and the base set of the class abstraction may depend on the operands, using implicit substitution. (Contributed by AV, 16-Jul-2018.) (Revised by AV, 16-May-2019.)

Hypotheses

Ref	Expression
ovmpt3rab1.o	⊢ 𝑂 = (𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑧 ∈ 𝑀 ↦ {𝑎 ∈ 𝑁 ∣ 𝜑}))
ovmpt3rab1.m	⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → 𝑀 = 𝐾)
ovmpt3rab1.n	⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → 𝑁 = 𝐿)
ovmpt3rab1.p	⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝜑 ↔ 𝜓))
ovmpt3rab1.x	⊢ Ⅎ𝑥𝜓
ovmpt3rab1.y	⊢ Ⅎ𝑦𝜓

Assertion

Ref	Expression
ovmpt3rab1	⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐾 ∈ 𝑈) → (𝑋𝑂𝑌) = (𝑧 ∈ 𝐾 ↦ {𝑎 ∈ 𝐿 ∣ 𝜓}))

Distinct variable groups:   𝑥,𝐾,𝑦,𝑧   𝐿,𝑎,𝑥,𝑦   𝑁,𝑎   𝑥,𝑉,𝑦   𝑥,𝑊,𝑦   𝑥,𝑈,𝑦   𝑋,𝑎,𝑥,𝑦,𝑧   𝑌,𝑎,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑎)   𝜓(𝑥,𝑦,𝑧,𝑎)   𝑈(𝑧,𝑎)   𝐾(𝑎)   𝐿(𝑧)   𝑀(𝑥,𝑦,𝑧,𝑎)   𝑁(𝑥,𝑦,𝑧)   𝑂(𝑥,𝑦,𝑧,𝑎)   𝑉(𝑧,𝑎)   𝑊(𝑧,𝑎)

Proof of Theorem ovmpt3rab1

Step	Hyp	Ref	Expression
1		ovmpt3rab1.o	. . 3 ⊢ 𝑂 = (𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑧 ∈ 𝑀 ↦ {𝑎 ∈ 𝑁 ∣ 𝜑}))
2	1	a1i 11	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐾 ∈ 𝑈) → 𝑂 = (𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑧 ∈ 𝑀 ↦ {𝑎 ∈ 𝑁 ∣ 𝜑})))
3		ovmpt3rab1.m	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → 𝑀 = 𝐾)
4		ovmpt3rab1.n	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → 𝑁 = 𝐿)
5		ovmpt3rab1.p	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝜑 ↔ 𝜓))
6	4, 5	rabeqbidv 3408	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → {𝑎 ∈ 𝑁 ∣ 𝜑} = {𝑎 ∈ 𝐿 ∣ 𝜓})
7	3, 6	mpteq12dv 5173	. . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑧 ∈ 𝑀 ↦ {𝑎 ∈ 𝑁 ∣ 𝜑}) = (𝑧 ∈ 𝐾 ↦ {𝑎 ∈ 𝐿 ∣ 𝜓}))
8	7	adantl 481	. 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐾 ∈ 𝑈) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑧 ∈ 𝑀 ↦ {𝑎 ∈ 𝑁 ∣ 𝜑}) = (𝑧 ∈ 𝐾 ↦ {𝑎 ∈ 𝐿 ∣ 𝜓}))
9		eqidd 2738	. 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐾 ∈ 𝑈) ∧ 𝑥 = 𝑋) → V = V)
10		elex 3451	. . 3 ⊢ (𝑋 ∈ 𝑉 → 𝑋 ∈ V)
11	10	3ad2ant1 1134	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐾 ∈ 𝑈) → 𝑋 ∈ V)
12		elex 3451	. . 3 ⊢ (𝑌 ∈ 𝑊 → 𝑌 ∈ V)
13	12	3ad2ant2 1135	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐾 ∈ 𝑈) → 𝑌 ∈ V)
14		mptexg 7170	. . 3 ⊢ (𝐾 ∈ 𝑈 → (𝑧 ∈ 𝐾 ↦ {𝑎 ∈ 𝐿 ∣ 𝜓}) ∈ V)
15	14	3ad2ant3 1136	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐾 ∈ 𝑈) → (𝑧 ∈ 𝐾 ↦ {𝑎 ∈ 𝐿 ∣ 𝜓}) ∈ V)
16		nfv 1916	. 2 ⊢ Ⅎ𝑥(𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐾 ∈ 𝑈)
17		nfv 1916	. 2 ⊢ Ⅎ𝑦(𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐾 ∈ 𝑈)
18		nfcv 2899	. 2 ⊢ Ⅎ𝑦𝑋
19		nfcv 2899	. 2 ⊢ Ⅎ𝑥𝑌
20		nfcv 2899	. . 3 ⊢ Ⅎ𝑥𝐾
21		ovmpt3rab1.x	. . . 4 ⊢ Ⅎ𝑥𝜓
22		nfcv 2899	. . . 4 ⊢ Ⅎ𝑥𝐿
23	21, 22	nfrabw 3427	. . 3 ⊢ Ⅎ𝑥{𝑎 ∈ 𝐿 ∣ 𝜓}
24	20, 23	nfmpt 5184	. 2 ⊢ Ⅎ𝑥(𝑧 ∈ 𝐾 ↦ {𝑎 ∈ 𝐿 ∣ 𝜓})
25		nfcv 2899	. . 3 ⊢ Ⅎ𝑦𝐾
26		ovmpt3rab1.y	. . . 4 ⊢ Ⅎ𝑦𝜓
27		nfcv 2899	. . . 4 ⊢ Ⅎ𝑦𝐿
28	26, 27	nfrabw 3427	. . 3 ⊢ Ⅎ𝑦{𝑎 ∈ 𝐿 ∣ 𝜓}
29	25, 28	nfmpt 5184	. 2 ⊢ Ⅎ𝑦(𝑧 ∈ 𝐾 ↦ {𝑎 ∈ 𝐿 ∣ 𝜓})
30	2, 8, 9, 11, 13, 15, 16, 17, 18, 19, 24, 29	ovmpodxf 7511	1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐾 ∈ 𝑈) → (𝑋𝑂𝑌) = (𝑧 ∈ 𝐾 ↦ {𝑎 ∈ 𝐿 ∣ 𝜓}))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542  Ⅎwnf 1785   ∈ wcel 2114  {crab 3390  Vcvv 3430   ↦ cmpt 5167  (class class class)co 7361   ∈ cmpo 7363

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pr 5371

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366

This theorem is referenced by:  ovmpt3rabdm  7620  elovmpt3rab1  7621