Theorem fvmptopab 7188

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 6645	. . . . . . . 8 ⊢ (𝑧 = 𝑍 → (𝐹‘𝑧) = (𝐹‘𝑍))
3	2	breqd 5041	. . . . . . 7 ⊢ (𝑧 = 𝑍 → (𝑥(𝐹‘𝑧)𝑦 ↔ 𝑥(𝐹‘𝑍)𝑦))
4	3	adantl 485	. . . . . 6 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑧 = 𝑍) → (𝑥(𝐹‘𝑧)𝑦 ↔ 𝑥(𝐹‘𝑍)𝑦))
5		fvmptopab.1	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 = 𝑍) → (𝜒 ↔ 𝜓))
6	5	adantll 713	. . . . . 6 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑧 = 𝑍) → (𝜒 ↔ 𝜓))
7	4, 6	anbi12d 633	. . . . 5 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑧 = 𝑍) → ((𝑥(𝐹‘𝑧)𝑦 ∧ 𝜒) ↔ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)))
8	7	opabbidv 5096	. . . 4 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑧 = 𝑍) → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑧)𝑦 ∧ 𝜒)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)})
9		simpl 486	. . . 4 ⊢ ((𝑍 ∈ V ∧ 𝜑) → 𝑍 ∈ V)
10		id 22	. . . . . 6 ⊢ (𝑥(𝐹‘𝑍)𝑦 → 𝑥(𝐹‘𝑍)𝑦)
11	10	gen2 1798	. . . . 5 ⊢ ∀𝑥∀𝑦(𝑥(𝐹‘𝑍)𝑦 → 𝑥(𝐹‘𝑍)𝑦)
12		fvmptopab.2	. . . . . 6 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝑥(𝐹‘𝑍)𝑦} ∈ V)
13	12	adantl 485	. . . . 5 ⊢ ((𝑍 ∈ V ∧ 𝜑) → {⟨𝑥, 𝑦⟩ ∣ 𝑥(𝐹‘𝑍)𝑦} ∈ V)
14		opabbrex 7186	. . . . 5 ⊢ ((∀𝑥∀𝑦(𝑥(𝐹‘𝑍)𝑦 → 𝑥(𝐹‘𝑍)𝑦) ∧ {⟨𝑥, 𝑦⟩ ∣ 𝑥(𝐹‘𝑍)𝑦} ∈ V) → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)} ∈ V)
15	11, 13, 14	sylancr 590	. . . 4 ⊢ ((𝑍 ∈ V ∧ 𝜑) → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)} ∈ V)
16	1, 8, 9, 15	fvmptd2 6753	. . 3 ⊢ ((𝑍 ∈ V ∧ 𝜑) → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)})
17	16	ex 416	. 2 ⊢ (𝑍 ∈ V → (𝜑 → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)}))
18		fvprc 6638	. . . 4 ⊢ (¬ 𝑍 ∈ V → (𝑀‘𝑍) = ∅)
19		br0 5079	. . . . . . . 8 ⊢ ¬ 𝑥∅𝑦
20		fvprc 6638	. . . . . . . . 9 ⊢ (¬ 𝑍 ∈ V → (𝐹‘𝑍) = ∅)
21	20	breqd 5041	. . . . . . . 8 ⊢ (¬ 𝑍 ∈ V → (𝑥(𝐹‘𝑍)𝑦 ↔ 𝑥∅𝑦))
22	19, 21	mtbiri 330	. . . . . . 7 ⊢ (¬ 𝑍 ∈ V → ¬ 𝑥(𝐹‘𝑍)𝑦)
23	22	intnanrd 493	. . . . . 6 ⊢ (¬ 𝑍 ∈ V → ¬ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓))
24	23	alrimivv 1929	. . . . 5 ⊢ (¬ 𝑍 ∈ V → ∀𝑥∀𝑦 ¬ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓))
25		opab0 5406	. . . . 5 ⊢ ({⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)} = ∅ ↔ ∀𝑥∀𝑦 ¬ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓))
26	24, 25	sylibr 237	. . . 4 ⊢ (¬ 𝑍 ∈ V → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)} = ∅)
27	18, 26	eqtr4d 2836	. . 3 ⊢ (¬ 𝑍 ∈ V → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)})
28	27	a1d 25	. 2 ⊢ (¬ 𝑍 ∈ V → (𝜑 → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)}))
29	17, 28	pm2.61i 185	1 ⊢ (𝜑 → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)})

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399  ∀wal 1536   = wceq 1538   ∈ wcel 2111  Vcvv 3441  ∅c0 4243   class class class wbr 5030  {copab 5092   ↦ cmpt 5110  ‘cfv 6324

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-iota 6283  df-fun 6326  df-fv 6332

This theorem is referenced by:  trlsfval  27485  pthsfval  27510  spthsfval  27511  clwlks  27561  crcts  27577  cycls  27578  eupths  27985