Theorem fvmptopab 7308

Description: The function value of a mapping 𝑀 to a restricted binary relation expressed as an ordered-pair class abstraction: The restricted binary relation is a binary relation given as value of a function 𝐹 restricted by the condition 𝜓. (Contributed by AV, 31-Jan-2021.) (Revised by AV, 29-Oct-2021.)

Hypotheses

Ref	Expression
fvmptopab.1	⊢ ((𝜑 ∧ 𝑧 = 𝑍) → (𝜒 ↔ 𝜓))
fvmptopab.2	⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝑥(𝐹‘𝑍)𝑦} ∈ V)
fvmptopab.3	⊢ 𝑀 = (𝑧 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑧)𝑦 ∧ 𝜒)})

Assertion

Ref	Expression
fvmptopab	⊢ (𝜑 → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)})

Distinct variable groups:   𝑧,𝐹   𝑥,𝑍,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝜓,𝑧

Allowed substitution hints:   𝜓(𝑥,𝑦)   𝜒(𝑥,𝑦,𝑧)   𝐹(𝑥,𝑦)   𝑀(𝑥,𝑦,𝑧)

Proof of Theorem fvmptopab

Step	Hyp	Ref	Expression
1		fvmptopab.3	. . . 4 ⊢ 𝑀 = (𝑧 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑧)𝑦 ∧ 𝜒)})
2		fveq2 6756	. . . . . . . 8 ⊢ (𝑧 = 𝑍 → (𝐹‘𝑧) = (𝐹‘𝑍))
3	2	breqd 5081	. . . . . . 7 ⊢ (𝑧 = 𝑍 → (𝑥(𝐹‘𝑧)𝑦 ↔ 𝑥(𝐹‘𝑍)𝑦))
4	3	adantl 481	. . . . . 6 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑧 = 𝑍) → (𝑥(𝐹‘𝑧)𝑦 ↔ 𝑥(𝐹‘𝑍)𝑦))
5		fvmptopab.1	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 = 𝑍) → (𝜒 ↔ 𝜓))
6	5	adantll 710	. . . . . 6 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑧 = 𝑍) → (𝜒 ↔ 𝜓))
7	4, 6	anbi12d 630	. . . . 5 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑧 = 𝑍) → ((𝑥(𝐹‘𝑧)𝑦 ∧ 𝜒) ↔ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)))
8	7	opabbidv 5136	. . . 4 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑧 = 𝑍) → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑧)𝑦 ∧ 𝜒)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)})
9		simpl 482	. . . 4 ⊢ ((𝑍 ∈ V ∧ 𝜑) → 𝑍 ∈ V)
10		id 22	. . . . . 6 ⊢ (𝑥(𝐹‘𝑍)𝑦 → 𝑥(𝐹‘𝑍)𝑦)
11	10	gen2 1800	. . . . 5 ⊢ ∀𝑥∀𝑦(𝑥(𝐹‘𝑍)𝑦 → 𝑥(𝐹‘𝑍)𝑦)
12		fvmptopab.2	. . . . . 6 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝑥(𝐹‘𝑍)𝑦} ∈ V)
13	12	adantl 481	. . . . 5 ⊢ ((𝑍 ∈ V ∧ 𝜑) → {⟨𝑥, 𝑦⟩ ∣ 𝑥(𝐹‘𝑍)𝑦} ∈ V)
14		opabbrex 7306	. . . . 5 ⊢ ((∀𝑥∀𝑦(𝑥(𝐹‘𝑍)𝑦 → 𝑥(𝐹‘𝑍)𝑦) ∧ {⟨𝑥, 𝑦⟩ ∣ 𝑥(𝐹‘𝑍)𝑦} ∈ V) → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)} ∈ V)
15	11, 13, 14	sylancr 586	. . . 4 ⊢ ((𝑍 ∈ V ∧ 𝜑) → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)} ∈ V)
16	1, 8, 9, 15	fvmptd2 6865	. . 3 ⊢ ((𝑍 ∈ V ∧ 𝜑) → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)})
17	16	ex 412	. 2 ⊢ (𝑍 ∈ V → (𝜑 → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)}))
18		fvprc 6748	. . . 4 ⊢ (¬ 𝑍 ∈ V → (𝑀‘𝑍) = ∅)
19		br0 5119	. . . . . . . 8 ⊢ ¬ 𝑥∅𝑦
20		fvprc 6748	. . . . . . . . 9 ⊢ (¬ 𝑍 ∈ V → (𝐹‘𝑍) = ∅)
21	20	breqd 5081	. . . . . . . 8 ⊢ (¬ 𝑍 ∈ V → (𝑥(𝐹‘𝑍)𝑦 ↔ 𝑥∅𝑦))
22	19, 21	mtbiri 326	. . . . . . 7 ⊢ (¬ 𝑍 ∈ V → ¬ 𝑥(𝐹‘𝑍)𝑦)
23	22	intnanrd 489	. . . . . 6 ⊢ (¬ 𝑍 ∈ V → ¬ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓))
24	23	alrimivv 1932	. . . . 5 ⊢ (¬ 𝑍 ∈ V → ∀𝑥∀𝑦 ¬ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓))
25		opab0 5460	. . . . 5 ⊢ ({⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)} = ∅ ↔ ∀𝑥∀𝑦 ¬ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓))
26	24, 25	sylibr 233	. . . 4 ⊢ (¬ 𝑍 ∈ V → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)} = ∅)
27	18, 26	eqtr4d 2781	. . 3 ⊢ (¬ 𝑍 ∈ V → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)})
28	27	a1d 25	. 2 ⊢ (¬ 𝑍 ∈ V → (𝜑 → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)}))
29	17, 28	pm2.61i 182	1 ⊢ (𝜑 → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)})

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395  ∀wal 1537   = wceq 1539   ∈ wcel 2108  Vcvv 3422  ∅c0 4253   class class class wbr 5070  {copab 5132   ↦ cmpt 5153  ‘cfv 6418

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-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  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-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-iota 6376  df-fun 6420  df-fv 6426

This theorem is referenced by:  trlsfval  27965  pthsfval  27990  spthsfval  27991  clwlks  28041  crcts  28057  cycls  28058  eupths  28465