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

Theorem f0rn0 6090
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 6051 . . 3 (𝐸:𝑋𝑌 → dom 𝐸 = 𝑋)
2 frn 6053 . . . . . . . . 9 (𝐸:𝑋𝑌 → ran 𝐸𝑌)
3 ralnex 2992 . . . . . . . . . 10 (∀𝑦𝑌 ¬ 𝑦 ∈ ran 𝐸 ↔ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸)
4 disj 4017 . . . . . . . . . . 11 ((𝑌 ∩ ran 𝐸) = ∅ ↔ ∀𝑦𝑌 ¬ 𝑦 ∈ ran 𝐸)
5 df-ss 3588 . . . . . . . . . . . 12 (ran 𝐸𝑌 ↔ (ran 𝐸𝑌) = ran 𝐸)
6 incom 3805 . . . . . . . . . . . . . 14 (ran 𝐸𝑌) = (𝑌 ∩ ran 𝐸)
76eqeq1i 2627 . . . . . . . . . . . . 13 ((ran 𝐸𝑌) = ran 𝐸 ↔ (𝑌 ∩ ran 𝐸) = ran 𝐸)
8 eqtr2 2642 . . . . . . . . . . . . . 14 (((𝑌 ∩ ran 𝐸) = ran 𝐸 ∧ (𝑌 ∩ ran 𝐸) = ∅) → ran 𝐸 = ∅)
98ex 450 . . . . . . . . . . . . 13 ((𝑌 ∩ ran 𝐸) = ran 𝐸 → ((𝑌 ∩ ran 𝐸) = ∅ → ran 𝐸 = ∅))
107, 9sylbi 207 . . . . . . . . . . . 12 ((ran 𝐸𝑌) = ran 𝐸 → ((𝑌 ∩ ran 𝐸) = ∅ → ran 𝐸 = ∅))
115, 10sylbi 207 . . . . . . . . . . 11 (ran 𝐸𝑌 → ((𝑌 ∩ ran 𝐸) = ∅ → ran 𝐸 = ∅))
124, 11syl5bir 233 . . . . . . . . . 10 (ran 𝐸𝑌 → (∀𝑦𝑌 ¬ 𝑦 ∈ ran 𝐸 → ran 𝐸 = ∅))
133, 12syl5bir 233 . . . . . . . . 9 (ran 𝐸𝑌 → (¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸 → ran 𝐸 = ∅))
142, 13syl 17 . . . . . . . 8 (𝐸:𝑋𝑌 → (¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸 → ran 𝐸 = ∅))
1514imp 445 . . . . . . 7 ((𝐸:𝑋𝑌 ∧ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸) → ran 𝐸 = ∅)
1615adantl 482 . . . . . 6 ((dom 𝐸 = 𝑋 ∧ (𝐸:𝑋𝑌 ∧ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸)) → ran 𝐸 = ∅)
17 dm0rn0 5342 . . . . . 6 (dom 𝐸 = ∅ ↔ ran 𝐸 = ∅)
1816, 17sylibr 224 . . . . 5 ((dom 𝐸 = 𝑋 ∧ (𝐸:𝑋𝑌 ∧ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸)) → dom 𝐸 = ∅)
19 eqeq1 2626 . . . . . . 7 (𝑋 = dom 𝐸 → (𝑋 = ∅ ↔ dom 𝐸 = ∅))
2019eqcoms 2630 . . . . . 6 (dom 𝐸 = 𝑋 → (𝑋 = ∅ ↔ dom 𝐸 = ∅))
2120adantr 481 . . . . 5 ((dom 𝐸 = 𝑋 ∧ (𝐸:𝑋𝑌 ∧ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸)) → (𝑋 = ∅ ↔ dom 𝐸 = ∅))
2218, 21mpbird 247 . . . 4 ((dom 𝐸 = 𝑋 ∧ (𝐸:𝑋𝑌 ∧ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸)) → 𝑋 = ∅)
2322exp32 631 . . 3 (dom 𝐸 = 𝑋 → (𝐸:𝑋𝑌 → (¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸𝑋 = ∅)))
241, 23mpcom 38 . 2 (𝐸:𝑋𝑌 → (¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸𝑋 = ∅))
2524imp 445 1 ((𝐸:𝑋𝑌 ∧ ¬ ∃𝑦𝑌 𝑦 ∈ ran 𝐸) → 𝑋 = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 384   = wceq 1483  wcel 1990  wral 2912  wrex 2913  cin 3573  wss 3574  c0 3915  dom cdm 5114  ran crn 5115  wf 5884
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-cnv 5122  df-dm 5124  df-rn 5125  df-fn 5891  df-f 5892
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator