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 31038
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 5601 . . . . . 6 ran 𝐹 = dom 𝐹
21ineq1i 4148 . . . . 5 (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = (dom 𝐹 ∩ (𝐴 ∩ ran 𝐹))
3 df-ss 3909 . . . . . . . . 9 (𝐴 ⊆ ran 𝐹 ↔ (𝐴 ∩ ran 𝐹) = 𝐴)
43biimpi 215 . . . . . . . 8 (𝐴 ⊆ ran 𝐹 → (𝐴 ∩ ran 𝐹) = 𝐴)
54ineq2d 4152 . . . . . . 7 (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = (ran 𝐹𝐴))
6 sseqin2 4155 . . . . . . . 8 (𝐴 ⊆ ran 𝐹 ↔ (ran 𝐹𝐴) = 𝐴)
76biimpi 215 . . . . . . 7 (𝐴 ⊆ ran 𝐹 → (ran 𝐹𝐴) = 𝐴)
85, 7eqtrd 2780 . . . . . 6 (𝐴 ⊆ ran 𝐹 → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = 𝐴)
983ad2ant2 1133 . . . . 5 ((Fun 𝐹𝐴 ⊆ ran 𝐹 ∧ (𝐹𝐴) = ∅) → (ran 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = 𝐴)
10 fimacnvinrn 6946 . . . . . . . . 9 (Fun 𝐹 → (𝐹𝐴) = (𝐹 “ (𝐴 ∩ ran 𝐹)))
1110eqeq1d 2742 . . . . . . . 8 (Fun 𝐹 → ((𝐹𝐴) = ∅ ↔ (𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅))
1211biimpa 477 . . . . . . 7 ((Fun 𝐹 ∧ (𝐹𝐴) = ∅) → (𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅)
13123adant2 1130 . . . . . 6 ((Fun 𝐹𝐴 ⊆ ran 𝐹 ∧ (𝐹𝐴) = ∅) → (𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅)
14 imadisj 5987 . . . . . 6 ((𝐹 “ (𝐴 ∩ ran 𝐹)) = ∅ ↔ (dom 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = ∅)
1513, 14sylib 217 . . . . 5 ((Fun 𝐹𝐴 ⊆ ran 𝐹 ∧ (𝐹𝐴) = ∅) → (dom 𝐹 ∩ (𝐴 ∩ ran 𝐹)) = ∅)
162, 9, 153eqtr3a 2804 . . . 4 ((Fun 𝐹𝐴 ⊆ ran 𝐹 ∧ (𝐹𝐴) = ∅) → 𝐴 = ∅)
17163expia 1120 . . 3 ((Fun 𝐹𝐴 ⊆ ran 𝐹) → ((𝐹𝐴) = ∅ → 𝐴 = ∅))
1817necon3d 2966 . 2 ((Fun 𝐹𝐴 ⊆ ran 𝐹) → (𝐴 ≠ ∅ → (𝐹𝐴) ≠ ∅))
19183impia 1116 1 ((Fun 𝐹𝐴 ⊆ ran 𝐹𝐴 ≠ ∅) → (𝐹𝐴) ≠ ∅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1086   = wceq 1542  wne 2945  cin 3891  wss 3892  c0 4262  ccnv 5589  dom cdm 5590  ran crn 5591  cima 5593  Fun wfun 6426
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2015  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2711  ax-sep 5227  ax-nul 5234  ax-pr 5356
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2072  df-mo 2542  df-eu 2571  df-clab 2718  df-cleq 2732  df-clel 2818  df-nfc 2891  df-ne 2946  df-ral 3071  df-rex 3072  df-rab 3075  df-v 3433  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-sn 4568  df-pr 4570  df-op 4574  df-br 5080  df-opab 5142  df-id 5490  df-xp 5596  df-rel 5597  df-cnv 5598  df-co 5599  df-dm 5600  df-rn 5601  df-res 5602  df-ima 5603  df-fun 6434  df-fn 6435  df-f 6436  df-fo 6438
This theorem is referenced by:  zarcmplem  31827
  Copyright terms: Public domain W3C validator