Theorem afv2fv0xorb 48163

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 48162	. 2 ⊢ ((𝐹‘𝐴) = ∅ ↔ ((𝐹''''𝐴) = ∅ ∨ (𝐹''''𝐴) ∉ ran 𝐹))
2		afv2orxorb 48124	. 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 2145   ∉ wnel 3063  ∅c0 4282  ran crn 5660  ‘cfv 6537  ''''cafv2 48104

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 2147  ax-9 2155  ax-10 2178  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-iota 6493  df-fun 6539  df-fv 6545  df-dfat 48015  df-afv2 48105

This theorem is used by: (None)