Theorem fvmptopab 7203

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 6664	. . . . . . . 8 ⊢ (𝑧 = 𝑍 → (𝐹‘𝑧) = (𝐹‘𝑍))
3	2	breqd 5069	. . . . . . 7 ⊢ (𝑧 = 𝑍 → (𝑥(𝐹‘𝑧)𝑦 ↔ 𝑥(𝐹‘𝑍)𝑦))
4	3	adantl 484	. . . . . 6 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑧 = 𝑍) → (𝑥(𝐹‘𝑧)𝑦 ↔ 𝑥(𝐹‘𝑍)𝑦))
5		fvmptopab.1	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 = 𝑍) → (𝜒 ↔ 𝜓))
6	5	adantll 712	. . . . . 6 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑧 = 𝑍) → (𝜒 ↔ 𝜓))
7	4, 6	anbi12d 632	. . . . 5 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑧 = 𝑍) → ((𝑥(𝐹‘𝑧)𝑦 ∧ 𝜒) ↔ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)))
8	7	opabbidv 5124	. . . 4 ⊢ (((𝑍 ∈ V ∧ 𝜑) ∧ 𝑧 = 𝑍) → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑧)𝑦 ∧ 𝜒)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)})
9		simpl 485	. . . 4 ⊢ ((𝑍 ∈ V ∧ 𝜑) → 𝑍 ∈ V)
10		id 22	. . . . . 6 ⊢ (𝑥(𝐹‘𝑍)𝑦 → 𝑥(𝐹‘𝑍)𝑦)
11	10	gen2 1793	. . . . 5 ⊢ ∀𝑥∀𝑦(𝑥(𝐹‘𝑍)𝑦 → 𝑥(𝐹‘𝑍)𝑦)
12		fvmptopab.2	. . . . . 6 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝑥(𝐹‘𝑍)𝑦} ∈ V)
13	12	adantl 484	. . . . 5 ⊢ ((𝑍 ∈ V ∧ 𝜑) → {⟨𝑥, 𝑦⟩ ∣ 𝑥(𝐹‘𝑍)𝑦} ∈ V)
14		opabbrex 7201	. . . . 5 ⊢ ((∀𝑥∀𝑦(𝑥(𝐹‘𝑍)𝑦 → 𝑥(𝐹‘𝑍)𝑦) ∧ {⟨𝑥, 𝑦⟩ ∣ 𝑥(𝐹‘𝑍)𝑦} ∈ V) → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)} ∈ V)
15	11, 13, 14	sylancr 589	. . . 4 ⊢ ((𝑍 ∈ V ∧ 𝜑) → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)} ∈ V)
16	1, 8, 9, 15	fvmptd2 6770	. . 3 ⊢ ((𝑍 ∈ V ∧ 𝜑) → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)})
17	16	ex 415	. 2 ⊢ (𝑍 ∈ V → (𝜑 → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)}))
18		fvprc 6657	. . . 4 ⊢ (¬ 𝑍 ∈ V → (𝑀‘𝑍) = ∅)
19		br0 5107	. . . . . . . 8 ⊢ ¬ 𝑥∅𝑦
20		fvprc 6657	. . . . . . . . 9 ⊢ (¬ 𝑍 ∈ V → (𝐹‘𝑍) = ∅)
21	20	breqd 5069	. . . . . . . 8 ⊢ (¬ 𝑍 ∈ V → (𝑥(𝐹‘𝑍)𝑦 ↔ 𝑥∅𝑦))
22	19, 21	mtbiri 329	. . . . . . 7 ⊢ (¬ 𝑍 ∈ V → ¬ 𝑥(𝐹‘𝑍)𝑦)
23	22	intnanrd 492	. . . . . 6 ⊢ (¬ 𝑍 ∈ V → ¬ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓))
24	23	alrimivv 1925	. . . . 5 ⊢ (¬ 𝑍 ∈ V → ∀𝑥∀𝑦 ¬ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓))
25		opab0 5433	. . . . 5 ⊢ ({⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)} = ∅ ↔ ∀𝑥∀𝑦 ¬ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓))
26	24, 25	sylibr 236	. . . 4 ⊢ (¬ 𝑍 ∈ V → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)} = ∅)
27	18, 26	eqtr4d 2859	. . 3 ⊢ (¬ 𝑍 ∈ V → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)})
28	27	a1d 25	. 2 ⊢ (¬ 𝑍 ∈ V → (𝜑 → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)}))
29	17, 28	pm2.61i 184	1 ⊢ (𝜑 → (𝑀‘𝑍) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝐹‘𝑍)𝑦 ∧ 𝜓)})

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398  ∀wal 1531   = wceq 1533   ∈ wcel 2110  Vcvv 3494  ∅c0 4290   class class class wbr 5058  {copab 5120   ↦ cmpt 5138  ‘cfv 6349

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-iota 6308  df-fun 6351  df-fv 6357

This theorem is referenced by:  trlsfval  27471  pthsfval  27496  spthsfval  27497  clwlks  27547  crcts  27563  cycls  27564  eupths  27973