Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  preiman0 Structured version   Visualization version   GIF version

Theorem preiman0 32689
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
StepHypRef Expression
1 df-rn 5627 . . . . . 6 ran 𝐹 = dom 𝐹
21ineq1i 4166 . . . . 5 (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = (dom 𝐹 ∩ (𝐴 ∩ ran 𝐹))
3 dfss2 3920 . . . . . . . . 9 (𝐴 ⊆ ran 𝐹 ↔ (𝐴 ∩ ran 𝐹) = 𝐴)
43biimpi 216 . . . . . . . 8 (𝐴 ⊆ ran 𝐹 → (𝐴 ∩ ran 𝐹) = 𝐴)
54ineq2d 4170 . . . . . . 7 (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = (ran 𝐹𝐴))
6 sseqin2 4173 . . . . . . . 8 (𝐴 ⊆ ran 𝐹 ↔ (ran 𝐹𝐴) = 𝐴)
76biimpi 216 . . . . . . 7 (𝐴 ⊆ ran 𝐹 → (ran 𝐹𝐴) = 𝐴)
85, 7eqtrd 2766 . . . . . 6 (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = 𝐴)
983ad2ant2 1134 . . . . 5 ((Fun 𝐹𝐴 ⊆ ran 𝐹 ∧ (𝐹𝐴) = ∅) → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = 𝐴)
10 fimacnvinrn 7004 . . . . . . . . 9 (Fun 𝐹 → (𝐹𝐴) = (𝐹 “ (𝐴 ∩ ran 𝐹)))
1110eqeq1d 2733 . . . . . . . 8 (Fun 𝐹 → ((𝐹𝐴) = ∅ ↔ (𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅))
1211biimpa 476 . . . . . . 7 ((Fun 𝐹 ∧ (𝐹𝐴) = ∅) → (𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅)
13123adant2 1131 . . . . . 6 ((Fun 𝐹𝐴 ⊆ ran 𝐹 ∧ (𝐹𝐴) = ∅) → (𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅)
14 imadisj 6029 . . . . . 6 ((𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅ ↔ (dom 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = ∅)
1513, 14sylib 218 . . . . 5 ((Fun 𝐹𝐴 ⊆ ran 𝐹 ∧ (𝐹𝐴) = ∅) → (dom 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = ∅)
162, 9, 153eqtr3a 2790 . . . 4 ((Fun 𝐹𝐴 ⊆ ran 𝐹 ∧ (𝐹𝐴) = ∅) → 𝐴 = ∅)
17163expia 1121 . . 3 ((Fun 𝐹𝐴 ⊆ ran 𝐹) → ((𝐹𝐴) = ∅ → 𝐴 = ∅))
1817necon3d 2949 . 2 ((Fun 𝐹𝐴 ⊆ ran 𝐹) → (𝐴 ≠ ∅ → (𝐹𝐴) ≠ ∅))
19183impia 1117 1 ((Fun 𝐹𝐴 ⊆ ran 𝐹𝐴 ≠ ∅) → (𝐹𝐴) ≠ ∅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1541  wne 2928  cin 3901  wss 3902  c0 4283  ccnv 5615  dom cdm 5616  ran crn 5617  cima 5619  Fun wfun 6475
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-12 2180  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pr 5370
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-clab 2710  df-cleq 2723  df-clel 2806  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-sn 4577  df-pr 4579  df-op 4583  df-br 5092  df-opab 5154  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-fun 6483  df-fn 6484  df-f 6485  df-fo 6487
This theorem is referenced by:  zarcmplem  33892
  Copyright terms: Public domain W3C validator