MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  f0rn0 Structured version   Visualization version   GIF version

Theorem f0rn0 6776
Description: If there is no element in the range of a function, its domain must be empty. (Contributed by Alexander van der Vekens, 12-Jul-2018.)
Assertion
Ref Expression
f0rn0 ((𝐸:𝑋𝑌 ∧ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸) → 𝑋 = ∅)
Distinct variable groups:   𝑦,𝐸   𝑦,𝑌
Allowed substitution hint:   𝑋(𝑦)

Proof of Theorem f0rn0
StepHypRef Expression
1 fdm 6726 . . 3 (𝐸:𝑋𝑌 → dom 𝐸 = 𝑋)
2 frn 6724 . . . . . . . . 9 (𝐸:𝑋𝑌 → ran 𝐸𝑌)
3 ralnex 3071 . . . . . . . . . 10 (∀𝑦𝑌 ¬ 𝑦 ∈ ran 𝐸 ↔ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸)
4 disj 4447 . . . . . . . . . . 11 ((𝑌 ∩ ran 𝐸) = ∅ ↔ ∀𝑦𝑌 ¬ 𝑦 ∈ ran 𝐸)
5 df-ss 3965 . . . . . . . . . . . 12 (ran 𝐸𝑌 ↔ (ran 𝐸𝑌) = ran 𝐸)
6 incom 4201 . . . . . . . . . . . . . 14 (ran 𝐸𝑌) = (𝑌 ∩ ran 𝐸)
76eqeq1i 2736 . . . . . . . . . . . . 13 ((ran 𝐸𝑌) = ran 𝐸 ↔ (𝑌 ∩ ran 𝐸) = ran 𝐸)
8 eqtr2 2755 . . . . . . . . . . . . . 14 (((𝑌 ∩ ran 𝐸) = ran 𝐸 ∧ (𝑌 ∩ ran 𝐸) = ∅) → ran 𝐸 = ∅)
98ex 412 . . . . . . . . . . . . 13 ((𝑌 ∩ ran 𝐸) = ran 𝐸 → ((𝑌 ∩ ran 𝐸) = ∅ → ran 𝐸 = ∅))
107, 9sylbi 216 . . . . . . . . . . . 12 ((ran 𝐸𝑌) = ran 𝐸 → ((𝑌 ∩ ran 𝐸) = ∅ → ran 𝐸 = ∅))
115, 10sylbi 216 . . . . . . . . . . 11 (ran 𝐸𝑌 → ((𝑌 ∩ ran 𝐸) = ∅ → ran 𝐸 = ∅))
124, 11biimtrrid 242 . . . . . . . . . 10 (ran 𝐸𝑌 → (∀𝑦𝑌 ¬ 𝑦 ∈ ran 𝐸 → ran 𝐸 = ∅))
133, 12biimtrrid 242 . . . . . . . . 9 (ran 𝐸𝑌 → (¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸 → ran 𝐸 = ∅))
142, 13syl 17 . . . . . . . 8 (𝐸:𝑋𝑌 → (¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸 → ran 𝐸 = ∅))
1514imp 406 . . . . . . 7 ((𝐸:𝑋𝑌 ∧ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸) → ran 𝐸 = ∅)
1615adantl 481 . . . . . 6 ((dom 𝐸 = 𝑋 ∧ (𝐸:𝑋𝑌 ∧ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸)) → ran 𝐸 = ∅)
17 dm0rn0 5924 . . . . . 6 (dom 𝐸 = ∅ ↔ ran 𝐸 = ∅)
1816, 17sylibr 233 . . . . 5 ((dom 𝐸 = 𝑋 ∧ (𝐸:𝑋𝑌 ∧ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸)) → dom 𝐸 = ∅)
19 eqeq1 2735 . . . . . . 7 (𝑋 = dom 𝐸 → (𝑋 = ∅ ↔ dom 𝐸 = ∅))
2019eqcoms 2739 . . . . . 6 (dom 𝐸 = 𝑋 → (𝑋 = ∅ ↔ dom 𝐸 = ∅))
2120adantr 480 . . . . 5 ((dom 𝐸 = 𝑋 ∧ (𝐸:𝑋𝑌 ∧ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸)) → (𝑋 = ∅ ↔ dom 𝐸 = ∅))
2218, 21mpbird 257 . . . 4 ((dom 𝐸 = 𝑋 ∧ (𝐸:𝑋𝑌 ∧ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸)) → 𝑋 = ∅)
2322exp32 420 . . 3 (dom 𝐸 = 𝑋 → (𝐸:𝑋𝑌 → (¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸𝑋 = ∅)))
241, 23mpcom 38 . 2 (𝐸:𝑋𝑌 → (¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸𝑋 = ∅))
2524imp 406 1 ((𝐸:𝑋𝑌 ∧ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸) → 𝑋 = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395   = wceq 1540  wcel 2105  wral 3060  wrex 3069  cin 3947  wss 3948  c0 4322  dom cdm 5676  ran crn 5677  wf 6539
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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pr 5427
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-clab 2709  df-cleq 2723  df-clel 2809  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-cnv 5684  df-dm 5686  df-rn 5687  df-fn 6546  df-f 6547
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator