Theorem bj-fvimacnv0 38039

Description: Variant of fvimacnv 7046 where membership of 𝐴 in the domain is not needed provided the containing class 𝐵 does not contain the empty set. Note that this antecedent would not be needed with Definition df-afv 48009. (Contributed by BJ, 7-Jan-2024.)

Assertion

Ref	Expression
bj-fvimacnv0	⊢ ((Fun 𝐹 ∧ ¬ ∅ ∈ 𝐵) → ((𝐹‘𝐴) ∈ 𝐵 ↔ 𝐴 ∈ (◡𝐹 “ 𝐵)))

Proof of Theorem bj-fvimacnv0

Step	Hyp	Ref	Expression
1		eleq1 2848	. . . . . . . . . 10 ⊢ ((𝐹‘𝐴) = ∅ → ((𝐹‘𝐴) ∈ 𝐵 ↔ ∅ ∈ 𝐵))
2	1	biimpcd 252	. . . . . . . . 9 ⊢ ((𝐹‘𝐴) ∈ 𝐵 → ((𝐹‘𝐴) = ∅ → ∅ ∈ 𝐵))
3	2	con3rr3 156	. . . . . . . 8 ⊢ (¬ ∅ ∈ 𝐵 → ((𝐹‘𝐴) ∈ 𝐵 → ¬ (𝐹‘𝐴) = ∅))
4	3	imp 412	. . . . . . 7 ⊢ ((¬ ∅ ∈ 𝐵 ∧ (𝐹‘𝐴) ∈ 𝐵) → ¬ (𝐹‘𝐴) = ∅)
5		ndmfv 6911	. . . . . . 7 ⊢ (¬ 𝐴 ∈ dom 𝐹 → (𝐹‘𝐴) = ∅)
6	4, 5	nsyl2 142	. . . . . 6 ⊢ ((¬ ∅ ∈ 𝐵 ∧ (𝐹‘𝐴) ∈ 𝐵) → 𝐴 ∈ dom 𝐹)
7		simpr 490	. . . . . 6 ⊢ ((¬ ∅ ∈ 𝐵 ∧ (𝐹‘𝐴) ∈ 𝐵) → (𝐹‘𝐴) ∈ 𝐵)
8		fvimacnv 7046	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 ↔ 𝐴 ∈ (◡𝐹 “ 𝐵)))
9	8	biimpd 232	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ dom 𝐹) → ((𝐹‘𝐴) ∈ 𝐵 → 𝐴 ∈ (◡𝐹 “ 𝐵)))
10	9	ex 418	. . . . . . 7 ⊢ (Fun 𝐹 → (𝐴 ∈ dom 𝐹 → ((𝐹‘𝐴) ∈ 𝐵 → 𝐴 ∈ (◡𝐹 “ 𝐵))))
11	10	com3l 90	. . . . . 6 ⊢ (𝐴 ∈ dom 𝐹 → ((𝐹‘𝐴) ∈ 𝐵 → (Fun 𝐹 → 𝐴 ∈ (◡𝐹 “ 𝐵))))
12	6, 7, 11	sylc 66	. . . . 5 ⊢ ((¬ ∅ ∈ 𝐵 ∧ (𝐹‘𝐴) ∈ 𝐵) → (Fun 𝐹 → 𝐴 ∈ (◡𝐹 “ 𝐵)))
13	12	ex 418	. . . 4 ⊢ (¬ ∅ ∈ 𝐵 → ((𝐹‘𝐴) ∈ 𝐵 → (Fun 𝐹 → 𝐴 ∈ (◡𝐹 “ 𝐵))))
14	13	com3r 88	. . 3 ⊢ (Fun 𝐹 → (¬ ∅ ∈ 𝐵 → ((𝐹‘𝐴) ∈ 𝐵 → 𝐴 ∈ (◡𝐹 “ 𝐵))))
15	14	imp 412	. 2 ⊢ ((Fun 𝐹 ∧ ¬ ∅ ∈ 𝐵) → ((𝐹‘𝐴) ∈ 𝐵 → 𝐴 ∈ (◡𝐹 “ 𝐵)))
16		fvimacnvi 7045	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ (◡𝐹 “ 𝐵)) → (𝐹‘𝐴) ∈ 𝐵)
17	16	ex 418	. . 3 ⊢ (Fun 𝐹 → (𝐴 ∈ (◡𝐹 “ 𝐵) → (𝐹‘𝐴) ∈ 𝐵))
18	17	adantr 486	. 2 ⊢ ((Fun 𝐹 ∧ ¬ ∅ ∈ 𝐵) → (𝐴 ∈ (◡𝐹 “ 𝐵) → (𝐹‘𝐴) ∈ 𝐵))
19	15, 18	impbid 215	1 ⊢ ((Fun 𝐹 ∧ ¬ ∅ ∈ 𝐵) → ((𝐹‘𝐴) ∈ 𝐵 ↔ 𝐴 ∈ (◡𝐹 “ 𝐵)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∅c0 4279  ^◡ccnv 5654  dom cdm 5655   “ cima 5658  Fun wfun 6527  ‘cfv 6533

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 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-fv 6541

This theorem is used by: (None)