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

Theorem fompt 7145
Description: Express being onto for a mapping operation. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
Hypothesis
Ref Expression
fompt.1 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
Assertion
Ref Expression
fompt (𝐹:𝐴⟶onto𝐵 ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑦,𝐶   𝑦,𝐹
Allowed substitution hints:   𝐶(𝑥)   𝐹(𝑥)

Proof of Theorem fompt
StepHypRef Expression
1 fof 6821 . . . 4 (𝐹:𝐴⟶onto𝐵 → 𝐹:𝐴⟶𝐵)
2 fompt.1 . . . . 5 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
32fmpt 7137 . . . 4 (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ↔ 𝐹:𝐴⟶𝐵)
41, 3sylibr 237 . . 3 (𝐹:𝐴⟶onto𝐵 → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵)
5 nfmpt1 5208 . . . . . . 7 Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐶)
62, 5nfcxfr 2924 . . . . . 6 Ⅎ𝑥𝐹
76foelrnf 7135 . . . . 5 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
8 nfcv 2926 . . . . . . . 8 Ⅎ𝑥𝐴
9 nfcv 2926 . . . . . . . 8 Ⅎ𝑥𝐵
106, 8, 9nffo 6820 . . . . . . 7 Ⅎ𝑥 𝐹:𝐴⟶onto𝐵
11 simpr 490 . . . . . . . . 9 (((𝐹:𝐴⟶onto𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → 𝑦 = (𝐹‘𝑥))
12 simpr 490 . . . . . . . . . . 11 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
134r19.21bi 3258 . . . . . . . . . . 11 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝐵)
142fvmpt2 7031 . . . . . . . . . . 11 ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝑥) = 𝐶)
1512, 13, 14syl2anc 596 . . . . . . . . . 10 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐶)
1615adantr 486 . . . . . . . . 9 (((𝐹:𝐴⟶onto𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → (𝐹‘𝑥) = 𝐶)
1711, 16eqtrd 2798 . . . . . . . 8 (((𝐹:𝐴⟶onto𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → 𝑦 = 𝐶)
1817exp31 425 . . . . . . 7 (𝐹:𝐴⟶onto𝐵 → (𝑥 ∈ 𝐴 → (𝑦 = (𝐹‘𝑥) → 𝑦 = 𝐶)))
1910, 18reximdai 3268 . . . . . 6 (𝐹:𝐴⟶onto𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))
2019adantr 486 . . . . 5 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑦 ∈ 𝐵) → (∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))
217, 20mpd 16 . . . 4 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
2221ralrimiva 3158 . . 3 (𝐹:𝐴⟶onto𝐵 → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
234, 22jca 521 . 2 (𝐹:𝐴⟶onto𝐵 → (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))
243birani 509 . . 3 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) → 𝐹:𝐴⟶𝐵)
25 nfv 1949 . . . . 5 Ⅎ𝑦∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵
26 nfra1 3290 . . . . 5 Ⅎ𝑦∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶
2725, 26nfan 1934 . . . 4 Ⅎ𝑦(∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
28 simpll 779 . . . . 5 (((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) ∧ 𝑦 ∈ 𝐵) → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵)
29 rspa 3255 . . . . . 6 ((∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
3029adantll 727 . . . . 5 (((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
31 nfra1 3290 . . . . . 6 Ⅎ𝑥∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵
32 simp3 1156 . . . . . . . 8 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → 𝑦 = 𝐶)
33 simpr 490 . . . . . . . . . . 11 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
34 rspa 3255 . . . . . . . . . . 11 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝐵)
3533, 34, 14syl2anc 596 . . . . . . . . . 10 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐶)
3635eqcomd 2769 . . . . . . . . 9 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝐶 = (𝐹‘𝑥))
37363adant3 1150 . . . . . . . 8 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → 𝐶 = (𝐹‘𝑥))
3832, 37eqtrd 2798 . . . . . . 7 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → 𝑦 = (𝐹‘𝑥))
39383exp 1137 . . . . . 6 (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 → (𝑥 ∈ 𝐴 → (𝑦 = 𝐶 → 𝑦 = (𝐹‘𝑥))))
4031, 39reximdai 3268 . . . . 5 (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐶 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))
4128, 30, 40sylc 66 . . . 4 (((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
4227, 41ralrimia 3265 . . 3 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
436dffo3f 7133 . . 3 (𝐹:𝐴⟶onto𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))
4424, 42, 43sylanbrc 595 . 2 ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) → 𝐹:𝐴⟶onto𝐵)
4523, 44impbii 212 1 (𝐹:𝐴⟶onto𝐵 ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ↦ cmpt 5190  ⟶wf 6557  ⟶ontowfo 6559  ‘cfv 6561
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pr 5396
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-fo 6567  df-fv 6569
This theorem is used by:  zringfrac  34169  algextdeglem8  34439  disjinfi  46422
  Copyright terms: Public domain W3C validator