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

Theorem dffo3f 7091
Description: An onto mapping expressed in terms of function values. As dffo3 7087 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 6786 . 2 (𝐹:𝐴onto𝐵 ↔ (𝐹:𝐴𝐵 ∧ ran 𝐹 = 𝐵))
2 ffn 6695 . . . . 5 (𝐹:𝐴𝐵𝐹 Fn 𝐴)
3 fnrnfv 6930 . . . . . . 7 (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑤𝐴 𝑦 = (𝐹𝑤)})
4 dffo3f.1 . . . . . . . . . . 11 𝑥𝐹
5 nfcv 2927 . . . . . . . . . . 11 𝑥𝑤
64, 5nffv 6881 . . . . . . . . . 10 𝑥(𝐹𝑤)
76nfeq2 2944 . . . . . . . . 9 𝑥 𝑦 = (𝐹𝑤)
8 nfv 1937 . . . . . . . . 9 𝑤 𝑦 = (𝐹𝑥)
9 fveq2 6871 . . . . . . . . . 10 (𝑤 = 𝑥 → (𝐹𝑤) = (𝐹𝑥))
109eqeq2d 2776 . . . . . . . . 9 (𝑤 = 𝑥 → (𝑦 = (𝐹𝑤) ↔ 𝑦 = (𝐹𝑥)))
117, 8, 10cbvrexw 3308 . . . . . . . 8 (∃𝑤𝐴 𝑦 = (𝐹𝑤) ↔ ∃𝑥𝐴 𝑦 = (𝐹𝑥))
1211abbii 2832 . . . . . . 7 {𝑦 ∣ ∃𝑤𝐴 𝑦 = (𝐹𝑤)} = {𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)}
133, 12eqtrdi 2816 . . . . . 6 (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)})
1413eqeq1d 2767 . . . . 5 (𝐹 Fn 𝐴 → (ran 𝐹 = 𝐵 ↔ {𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)} = 𝐵))
152, 14syl 18 . . . 4 (𝐹:𝐴𝐵 → (ran 𝐹 = 𝐵 ↔ {𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)} = 𝐵))
16 dfbi2 479 . . . . . . 7 ((∃𝑥𝐴 𝑦 = (𝐹𝑥) ↔ 𝑦𝐵) ↔ ((∃𝑥𝐴 𝑦 = (𝐹𝑥) → 𝑦𝐵) ∧ (𝑦𝐵 → ∃𝑥𝐴 𝑦 = (𝐹𝑥))))
17 nfcv 2927 . . . . . . . . . 10 𝑥𝐴
18 nfcv 2927 . . . . . . . . . 10 𝑥𝐵
194, 17, 18nff 6691 . . . . . . . . 9 𝑥 𝐹:𝐴𝐵
20 nfv 1937 . . . . . . . . 9 𝑥 𝑦𝐵
21 simpr 489 . . . . . . . . . . 11 (((𝐹:𝐴𝐵𝑥𝐴) ∧ 𝑦 = (𝐹𝑥)) → 𝑦 = (𝐹𝑥))
22 ffvelcdm 7066 . . . . . . . . . . . 12 ((𝐹:𝐴𝐵𝑥𝐴) → (𝐹𝑥) ∈ 𝐵)
2322adantr 485 . . . . . . . . . . 11 (((𝐹:𝐴𝐵𝑥𝐴) ∧ 𝑦 = (𝐹𝑥)) → (𝐹𝑥) ∈ 𝐵)
2421, 23eqeltrd 2865 . . . . . . . . . 10 (((𝐹:𝐴𝐵𝑥𝐴) ∧ 𝑦 = (𝐹𝑥)) → 𝑦𝐵)
2524exp31 424 . . . . . . . . 9 (𝐹:𝐴𝐵 → (𝑥𝐴 → (𝑦 = (𝐹𝑥) → 𝑦𝐵)))
2619, 20, 25rexlimd 3272 . . . . . . . 8 (𝐹:𝐴𝐵 → (∃𝑥𝐴 𝑦 = (𝐹𝑥) → 𝑦𝐵))
2726biantrurd 541 . . . . . . 7 (𝐹:𝐴𝐵 → ((𝑦𝐵 → ∃𝑥𝐴 𝑦 = (𝐹𝑥)) ↔ ((∃𝑥𝐴 𝑦 = (𝐹𝑥) → 𝑦𝐵) ∧ (𝑦𝐵 → ∃𝑥𝐴 𝑦 = (𝐹𝑥)))))
2816, 27bitr4id 293 . . . . . 6 (𝐹:𝐴𝐵 → ((∃𝑥𝐴 𝑦 = (𝐹𝑥) ↔ 𝑦𝐵) ↔ (𝑦𝐵 → ∃𝑥𝐴 𝑦 = (𝐹𝑥))))
2928albidv 1943 . . . . 5 (𝐹:𝐴𝐵 → (∀𝑦(∃𝑥𝐴 𝑦 = (𝐹𝑥) ↔ 𝑦𝐵) ↔ ∀𝑦(𝑦𝐵 → ∃𝑥𝐴 𝑦 = (𝐹𝑥))))
30 eqabcb 2905 . . . . 5 ({𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)} = 𝐵 ↔ ∀𝑦(∃𝑥𝐴 𝑦 = (𝐹𝑥) ↔ 𝑦𝐵))
31 df-ral 3080 . . . . 5 (∀𝑦𝐵𝑥𝐴 𝑦 = (𝐹𝑥) ↔ ∀𝑦(𝑦𝐵 → ∃𝑥𝐴 𝑦 = (𝐹𝑥)))
3229, 30, 313bitr4g 317 . . . 4 (𝐹:𝐴𝐵 → ({𝑦 ∣ ∃𝑥𝐴 𝑦 = (𝐹𝑥)} = 𝐵 ↔ ∀𝑦𝐵𝑥𝐴 𝑦 = (𝐹𝑥)))
3315, 32bitrd 282 . . 3 (𝐹:𝐴𝐵 → (ran 𝐹 = 𝐵 ↔ ∀𝑦𝐵𝑥𝐴 𝑦 = (𝐹𝑥)))
3433pm5.32i 584 . 2 ((𝐹:𝐴𝐵 ∧ ran 𝐹 = 𝐵) ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥𝐴 𝑦 = (𝐹𝑥)))
351, 34bitri 278 1 (𝐹:𝐴onto𝐵 ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵𝑥𝐴 𝑦 = (𝐹𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wal 1561   = wceq 1563  wcel 2145  {cab 2743  wnfc 2912  wral 3079  wrex 3089  ran crn 5652   Fn wfn 6520  wf 6521  ontowfo 6523  cfv 6525
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5250  ax-nul 5260  ax-pr 5394
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-br 5105  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-fo 6531  df-fv 6533
This theorem is referenced by:  foelrnf  7093  fompt  7103
  Copyright terms: Public domain W3C validator