Theorem fvconstr 48569

Description: Two ways of expressing 𝐴𝑅𝐵. (Contributed by Zhi Wang, 18-Sep-2024.)

Hypotheses

Ref	Expression
fvconstr.1	⊢ (𝜑 → 𝐹 = (𝑅 × {𝑌}))
fvconstr.2	⊢ (𝜑 → 𝑌 ∈ 𝑉)
fvconstr.3	⊢ (𝜑 → 𝑌 ≠ ∅)

Assertion

Ref	Expression
fvconstr	⊢ (𝜑 → (𝐴𝑅𝐵 ↔ (𝐴𝐹𝐵) = 𝑌))

Proof of Theorem fvconstr

Step	Hyp	Ref	Expression
1		df-br 5167	. 2 ⊢ (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
2		fvconstr.1	. . . . . . 7 ⊢ (𝜑 → 𝐹 = (𝑅 × {𝑌}))
3	2	oveqd 7465	. . . . . 6 ⊢ (𝜑 → (𝐴𝐹𝐵) = (𝐴(𝑅 × {𝑌})𝐵))
4		df-ov 7451	. . . . . 6 ⊢ (𝐴(𝑅 × {𝑌})𝐵) = ((𝑅 × {𝑌})‘⟨𝐴, 𝐵⟩)
5	3, 4	eqtrdi 2796	. . . . 5 ⊢ (𝜑 → (𝐴𝐹𝐵) = ((𝑅 × {𝑌})‘⟨𝐴, 𝐵⟩))
6	5	adantr 480	. . . 4 ⊢ ((𝜑 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝑅) → (𝐴𝐹𝐵) = ((𝑅 × {𝑌})‘⟨𝐴, 𝐵⟩))
7		fvconstr.2	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
8		fvconst2g 7239	. . . . 5 ⊢ ((𝑌 ∈ 𝑉 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝑅) → ((𝑅 × {𝑌})‘⟨𝐴, 𝐵⟩) = 𝑌)
9	7, 8	sylan 579	. . . 4 ⊢ ((𝜑 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝑅) → ((𝑅 × {𝑌})‘⟨𝐴, 𝐵⟩) = 𝑌)
10	6, 9	eqtrd 2780	. . 3 ⊢ ((𝜑 ∧ ⟨𝐴, 𝐵⟩ ∈ 𝑅) → (𝐴𝐹𝐵) = 𝑌)
11		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴𝐹𝐵) = 𝑌) → (𝐴𝐹𝐵) = 𝑌)
12		fvconstr.3	. . . . . . 7 ⊢ (𝜑 → 𝑌 ≠ ∅)
13	12	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝐴𝐹𝐵) = 𝑌) → 𝑌 ≠ ∅)
14	11, 13	eqnetrd 3014	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝐹𝐵) = 𝑌) → (𝐴𝐹𝐵) ≠ ∅)
15	5	neeq1d 3006	. . . . . 6 ⊢ (𝜑 → ((𝐴𝐹𝐵) ≠ ∅ ↔ ((𝑅 × {𝑌})‘⟨𝐴, 𝐵⟩) ≠ ∅))
16	15	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝐹𝐵) = 𝑌) → ((𝐴𝐹𝐵) ≠ ∅ ↔ ((𝑅 × {𝑌})‘⟨𝐴, 𝐵⟩) ≠ ∅))
17	14, 16	mpbid 232	. . . 4 ⊢ ((𝜑 ∧ (𝐴𝐹𝐵) = 𝑌) → ((𝑅 × {𝑌})‘⟨𝐴, 𝐵⟩) ≠ ∅)
18		dmxpss 6202	. . . . 5 ⊢ dom (𝑅 × {𝑌}) ⊆ 𝑅
19		ndmfv 6955	. . . . . 6 ⊢ (¬ ⟨𝐴, 𝐵⟩ ∈ dom (𝑅 × {𝑌}) → ((𝑅 × {𝑌})‘⟨𝐴, 𝐵⟩) = ∅)
20	19	necon1ai 2974	. . . . 5 ⊢ (((𝑅 × {𝑌})‘⟨𝐴, 𝐵⟩) ≠ ∅ → ⟨𝐴, 𝐵⟩ ∈ dom (𝑅 × {𝑌}))
21	18, 20	sselid 4006	. . . 4 ⊢ (((𝑅 × {𝑌})‘⟨𝐴, 𝐵⟩) ≠ ∅ → ⟨𝐴, 𝐵⟩ ∈ 𝑅)
22	17, 21	syl 17	. . 3 ⊢ ((𝜑 ∧ (𝐴𝐹𝐵) = 𝑌) → ⟨𝐴, 𝐵⟩ ∈ 𝑅)
23	10, 22	impbida 800	. 2 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ 𝑅 ↔ (𝐴𝐹𝐵) = 𝑌))
24	1, 23	bitrid 283	1 ⊢ (𝜑 → (𝐴𝑅𝐵 ↔ (𝐴𝐹𝐵) = 𝑌))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2108   ≠ wne 2946  ∅c0 4352  {csn 4648  ⟨cop 4654   class class class wbr 5166   × cxp 5698  dom cdm 5700  ‘cfv 6573  (class class class)co 7448

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fv 6581  df-ov 7451

This theorem is referenced by:  prsthinc  48721  prstchom2ALT  48746