Theorem preiman0 32633

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 5649	. . . . . 6 ⊢ ran 𝐹 = dom ◡𝐹
2	1	ineq1i 4179	. . . . 5 ⊢ (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = (dom ◡𝐹 ∩ (𝐴 ∩ ran 𝐹))
3		dfss2 3932	. . . . . . . . 9 ⊢ (𝐴 ⊆ ran 𝐹 ↔ (𝐴 ∩ ran 𝐹) = 𝐴)
4	3	biimpi 216	. . . . . . . 8 ⊢ (𝐴 ⊆ ran 𝐹 → (𝐴 ∩ ran 𝐹) = 𝐴)
5	4	ineq2d 4183	. . . . . . 7 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = (ran 𝐹 ∩ 𝐴))
6		sseqin2 4186	. . . . . . . 8 ⊢ (𝐴 ⊆ ran 𝐹 ↔ (ran 𝐹 ∩ 𝐴) = 𝐴)
7	6	biimpi 216	. . . . . . 7 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ 𝐴) = 𝐴)
8	5, 7	eqtrd 2764	. . . . . 6 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = 𝐴)
9	8	3ad2ant2 1134	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = 𝐴)
10		fimacnvinrn 7043	. . . . . . . . 9 ⊢ (Fun 𝐹 → (◡𝐹 “ 𝐴) = (◡𝐹 “ (𝐴 ∩ ran 𝐹)))
11	10	eqeq1d 2731	. . . . . . . 8 ⊢ (Fun 𝐹 → ((◡𝐹 “ 𝐴) = ∅ ↔ (◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅))
12	11	biimpa 476	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅)
13	12	3adant2 1131	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅)
14		imadisj 6051	. . . . . 6 ⊢ ((◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅ ↔ (dom ◡𝐹 ∩ (𝐴 ∩ ran 𝐹)) = ∅)
15	13, 14	sylib 218	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (dom ◡𝐹 ∩ (𝐴 ∩ ran 𝐹)) = ∅)
16	2, 9, 15	3eqtr3a 2788	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → 𝐴 = ∅)
17	16	3expia 1121	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → ((◡𝐹 “ 𝐴) = ∅ → 𝐴 = ∅))
18	17	necon3d 2946	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → (𝐴 ≠ ∅ → (◡𝐹 “ 𝐴) ≠ ∅))
19	18	3impia 1117	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → (◡𝐹 “ 𝐴) ≠ ∅)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ≠ wne 2925   ∩ cin 3913   ⊆ wss 3914  ∅c0 4296  ^◡ccnv 5637  dom cdm 5638  ran crn 5639   “ cima 5641  Fun wfun 6505

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-fun 6513  df-fn 6514  df-f 6515  df-fo 6517

This theorem is referenced by:  zarcmplem  33871