Theorem afv2fv0xorb 48430

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 48429	. 2 ⊢ ((𝐹‘𝐴) = ∅ ↔ ((𝐹''''𝐴) = ∅ ∨ (𝐹''''𝐴) ∉ ran 𝐹))
2		afv2orxorb 48391	. 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 1540   = wceq 1569   ∈ wcel 2144   ∉ wnel 3061  ∅c0 4278  ran crn 5651  ‘cfv 6538  ''''cafv2 48371

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-xor 1541  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-iota 6494  df-fun 6540  df-fv 6546  df-dfat 48282  df-afv2 48372

This theorem is used by: (None)