Theorem afv2orxorb 47786

Description: If a set is in the range of a function, the alternate function value at a class 𝐴 equals this set or is not in the range of the function iff the alternate function value at the class 𝐴 either equals this set or is not in the range of the function. If 𝐵 ∉ ran 𝐹, both disjuncts of the exclusive or can be true: (𝐹''''𝐴) = 𝐵 → (𝐹''''𝐴) ∉ ran 𝐹. (Contributed by AV, 11-Sep-2022.)

Assertion

Ref	Expression
afv2orxorb	⊢ (𝐵 ∈ ran 𝐹 → (((𝐹''''𝐴) = 𝐵 ∨ (𝐹''''𝐴) ∉ ran 𝐹) ↔ ((𝐹''''𝐴) = 𝐵 ⊻ (𝐹''''𝐴) ∉ ran 𝐹)))

Proof of Theorem afv2orxorb

Step	Hyp	Ref	Expression
1		eleq1 2849	. . . . . . . . . . 11 ⊢ (𝐵 = (𝐹''''𝐴) → (𝐵 ∈ ran 𝐹 ↔ (𝐹''''𝐴) ∈ ran 𝐹))
2	1	eqcoms 2769	. . . . . . . . . 10 ⊢ ((𝐹''''𝐴) = 𝐵 → (𝐵 ∈ ran 𝐹 ↔ (𝐹''''𝐴) ∈ ran 𝐹))
3	2	biimpa 480	. . . . . . . . 9 ⊢ (((𝐹''''𝐴) = 𝐵 ∧ 𝐵 ∈ ran 𝐹) → (𝐹''''𝐴) ∈ ran 𝐹)
4		nnel 3070	. . . . . . . . 9 ⊢ (¬ (𝐹''''𝐴) ∉ ran 𝐹 ↔ (𝐹''''𝐴) ∈ ran 𝐹)
5	3, 4	sylibr 236	. . . . . . . 8 ⊢ (((𝐹''''𝐴) = 𝐵 ∧ 𝐵 ∈ ran 𝐹) → ¬ (𝐹''''𝐴) ∉ ran 𝐹)
6	5	a1d 25	. . . . . . 7 ⊢ (((𝐹''''𝐴) = 𝐵 ∧ 𝐵 ∈ ran 𝐹) → ((𝐹''''𝐴) = 𝐵 → ¬ (𝐹''''𝐴) ∉ ran 𝐹))
7		simpl 486	. . . . . . . 8 ⊢ (((𝐹''''𝐴) = 𝐵 ∧ 𝐵 ∈ ran 𝐹) → (𝐹''''𝐴) = 𝐵)
8	7	a1d 25	. . . . . . 7 ⊢ (((𝐹''''𝐴) = 𝐵 ∧ 𝐵 ∈ ran 𝐹) → (¬ (𝐹''''𝐴) ∉ ran 𝐹 → (𝐹''''𝐴) = 𝐵))
9	6, 8	jca 519	. . . . . 6 ⊢ (((𝐹''''𝐴) = 𝐵 ∧ 𝐵 ∈ ran 𝐹) → (((𝐹''''𝐴) = 𝐵 → ¬ (𝐹''''𝐴) ∉ ran 𝐹) ∧ (¬ (𝐹''''𝐴) ∉ ran 𝐹 → (𝐹''''𝐴) = 𝐵)))
10	9	ex 416	. . . . 5 ⊢ ((𝐹''''𝐴) = 𝐵 → (𝐵 ∈ ran 𝐹 → (((𝐹''''𝐴) = 𝐵 → ¬ (𝐹''''𝐴) ∉ ran 𝐹) ∧ (¬ (𝐹''''𝐴) ∉ ran 𝐹 → (𝐹''''𝐴) = 𝐵))))
11		eleq1 2849	. . . . . . . . . 10 ⊢ ((𝐹''''𝐴) = 𝐵 → ((𝐹''''𝐴) ∈ ran 𝐹 ↔ 𝐵 ∈ ran 𝐹))
12	11	anbi2d 639	. . . . . . . . 9 ⊢ ((𝐹''''𝐴) = 𝐵 → (((𝐹''''𝐴) ∉ ran 𝐹 ∧ (𝐹''''𝐴) ∈ ran 𝐹) ↔ ((𝐹''''𝐴) ∉ ran 𝐹 ∧ 𝐵 ∈ ran 𝐹)))
13		pm2.24nel 3073	. . . . . . . . . 10 ⊢ ((𝐹''''𝐴) ∈ ran 𝐹 → ((𝐹''''𝐴) ∉ ran 𝐹 → ¬ (𝐹''''𝐴) ∉ ran 𝐹))
14	13	impcom 411	. . . . . . . . 9 ⊢ (((𝐹''''𝐴) ∉ ran 𝐹 ∧ (𝐹''''𝐴) ∈ ran 𝐹) → ¬ (𝐹''''𝐴) ∉ ran 𝐹)
15	12, 14	biimtrrdi 256	. . . . . . . 8 ⊢ ((𝐹''''𝐴) = 𝐵 → (((𝐹''''𝐴) ∉ ran 𝐹 ∧ 𝐵 ∈ ran 𝐹) → ¬ (𝐹''''𝐴) ∉ ran 𝐹))
16	15	com12 32	. . . . . . 7 ⊢ (((𝐹''''𝐴) ∉ ran 𝐹 ∧ 𝐵 ∈ ran 𝐹) → ((𝐹''''𝐴) = 𝐵 → ¬ (𝐹''''𝐴) ∉ ran 𝐹))
17		pm2.24 124	. . . . . . . 8 ⊢ ((𝐹''''𝐴) ∉ ran 𝐹 → (¬ (𝐹''''𝐴) ∉ ran 𝐹 → (𝐹''''𝐴) = 𝐵))
18	17	adantr 484	. . . . . . 7 ⊢ (((𝐹''''𝐴) ∉ ran 𝐹 ∧ 𝐵 ∈ ran 𝐹) → (¬ (𝐹''''𝐴) ∉ ran 𝐹 → (𝐹''''𝐴) = 𝐵))
19	16, 18	jca 519	. . . . . 6 ⊢ (((𝐹''''𝐴) ∉ ran 𝐹 ∧ 𝐵 ∈ ran 𝐹) → (((𝐹''''𝐴) = 𝐵 → ¬ (𝐹''''𝐴) ∉ ran 𝐹) ∧ (¬ (𝐹''''𝐴) ∉ ran 𝐹 → (𝐹''''𝐴) = 𝐵)))
20	19	ex 416	. . . . 5 ⊢ ((𝐹''''𝐴) ∉ ran 𝐹 → (𝐵 ∈ ran 𝐹 → (((𝐹''''𝐴) = 𝐵 → ¬ (𝐹''''𝐴) ∉ ran 𝐹) ∧ (¬ (𝐹''''𝐴) ∉ ran 𝐹 → (𝐹''''𝐴) = 𝐵))))
21	10, 20	jaoi 868	. . . 4 ⊢ (((𝐹''''𝐴) = 𝐵 ∨ (𝐹''''𝐴) ∉ ran 𝐹) → (𝐵 ∈ ran 𝐹 → (((𝐹''''𝐴) = 𝐵 → ¬ (𝐹''''𝐴) ∉ ran 𝐹) ∧ (¬ (𝐹''''𝐴) ∉ ran 𝐹 → (𝐹''''𝐴) = 𝐵))))
22	21	com12 32	. . 3 ⊢ (𝐵 ∈ ran 𝐹 → (((𝐹''''𝐴) = 𝐵 ∨ (𝐹''''𝐴) ∉ ran 𝐹) → (((𝐹''''𝐴) = 𝐵 → ¬ (𝐹''''𝐴) ∉ ran 𝐹) ∧ (¬ (𝐹''''𝐴) ∉ ran 𝐹 → (𝐹''''𝐴) = 𝐵))))
23		df-xor 1531	. . . 4 ⊢ (((𝐹''''𝐴) = 𝐵 ⊻ (𝐹''''𝐴) ∉ ran 𝐹) ↔ ¬ ((𝐹''''𝐴) = 𝐵 ↔ (𝐹''''𝐴) ∉ ran 𝐹))
24		xor3 384	. . . 4 ⊢ (¬ ((𝐹''''𝐴) = 𝐵 ↔ (𝐹''''𝐴) ∉ ran 𝐹) ↔ ((𝐹''''𝐴) = 𝐵 ↔ ¬ (𝐹''''𝐴) ∉ ran 𝐹))
25		dfbi2 478	. . . 4 ⊢ (((𝐹''''𝐴) = 𝐵 ↔ ¬ (𝐹''''𝐴) ∉ ran 𝐹) ↔ (((𝐹''''𝐴) = 𝐵 → ¬ (𝐹''''𝐴) ∉ ran 𝐹) ∧ (¬ (𝐹''''𝐴) ∉ ran 𝐹 → (𝐹''''𝐴) = 𝐵)))
26	23, 24, 25	3bitri 299	. . 3 ⊢ (((𝐹''''𝐴) = 𝐵 ⊻ (𝐹''''𝐴) ∉ ran 𝐹) ↔ (((𝐹''''𝐴) = 𝐵 → ¬ (𝐹''''𝐴) ∉ ran 𝐹) ∧ (¬ (𝐹''''𝐴) ∉ ran 𝐹 → (𝐹''''𝐴) = 𝐵)))
27	22, 26	imbitrrdi 254	. 2 ⊢ (𝐵 ∈ ran 𝐹 → (((𝐹''''𝐴) = 𝐵 ∨ (𝐹''''𝐴) ∉ ran 𝐹) → ((𝐹''''𝐴) = 𝐵 ⊻ (𝐹''''𝐴) ∉ ran 𝐹)))
28		xoror 1537	. 2 ⊢ (((𝐹''''𝐴) = 𝐵 ⊻ (𝐹''''𝐴) ∉ ran 𝐹) → ((𝐹''''𝐴) = 𝐵 ∨ (𝐹''''𝐴) ∉ ran 𝐹))
29	27, 28	impbid1 227	1 ⊢ (𝐵 ∈ ran 𝐹 → (((𝐹''''𝐴) = 𝐵 ∨ (𝐹''''𝐴) ∉ ran 𝐹) ↔ ((𝐹''''𝐴) = 𝐵 ⊻ (𝐹''''𝐴) ∉ ran 𝐹)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 399   ∨ wo 858   ⊻ wxo 1530   = wceq 1559   ∈ wcel 2141   ∉ wnel 3060  ran crn 5646  ''''cafv2 47766

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-xor 1531  df-ex 1799  df-cleq 2753  df-clel 2836  df-nel 3061

This theorem is referenced by:  afv2fv0xorb  47825