Theorem preiman0 33296

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 5662	. . . . . 6 ⊢ ran 𝐹 = dom ◡𝐹
2	1	ineq1i 4162	. . . . 5 ⊢ (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = (dom ◡𝐹 ∩ (𝐴 ∩ ran 𝐹))
3		dfss2 3917	. . . . . . . . 9 ⊢ (𝐴 ⊆ ran 𝐹 ↔ (𝐴 ∩ ran 𝐹) = 𝐴)
4	3	biimpi 219	. . . . . . . 8 ⊢ (𝐴 ⊆ ran 𝐹 → (𝐴 ∩ ran 𝐹) = 𝐴)
5	4	ineq2d 4166	. . . . . . 7 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = (ran 𝐹 ∩ 𝐴))
6		sseqin2 4169	. . . . . . . 8 ⊢ (𝐴 ⊆ ran 𝐹 ↔ (ran 𝐹 ∩ 𝐴) = 𝐴)
7	6	biimpi 219	. . . . . . 7 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ 𝐴) = 𝐴)
8	5, 7	eqtrd 2796	. . . . . 6 ⊢ (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = 𝐴)
9	8	3ad2ant2 1152	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = 𝐴)
10		fimacnvinrn 7069	. . . . . . . . 9 ⊢ (Fun 𝐹 → (◡𝐹 “ 𝐴) = (◡𝐹 “ (𝐴 ∩ ran 𝐹)))
11	10	eqeq1d 2763	. . . . . . . 8 ⊢ (Fun 𝐹 → ((◡𝐹 “ 𝐴) = ∅ ↔ (◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅))
12	11	biimpa 482	. . . . . . 7 ⊢ ((Fun 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅)
13	12	3adant2 1149	. . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅)
14		imadisj 6077	. . . . . 6 ⊢ ((◡𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅ ↔ (dom ◡𝐹 ∩ (𝐴 ∩ ran 𝐹)) = ∅)
15	13, 14	sylib 221	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → (dom ◡𝐹 ∩ (𝐴 ∩ ran 𝐹)) = ∅)
16	2, 9, 15	3eqtr3a 2820	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝐴) = ∅) → 𝐴 = ∅)
17	16	3expia 1139	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → ((◡𝐹 “ 𝐴) = ∅ → 𝐴 = ∅))
18	17	necon3d 2977	. 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 2956   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  ^◡ccnv 5650  dom cdm 5651  ran crn 5652   “ cima 5654  Fun wfun 6531

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 2733  ax-sep 5249  ax-pr 5391

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 2565  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543

This theorem is used by:  zarcmplem  34506