Theorem afv2fv0xorb 48045

Description: If a set is in the range of a function, the function's value at an argument is the empty set if and only if the alternate function value at this argument is either the empty set or undefined. (Contributed by AV, 11-Sep-2022.)

Assertion

Ref	Expression
afv2fv0xorb	⊢ (∅ ∈ ran 𝐹 → ((𝐹‘𝐴) = ∅ ↔ ((𝐹''''𝐴) = ∅ ⊻ (𝐹''''𝐴) ∉ ran 𝐹)))

Proof of Theorem afv2fv0xorb

Step	Hyp	Ref	Expression
1		afv2fv0b 48044	. 2 ⊢ ((𝐹‘𝐴) = ∅ ↔ ((𝐹''''𝐴) = ∅ ∨ (𝐹''''𝐴) ∉ ran 𝐹))
2		afv2orxorb 48006	. 2 ⊢ (∅ ∈ ran 𝐹 → (((𝐹''''𝐴) = ∅ ∨ (𝐹''''𝐴) ∉ ran 𝐹) ↔ ((𝐹''''𝐴) = ∅ ⊻ (𝐹''''𝐴) ∉ ran 𝐹)))
3	1, 2	bitrid 286	1 ⊢ (∅ ∈ ran 𝐹 → ((𝐹‘𝐴) = ∅ ↔ ((𝐹''''𝐴) = ∅ ⊻ (𝐹''''𝐴) ∉ ran 𝐹)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∨ wo 861   ⊻ wxo 1541   = wceq 1570   ∈ wcel 2146   ∉ wnel 3067  ∅c0 4289  ran crn 5667  ‘cfv 6543  ''''cafv2 47986

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-xor 1542  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-iota 6499  df-fun 6545  df-fv 6551  df-dfat 47897  df-afv2 47987

This theorem is used by: (None)