Theorem preiman0 33351

Description: The preimage of a nonempty set is nonempty. (Contributed by Thierry Arnoux, 9-Jun-2024.)

Assertion

Ref	Expression
preiman0	⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → (◡𝐹 “ 𝐴) ≠ ∅)

Proof of Theorem preiman0

Step	Hyp	Ref	Expression
1		df-rn 5661	. . . . . 6 ⊢ ran 𝐹 = dom ◡𝐹
2	1	ineq1i 4113	. . . . 5 ⊢ (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = (dom ◡𝐹 ∩ (𝐴 ∩ ran 𝐹))
3		dfss2 4094	. . . . . . . . 9 ⊢ (𝐴 ⊆ ran 𝐹 ↔ (𝐴 ∩ ran 𝐹) = 𝐴)
4	3	biimpi 219	. . . . . . . 8 ⊢ (𝐴 ⊆ ran 𝐹 → (𝐴 ∩ ran 𝐹) = 𝐴)
5	4	ineq2d 4117	. . . . . . 7 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = (ran 𝐹 ∩ 𝐴))
6		sseqin2 4120	. . . . . . . 8 ⊢ (𝐴 ⊆ ran 𝐹 ↔ (ran 𝐹 ∩ 𝐴) = 𝐴)
7	6	biimpi 219	. . . . . . 7 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ 𝐴) = 𝐴)
8	5, 7	eqtrd 2795	. . . . . 6 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = 𝐴)
9	8	3ad2ant2 1152	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = 𝐴)
10		fimacnvinrn 7072	. . . . . . . . 9 ⊢ (Fun 𝐹 → (◡𝐹 “ 𝐴) = (◡𝐹 “ (𝐴 ∩ ran 𝐹)))
11	10	eqeq1d 2762	. . . . . . . 8 ⊢ (Fun 𝐹 → ((◡𝐹 “ 𝐴) = ∅ ↔ (◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅))
12	11	biimpa 482	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅)
13	12	3adant2 1149	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅)
14		imadisj 6076	. . . . . 6 ⊢ ((◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅ ↔ (dom ◡𝐹 ∩ (𝐴 ∩ ran 𝐹)) = ∅)
15	13, 14	sylib 221	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (dom ◡𝐹 ∩ (𝐴 ∩ ran 𝐹)) = ∅)
16	2, 9, 15	3eqtr3a 2819	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → 𝐴 = ∅)
17	16	3expia 1139	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → ((◡𝐹 “ 𝐴) = ∅ → 𝐴 = ∅))
18	17	necon3d 2976	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → (𝐴 ≠ ∅ → (◡𝐹 “ 𝐴) ≠ ∅))
19	18	3impia 1135	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → (◡𝐹 “ 𝐴) ≠ ∅)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ≠ wne 2955   ⊆ wss 3895   ∩ cin 4089  ∅c0 4278  ^◡ccnv 5649  dom cdm 5650  ran crn 5651   “ cima 5653  Fun wfun 6533

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-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  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-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  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-ima 5663  df-fun 6541  df-fn 6542  df-f 6543  df-fo 6545

This theorem is used by:  zarcmplem  34560