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

Theorem f1iun 7934
Description: The union of a chain (with respect to inclusion) of one-to-one functions is a one-to-one function. (Contributed by Mario Carneiro, 20-May-2013.) (Revised by Mario Carneiro, 24-Jun-2015.) (Proof shortened by AV, 5-Nov-2023.)
Hypotheses
Ref Expression
fiun.1 (𝑥 = 𝑦𝐵 = 𝐶)
fiun.2 𝐵 ∈ V
Assertion
Ref Expression
f1iun (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → 𝑥𝐴 𝐵: 𝑥𝐴 𝐷1-1𝑆)
Distinct variable groups:   𝑥,𝐴,𝑦   𝑦,𝐵   𝑥,𝐶   𝑥,𝑦   𝑥,𝑆
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑦)   𝐷(𝑥,𝑦)   𝑆(𝑦)

Proof of Theorem f1iun
Dummy variables 𝑣 𝑧 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 3477 . . . . . . . . . 10 𝑢 ∈ V
2 eqeq1 2735 . . . . . . . . . . 11 (𝑧 = 𝑢 → (𝑧 = 𝐵𝑢 = 𝐵))
32rexbidv 3177 . . . . . . . . . 10 (𝑧 = 𝑢 → (∃𝑥𝐴 𝑧 = 𝐵 ↔ ∃𝑥𝐴 𝑢 = 𝐵))
41, 3elab 3668 . . . . . . . . 9 (𝑢 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} ↔ ∃𝑥𝐴 𝑢 = 𝐵)
5 r19.29 3113 . . . . . . . . . 10 ((∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) ∧ ∃𝑥𝐴 𝑢 = 𝐵) → ∃𝑥𝐴 ((𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) ∧ 𝑢 = 𝐵))
6 nfv 1916 . . . . . . . . . . . 12 𝑥(Fun 𝑢 ∧ Fun 𝑢)
7 nfre1 3281 . . . . . . . . . . . . . 14 𝑥𝑥𝐴 𝑧 = 𝐵
87nfab 2908 . . . . . . . . . . . . 13 𝑥{𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵}
9 nfv 1916 . . . . . . . . . . . . 13 𝑥(𝑢𝑣𝑣𝑢)
108, 9nfralw 3307 . . . . . . . . . . . 12 𝑥𝑣 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} (𝑢𝑣𝑣𝑢)
116, 10nfan 1901 . . . . . . . . . . 11 𝑥((Fun 𝑢 ∧ Fun 𝑢) ∧ ∀𝑣 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} (𝑢𝑣𝑣𝑢))
12 f1eq1 6782 . . . . . . . . . . . . . . . 16 (𝑢 = 𝐵 → (𝑢:𝐷1-1𝑆𝐵:𝐷1-1𝑆))
1312biimparc 479 . . . . . . . . . . . . . . 15 ((𝐵:𝐷1-1𝑆𝑢 = 𝐵) → 𝑢:𝐷1-1𝑆)
14 df-f1 6548 . . . . . . . . . . . . . . . 16 (𝑢:𝐷1-1𝑆 ↔ (𝑢:𝐷𝑆 ∧ Fun 𝑢))
15 ffun 6720 . . . . . . . . . . . . . . . . 17 (𝑢:𝐷𝑆 → Fun 𝑢)
1615anim1i 614 . . . . . . . . . . . . . . . 16 ((𝑢:𝐷𝑆 ∧ Fun 𝑢) → (Fun 𝑢 ∧ Fun 𝑢))
1714, 16sylbi 216 . . . . . . . . . . . . . . 15 (𝑢:𝐷1-1𝑆 → (Fun 𝑢 ∧ Fun 𝑢))
1813, 17syl 17 . . . . . . . . . . . . . 14 ((𝐵:𝐷1-1𝑆𝑢 = 𝐵) → (Fun 𝑢 ∧ Fun 𝑢))
1918adantlr 712 . . . . . . . . . . . . 13 (((𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) ∧ 𝑢 = 𝐵) → (Fun 𝑢 ∧ Fun 𝑢))
20 f1f 6787 . . . . . . . . . . . . . 14 (𝐵:𝐷1-1𝑆𝐵:𝐷𝑆)
21 fiun.1 . . . . . . . . . . . . . . 15 (𝑥 = 𝑦𝐵 = 𝐶)
2221fiunlem 7932 . . . . . . . . . . . . . 14 (((𝐵:𝐷𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) ∧ 𝑢 = 𝐵) → ∀𝑣 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} (𝑢𝑣𝑣𝑢))
2320, 22sylanl1 677 . . . . . . . . . . . . 13 (((𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) ∧ 𝑢 = 𝐵) → ∀𝑣 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} (𝑢𝑣𝑣𝑢))
2419, 23jca 511 . . . . . . . . . . . 12 (((𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) ∧ 𝑢 = 𝐵) → ((Fun 𝑢 ∧ Fun 𝑢) ∧ ∀𝑣 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} (𝑢𝑣𝑣𝑢)))
2524a1i 11 . . . . . . . . . . 11 (𝑥𝐴 → (((𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) ∧ 𝑢 = 𝐵) → ((Fun 𝑢 ∧ Fun 𝑢) ∧ ∀𝑣 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} (𝑢𝑣𝑣𝑢))))
2611, 25rexlimi 3255 . . . . . . . . . 10 (∃𝑥𝐴 ((𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) ∧ 𝑢 = 𝐵) → ((Fun 𝑢 ∧ Fun 𝑢) ∧ ∀𝑣 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} (𝑢𝑣𝑣𝑢)))
275, 26syl 17 . . . . . . . . 9 ((∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) ∧ ∃𝑥𝐴 𝑢 = 𝐵) → ((Fun 𝑢 ∧ Fun 𝑢) ∧ ∀𝑣 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} (𝑢𝑣𝑣𝑢)))
284, 27sylan2b 593 . . . . . . . 8 ((∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) ∧ 𝑢 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵}) → ((Fun 𝑢 ∧ Fun 𝑢) ∧ ∀𝑣 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} (𝑢𝑣𝑣𝑢)))
2928ralrimiva 3145 . . . . . . 7 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → ∀𝑢 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} ((Fun 𝑢 ∧ Fun 𝑢) ∧ ∀𝑣 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} (𝑢𝑣𝑣𝑢)))
30 fun11uni 7927 . . . . . . 7 (∀𝑢 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} ((Fun 𝑢 ∧ Fun 𝑢) ∧ ∀𝑣 ∈ {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} (𝑢𝑣𝑣𝑢)) → (Fun {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} ∧ Fun {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵}))
3129, 30syl 17 . . . . . 6 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → (Fun {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵} ∧ Fun {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵}))
3231simpld 494 . . . . 5 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → Fun {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵})
33 fiun.2 . . . . . . 7 𝐵 ∈ V
3433dfiun2 5036 . . . . . 6 𝑥𝐴 𝐵 = {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵}
3534funeqi 6569 . . . . 5 (Fun 𝑥𝐴 𝐵 ↔ Fun {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵})
3632, 35sylibr 233 . . . 4 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → Fun 𝑥𝐴 𝐵)
371eldm2 5901 . . . . . . . . 9 (𝑢 ∈ dom 𝐵 ↔ ∃𝑣𝑢, 𝑣⟩ ∈ 𝐵)
38 f1dm 6791 . . . . . . . . . 10 (𝐵:𝐷1-1𝑆 → dom 𝐵 = 𝐷)
3938eleq2d 2818 . . . . . . . . 9 (𝐵:𝐷1-1𝑆 → (𝑢 ∈ dom 𝐵𝑢𝐷))
4037, 39bitr3id 285 . . . . . . . 8 (𝐵:𝐷1-1𝑆 → (∃𝑣𝑢, 𝑣⟩ ∈ 𝐵𝑢𝐷))
4140adantr 480 . . . . . . 7 ((𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → (∃𝑣𝑢, 𝑣⟩ ∈ 𝐵𝑢𝐷))
4241ralrexbid 3105 . . . . . 6 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → (∃𝑥𝐴𝑣𝑢, 𝑣⟩ ∈ 𝐵 ↔ ∃𝑥𝐴 𝑢𝐷))
43 eliun 5001 . . . . . . . 8 (⟨𝑢, 𝑣⟩ ∈ 𝑥𝐴 𝐵 ↔ ∃𝑥𝐴𝑢, 𝑣⟩ ∈ 𝐵)
4443exbii 1849 . . . . . . 7 (∃𝑣𝑢, 𝑣⟩ ∈ 𝑥𝐴 𝐵 ↔ ∃𝑣𝑥𝐴𝑢, 𝑣⟩ ∈ 𝐵)
451eldm2 5901 . . . . . . 7 (𝑢 ∈ dom 𝑥𝐴 𝐵 ↔ ∃𝑣𝑢, 𝑣⟩ ∈ 𝑥𝐴 𝐵)
46 rexcom4 3284 . . . . . . 7 (∃𝑥𝐴𝑣𝑢, 𝑣⟩ ∈ 𝐵 ↔ ∃𝑣𝑥𝐴𝑢, 𝑣⟩ ∈ 𝐵)
4744, 45, 463bitr4i 303 . . . . . 6 (𝑢 ∈ dom 𝑥𝐴 𝐵 ↔ ∃𝑥𝐴𝑣𝑢, 𝑣⟩ ∈ 𝐵)
48 eliun 5001 . . . . . 6 (𝑢 𝑥𝐴 𝐷 ↔ ∃𝑥𝐴 𝑢𝐷)
4942, 47, 483bitr4g 314 . . . . 5 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → (𝑢 ∈ dom 𝑥𝐴 𝐵𝑢 𝑥𝐴 𝐷))
5049eqrdv 2729 . . . 4 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → dom 𝑥𝐴 𝐵 = 𝑥𝐴 𝐷)
51 df-fn 6546 . . . 4 ( 𝑥𝐴 𝐵 Fn 𝑥𝐴 𝐷 ↔ (Fun 𝑥𝐴 𝐵 ∧ dom 𝑥𝐴 𝐵 = 𝑥𝐴 𝐷))
5236, 50, 51sylanbrc 582 . . 3 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → 𝑥𝐴 𝐵 Fn 𝑥𝐴 𝐷)
53 rniun 6147 . . . 4 ran 𝑥𝐴 𝐵 = 𝑥𝐴 ran 𝐵
5420frnd 6725 . . . . . . 7 (𝐵:𝐷1-1𝑆 → ran 𝐵𝑆)
5554adantr 480 . . . . . 6 ((𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → ran 𝐵𝑆)
5655ralimi 3082 . . . . 5 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → ∀𝑥𝐴 ran 𝐵𝑆)
57 iunss 5048 . . . . 5 ( 𝑥𝐴 ran 𝐵𝑆 ↔ ∀𝑥𝐴 ran 𝐵𝑆)
5856, 57sylibr 233 . . . 4 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → 𝑥𝐴 ran 𝐵𝑆)
5953, 58eqsstrid 4030 . . 3 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → ran 𝑥𝐴 𝐵𝑆)
60 df-f 6547 . . 3 ( 𝑥𝐴 𝐵: 𝑥𝐴 𝐷𝑆 ↔ ( 𝑥𝐴 𝐵 Fn 𝑥𝐴 𝐷 ∧ ran 𝑥𝐴 𝐵𝑆))
6152, 59, 60sylanbrc 582 . 2 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → 𝑥𝐴 𝐵: 𝑥𝐴 𝐷𝑆)
6231simprd 495 . . 3 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → Fun {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵})
6334cnveqi 5874 . . . 4 𝑥𝐴 𝐵 = {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵}
6463funeqi 6569 . . 3 (Fun 𝑥𝐴 𝐵 ↔ Fun {𝑧 ∣ ∃𝑥𝐴 𝑧 = 𝐵})
6562, 64sylibr 233 . 2 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → Fun 𝑥𝐴 𝐵)
66 df-f1 6548 . 2 ( 𝑥𝐴 𝐵: 𝑥𝐴 𝐷1-1𝑆 ↔ ( 𝑥𝐴 𝐵: 𝑥𝐴 𝐷𝑆 ∧ Fun 𝑥𝐴 𝐵))
6761, 65, 66sylanbrc 582 1 (∀𝑥𝐴 (𝐵:𝐷1-1𝑆 ∧ ∀𝑦𝐴 (𝐵𝐶𝐶𝐵)) → 𝑥𝐴 𝐵: 𝑥𝐴 𝐷1-1𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  wo 844   = wceq 1540  wex 1780  wcel 2105  {cab 2708  wral 3060  wrex 3069  Vcvv 3473  wss 3948  cop 4634   cuni 4908   ciun 4997  ccnv 5675  dom cdm 5676  ran crn 5677  Fun wfun 6537   Fn wfn 6538  wf 6539  1-1wf1 6540
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-pow 5363  ax-pr 5427  ax-un 7729
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-nfc 2884  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-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548
This theorem is referenced by:  ackbij2  10244
  Copyright terms: Public domain W3C validator