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

Theorem dffo3f 7060
Description: An onto mapping expressed in terms of function values. As dffo3 7056 but with less disjoint vars constraints. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
Hypothesis
Ref Expression
dffo3f.1 𝑥𝐹
Assertion
Ref Expression
dffo3f (𝐹:𝐴onto𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥𝐴 𝑦 = (𝐹𝑥)))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑦,𝐹
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem dffo3f
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 dffo2 6758 . 2 (𝐹:𝐴onto𝐵 ↔ (𝐹:𝐴𝐵 ∧ ran 𝐹 = 𝐵))
2 ffn 6670 . . . . 5 (𝐹:𝐴𝐵𝐹 Fn 𝐴)
3 fnrnfv 6901 . . . . . . 7 (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑤𝐴 𝑦 = (𝐹𝑤)})
4 dffo3f.1 . . . . . . . . . . 11 𝑥𝐹
5 nfcv 2899 . . . . . . . . . . 11 𝑥𝑤
64, 5nffv 6852 . . . . . . . . . 10 𝑥(𝐹𝑤)
76nfeq2 2917 . . . . . . . . 9 𝑥 𝑦 = (𝐹𝑤)
8 nfv 1916 . . . . . . . . 9 𝑤 𝑦 = (𝐹𝑥)
9 fveq2 6842 . . . . . . . . . 10 (𝑤 = 𝑥 → (𝐹𝑤) = (𝐹𝑥))
109eqeq2d 2748 . . . . . . . . 9 (𝑤 = 𝑥 → (𝑦 = (𝐹𝑤) ↔ 𝑦 = (𝐹𝑥)))
117, 8, 10cbvrexw 3281 . . . . . . . 8 (∃𝑤𝐴 𝑦 = (𝐹𝑤) ↔ ∃𝑥𝐴 𝑦 = (𝐹𝑥))
1211abbii 2804 . . . . . . 7 {𝑦 ∣ ∃𝑤𝐴 𝑦 = (𝐹𝑤)} = {𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)}
133, 12eqtrdi 2788 . . . . . 6 (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)})
1413eqeq1d 2739 . . . . 5 (𝐹 Fn 𝐴 → (ran 𝐹 = 𝐵 ↔ {𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)} = 𝐵))
152, 14syl 17 . . . 4 (𝐹:𝐴𝐵 → (ran 𝐹 = 𝐵 ↔ {𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)} = 𝐵))
16 dfbi2 474 . . . . . . 7 ((∃𝑥𝐴 𝑦 = (𝐹𝑥) ↔ 𝑦𝐵) ↔ ((∃𝑥𝐴 𝑦 = (𝐹𝑥) → 𝑦𝐵) ∧ (𝑦𝐵 → ∃𝑥𝐴 𝑦 = (𝐹𝑥))))
17 nfcv 2899 . . . . . . . . . 10 𝑥𝐴
18 nfcv 2899 . . . . . . . . . 10 𝑥𝐵
194, 17, 18nff 6666 . . . . . . . . 9 𝑥 𝐹:𝐴𝐵
20 nfv 1916 . . . . . . . . 9 𝑥 𝑦𝐵
21 simpr 484 . . . . . . . . . . 11 (((𝐹:𝐴𝐵𝑥𝐴) ∧ 𝑦 = (𝐹𝑥)) → 𝑦 = (𝐹𝑥))
22 ffvelcdm 7035 . . . . . . . . . . . 12 ((𝐹:𝐴𝐵𝑥𝐴) → (𝐹𝑥) ∈ 𝐵)
2322adantr 480 . . . . . . . . . . 11 (((𝐹:𝐴𝐵𝑥𝐴) ∧ 𝑦 = (𝐹𝑥)) → (𝐹𝑥) ∈ 𝐵)
2421, 23eqeltrd 2837 . . . . . . . . . 10 (((𝐹:𝐴𝐵𝑥𝐴) ∧ 𝑦 = (𝐹𝑥)) → 𝑦𝐵)
2524exp31 419 . . . . . . . . 9 (𝐹:𝐴𝐵 → (𝑥𝐴 → (𝑦 = (𝐹𝑥) → 𝑦𝐵)))
2619, 20, 25rexlimd 3245 . . . . . . . 8 (𝐹:𝐴𝐵 → (∃𝑥𝐴 𝑦 = (𝐹𝑥) → 𝑦𝐵))
2726biantrurd 532 . . . . . . 7 (𝐹:𝐴𝐵 → ((𝑦𝐵 → ∃𝑥𝐴 𝑦 = (𝐹𝑥)) ↔ ((∃𝑥𝐴 𝑦 = (𝐹𝑥) → 𝑦𝐵) ∧ (𝑦𝐵 → ∃𝑥𝐴 𝑦 = (𝐹𝑥)))))
2816, 27bitr4id 290 . . . . . 6 (𝐹:𝐴𝐵 → ((∃𝑥𝐴 𝑦 = (𝐹𝑥) ↔ 𝑦𝐵) ↔ (𝑦𝐵 → ∃𝑥𝐴 𝑦 = (𝐹𝑥))))
2928albidv 1922 . . . . 5 (𝐹:𝐴𝐵 → (∀𝑦(∃𝑥𝐴 𝑦 = (𝐹𝑥) ↔ 𝑦𝐵) ↔ ∀𝑦(𝑦𝐵 → ∃𝑥𝐴 𝑦 = (𝐹𝑥))))
30 eqabcb 2877 . . . . 5 ({𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)} = 𝐵 ↔ ∀𝑦(∃𝑥𝐴 𝑦 = (𝐹𝑥) ↔ 𝑦𝐵))
31 df-ral 3053 . . . . 5 (∀𝑦𝐵𝑥𝐴 𝑦 = (𝐹𝑥) ↔ ∀𝑦(𝑦𝐵 → ∃𝑥𝐴 𝑦 = (𝐹𝑥)))
3229, 30, 313bitr4g 314 . . . 4 (𝐹:𝐴𝐵 → ({𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)} = 𝐵 ↔ ∀𝑦𝐵𝑥𝐴 𝑦 = (𝐹𝑥)))
3315, 32bitrd 279 . . 3 (𝐹:𝐴𝐵 → (ran 𝐹 = 𝐵 ↔ ∀𝑦𝐵𝑥𝐴 𝑦 = (𝐹𝑥)))
3433pm5.32i 574 . 2 ((𝐹:𝐴𝐵 ∧ ran 𝐹 = 𝐵) ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥𝐴 𝑦 = (𝐹𝑥)))
351, 34bitri 275 1 (𝐹:𝐴onto𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥𝐴 𝑦 = (𝐹𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wal 1540   = wceq 1542  wcel 2114  {cab 2715  wnfc 2884  wral 3052  wrex 3062  ran crn 5633   Fn wfn 6495  wf 6496  ontowfo 6498  cfv 6500
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fo 6506  df-fv 6508
This theorem is referenced by:  foelrnf  7062  fompt  7072
  Copyright terms: Public domain W3C validator