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

Theorem funcnvuni 7937
Description: The union of a chain (with respect to inclusion) of single-rooted sets is single-rooted. (See funcnv 6617 for "single-rooted" definition.) (Contributed by NM, 11-Aug-2004.)
Assertion
Ref Expression
funcnvuni (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → Fun 𝐴)
Distinct variable group:   𝑓,𝑔,𝐴

Proof of Theorem funcnvuni
Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnveq 5870 . . . . . . . 8 (𝑥 = 𝑣𝑥 = 𝑣)
21eqeq2d 2736 . . . . . . 7 (𝑥 = 𝑣 → (𝑧 = 𝑥𝑧 = 𝑣))
32cbvrexvw 3226 . . . . . 6 (∃𝑥𝐴 𝑧 = 𝑥 ↔ ∃𝑣𝐴 𝑧 = 𝑣)
4 cnveq 5870 . . . . . . . . . . 11 (𝑓 = 𝑣𝑓 = 𝑣)
54funeqd 6570 . . . . . . . . . 10 (𝑓 = 𝑣 → (Fun 𝑓 ↔ Fun 𝑣))
6 sseq1 3998 . . . . . . . . . . . 12 (𝑓 = 𝑣 → (𝑓𝑔𝑣𝑔))
7 sseq2 3999 . . . . . . . . . . . 12 (𝑓 = 𝑣 → (𝑔𝑓𝑔𝑣))
86, 7orbi12d 916 . . . . . . . . . . 11 (𝑓 = 𝑣 → ((𝑓𝑔𝑔𝑓) ↔ (𝑣𝑔𝑔𝑣)))
98ralbidv 3168 . . . . . . . . . 10 (𝑓 = 𝑣 → (∀𝑔𝐴 (𝑓𝑔𝑔𝑓) ↔ ∀𝑔𝐴 (𝑣𝑔𝑔𝑣)))
105, 9anbi12d 630 . . . . . . . . 9 (𝑓 = 𝑣 → ((Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) ↔ (Fun 𝑣 ∧ ∀𝑔𝐴 (𝑣𝑔𝑔𝑣))))
1110rspcv 3597 . . . . . . . 8 (𝑣𝐴 → (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → (Fun 𝑣 ∧ ∀𝑔𝐴 (𝑣𝑔𝑔𝑣))))
12 funeq 6568 . . . . . . . . . 10 (𝑧 = 𝑣 → (Fun 𝑧 ↔ Fun 𝑣))
1312biimprcd 249 . . . . . . . . 9 (Fun 𝑣 → (𝑧 = 𝑣 → Fun 𝑧))
14 sseq2 3999 . . . . . . . . . . . . . . 15 (𝑔 = 𝑥 → (𝑣𝑔𝑣𝑥))
15 sseq1 3998 . . . . . . . . . . . . . . 15 (𝑔 = 𝑥 → (𝑔𝑣𝑥𝑣))
1614, 15orbi12d 916 . . . . . . . . . . . . . 14 (𝑔 = 𝑥 → ((𝑣𝑔𝑔𝑣) ↔ (𝑣𝑥𝑥𝑣)))
1716rspcv 3597 . . . . . . . . . . . . 13 (𝑥𝐴 → (∀𝑔𝐴 (𝑣𝑔𝑔𝑣) → (𝑣𝑥𝑥𝑣)))
18 cnvss 5869 . . . . . . . . . . . . . . . 16 (𝑣𝑥𝑣𝑥)
19 cnvss 5869 . . . . . . . . . . . . . . . 16 (𝑥𝑣𝑥𝑣)
2018, 19orim12i 906 . . . . . . . . . . . . . . 15 ((𝑣𝑥𝑥𝑣) → (𝑣𝑥𝑥𝑣))
21 sseq12 4000 . . . . . . . . . . . . . . . . 17 ((𝑧 = 𝑣𝑤 = 𝑥) → (𝑧𝑤𝑣𝑥))
2221ancoms 457 . . . . . . . . . . . . . . . 16 ((𝑤 = 𝑥𝑧 = 𝑣) → (𝑧𝑤𝑣𝑥))
23 sseq12 4000 . . . . . . . . . . . . . . . 16 ((𝑤 = 𝑥𝑧 = 𝑣) → (𝑤𝑧𝑥𝑣))
2422, 23orbi12d 916 . . . . . . . . . . . . . . 15 ((𝑤 = 𝑥𝑧 = 𝑣) → ((𝑧𝑤𝑤𝑧) ↔ (𝑣𝑥𝑥𝑣)))
2520, 24syl5ibrcom 246 . . . . . . . . . . . . . 14 ((𝑣𝑥𝑥𝑣) → ((𝑤 = 𝑥𝑧 = 𝑣) → (𝑧𝑤𝑤𝑧)))
2625expd 414 . . . . . . . . . . . . 13 ((𝑣𝑥𝑥𝑣) → (𝑤 = 𝑥 → (𝑧 = 𝑣 → (𝑧𝑤𝑤𝑧))))
2717, 26syl6com 37 . . . . . . . . . . . 12 (∀𝑔𝐴 (𝑣𝑔𝑔𝑣) → (𝑥𝐴 → (𝑤 = 𝑥 → (𝑧 = 𝑣 → (𝑧𝑤𝑤𝑧)))))
2827rexlimdv 3143 . . . . . . . . . . 11 (∀𝑔𝐴 (𝑣𝑔𝑔𝑣) → (∃𝑥𝐴 𝑤 = 𝑥 → (𝑧 = 𝑣 → (𝑧𝑤𝑤𝑧))))
2928com23 86 . . . . . . . . . 10 (∀𝑔𝐴 (𝑣𝑔𝑔𝑣) → (𝑧 = 𝑣 → (∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧))))
3029alrimdv 1924 . . . . . . . . 9 (∀𝑔𝐴 (𝑣𝑔𝑔𝑣) → (𝑧 = 𝑣 → ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧))))
3113, 30anim12ii 616 . . . . . . . 8 ((Fun 𝑣 ∧ ∀𝑔𝐴 (𝑣𝑔𝑔𝑣)) → (𝑧 = 𝑣 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))))
3211, 31syl6com 37 . . . . . . 7 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → (𝑣𝐴 → (𝑧 = 𝑣 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧))))))
3332rexlimdv 3143 . . . . . 6 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → (∃𝑣𝐴 𝑧 = 𝑣 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))))
343, 33biimtrid 241 . . . . 5 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → (∃𝑥𝐴 𝑧 = 𝑥 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))))
3534alrimiv 1922 . . . 4 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → ∀𝑧(∃𝑥𝐴 𝑧 = 𝑥 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))))
36 df-ral 3052 . . . . 5 (∀𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧)) ↔ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} → (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧))))
37 vex 3467 . . . . . . . 8 𝑧 ∈ V
38 eqeq1 2729 . . . . . . . . 9 (𝑦 = 𝑧 → (𝑦 = 𝑥𝑧 = 𝑥))
3938rexbidv 3169 . . . . . . . 8 (𝑦 = 𝑧 → (∃𝑥𝐴 𝑦 = 𝑥 ↔ ∃𝑥𝐴 𝑧 = 𝑥))
4037, 39elab 3659 . . . . . . 7 (𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} ↔ ∃𝑥𝐴 𝑧 = 𝑥)
41 eqeq1 2729 . . . . . . . . . 10 (𝑦 = 𝑤 → (𝑦 = 𝑥𝑤 = 𝑥))
4241rexbidv 3169 . . . . . . . . 9 (𝑦 = 𝑤 → (∃𝑥𝐴 𝑦 = 𝑥 ↔ ∃𝑥𝐴 𝑤 = 𝑥))
4342ralab 3678 . . . . . . . 8 (∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧) ↔ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))
4443anbi2i 621 . . . . . . 7 ((Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧)) ↔ (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧))))
4540, 44imbi12i 349 . . . . . 6 ((𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} → (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧))) ↔ (∃𝑥𝐴 𝑧 = 𝑥 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))))
4645albii 1813 . . . . 5 (∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} → (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧))) ↔ ∀𝑧(∃𝑥𝐴 𝑧 = 𝑥 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))))
4736, 46bitr2i 275 . . . 4 (∀𝑧(∃𝑥𝐴 𝑧 = 𝑥 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))) ↔ ∀𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧)))
4835, 47sylib 217 . . 3 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → ∀𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧)))
49 fununi 6623 . . 3 (∀𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧)) → Fun {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥})
5048, 49syl 17 . 2 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → Fun {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥})
51 cnvuni 5883 . . . 4 𝐴 = 𝑥𝐴 𝑥
52 vex 3467 . . . . . 6 𝑥 ∈ V
5352cnvex 7931 . . . . 5 𝑥 ∈ V
5453dfiun2 5031 . . . 4 𝑥𝐴 𝑥 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥}
5551, 54eqtri 2753 . . 3 𝐴 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥}
5655funeqi 6569 . 2 (Fun 𝐴 ↔ Fun {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥})
5750, 56sylibr 233 1 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → Fun 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  wo 845  wal 1531   = wceq 1533  wcel 2098  {cab 2702  wral 3051  wrex 3060  wss 3939   cuni 4903   ciun 4991  ccnv 5671  Fun wfun 6537
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-sep 5294  ax-nul 5301  ax-pow 5359  ax-pr 5423  ax-un 7738
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ral 3052  df-rex 3061  df-rab 3420  df-v 3465  df-dif 3942  df-un 3944  df-in 3946  df-ss 3956  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-iun 4993  df-br 5144  df-opab 5206  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-fun 6545
This theorem is referenced by:  fun11uni  7938
  Copyright terms: Public domain W3C validator