Theorem aov0ov0 47381

Description: If the alternative value of the operation on an ordered pair is the empty set, the operation's value at this ordered pair is the empty set. (Contributed by Alexander van der Vekens, 26-May-2017.)

Assertion

Ref	Expression
aov0ov0	⊢ ( ((𝐴𝐹𝐵)) = ∅ → (𝐴𝐹𝐵) = ∅)

Proof of Theorem aov0ov0

Step	Hyp	Ref	Expression
1		afv0fv0 47337	. 2 ⊢ ((𝐹'''⟨𝐴, 𝐵⟩) = ∅ → (𝐹‘⟨𝐴, 𝐵⟩) = ∅)
2		df-aov 47309	. . 3 ⊢ ((𝐴𝐹𝐵)) = (𝐹'''⟨𝐴, 𝐵⟩)
3	2	eqeq1i 2739	. 2 ⊢ ( ((𝐴𝐹𝐵)) = ∅ ↔ (𝐹'''⟨𝐴, 𝐵⟩) = ∅)
4		df-ov 7359	. . 3 ⊢ (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
5	4	eqeq1i 2739	. 2 ⊢ ((𝐴𝐹𝐵) = ∅ ↔ (𝐹‘⟨𝐴, 𝐵⟩) = ∅)
6	1, 3, 5	3imtr4i 292	1 ⊢ ( ((𝐴𝐹𝐵)) = ∅ → (𝐴𝐹𝐵) = ∅)

Syntax hints:   → wi 4   = wceq 1541  ∅c0 4283  ⟨cop 4584  ‘cfv 6490  (class class class)co 7356  '''cafv 47305   ((caov 47306

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-int 4901  df-br 5097  df-opab 5159  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-res 5634  df-iota 6446  df-fun 6492  df-fv 6498  df-ov 7359  df-aiota 47273  df-dfat 47307  df-afv 47308  df-aov 47309

This theorem is referenced by: (None)