Theorem preiman0 33390

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 5667	. . . . . 6 ⊢ ran 𝐹 = dom ◡𝐹
2	1	ineq1i 4116	. . . . 5 ⊢ (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = (dom ◡𝐹 ∩ (𝐴 ∩ ran 𝐹))
3		dfss2 4097	. . . . . . . . 9 ⊢ (𝐴 ⊆ ran 𝐹 ↔ (𝐴 ∩ ran 𝐹) = 𝐴)
4	3	biimpi 219	. . . . . . . 8 ⊢ (𝐴 ⊆ ran 𝐹 → (𝐴 ∩ ran 𝐹) = 𝐴)
5	4	ineq2d 4120	. . . . . . 7 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = (ran 𝐹 ∩ 𝐴))
6		sseqin2 4123	. . . . . . . 8 ⊢ (𝐴 ⊆ ran 𝐹 ↔ (ran 𝐹 ∩ 𝐴) = 𝐴)
7	6	biimpi 219	. . . . . . 7 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ 𝐴) = 𝐴)
8	5, 7	eqtrd 2798	. . . . . 6 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = 𝐴)
9	8	3ad2ant2 1152	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = 𝐴)
10		fimacnvinrn 7101	. . . . . . . . 9 ⊢ (Fun 𝐹 → (◡𝐹 “ 𝐴) = (◡𝐹 “ (𝐴 ∩ ran 𝐹)))
11	10	eqeq1d 2765	. . . . . . . 8 ⊢ (Fun 𝐹 → ((◡𝐹 “ 𝐴) = ∅ ↔ (◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅))
12	11	biimpa 482	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅)
13	12	3adant2 1149	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅)
14		imadisj 6093	. . . . . 6 ⊢ ((◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅ ↔ (dom ◡𝐹 ∩ (𝐴 ∩ ran 𝐹)) = ∅)
15	13, 14	sylib 221	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (dom ◡𝐹 ∩ (𝐴 ∩ ran 𝐹)) = ∅)
16	2, 9, 15	3eqtr3a 2822	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → 𝐴 = ∅)
17	16	3expia 1139	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → ((◡𝐹 “ 𝐴) = ∅ → 𝐴 = ∅))
18	17	necon3d 2980	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → (𝐴 ≠ ∅ → (◡𝐹 “ 𝐴) ≠ ∅))
19	18	3impia 1135	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ 𝐴 ≠ ∅) → (◡𝐹 “ 𝐴) ≠ ∅)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ≠ wne 2959   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  ^◡ccnv 5655  dom cdm 5656  ran crn 5657   “ cima 5659  Fun wfun 6558

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-pr 5396

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 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5172  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-fun 6566  df-fn 6567  df-f 6568  df-fo 6570

This theorem is used by:  zarcmplem  34617