ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  funcnvuni GIF version

Theorem funcnvuni 4995
Description: The union of a chain (with respect to inclusion) of single-rooted sets is single-rooted. (See funcnv 4987 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 4536 . . . . . . . 8 (𝑥 = 𝑣𝑥 = 𝑣)
21eqeq2d 2067 . . . . . . 7 (𝑥 = 𝑣 → (𝑧 = 𝑥𝑧 = 𝑣))
32cbvrexv 2551 . . . . . 6 (∃𝑥𝐴 𝑧 = 𝑥 ↔ ∃𝑣𝐴 𝑧 = 𝑣)
4 cnveq 4536 . . . . . . . . . . 11 (𝑓 = 𝑣𝑓 = 𝑣)
54funeqd 4950 . . . . . . . . . 10 (𝑓 = 𝑣 → (Fun 𝑓 ↔ Fun 𝑣))
6 sseq1 2993 . . . . . . . . . . . 12 (𝑓 = 𝑣 → (𝑓𝑔𝑣𝑔))
7 sseq2 2994 . . . . . . . . . . . 12 (𝑓 = 𝑣 → (𝑔𝑓𝑔𝑣))
86, 7orbi12d 717 . . . . . . . . . . 11 (𝑓 = 𝑣 → ((𝑓𝑔𝑔𝑓) ↔ (𝑣𝑔𝑔𝑣)))
98ralbidv 2343 . . . . . . . . . 10 (𝑓 = 𝑣 → (∀𝑔𝐴 (𝑓𝑔𝑔𝑓) ↔ ∀𝑔𝐴 (𝑣𝑔𝑔𝑣)))
105, 9anbi12d 450 . . . . . . . . 9 (𝑓 = 𝑣 → ((Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) ↔ (Fun 𝑣 ∧ ∀𝑔𝐴 (𝑣𝑔𝑔𝑣))))
1110rspcv 2669 . . . . . . . 8 (𝑣𝐴 → (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → (Fun 𝑣 ∧ ∀𝑔𝐴 (𝑣𝑔𝑔𝑣))))
12 funeq 4948 . . . . . . . . . 10 (𝑧 = 𝑣 → (Fun 𝑧 ↔ Fun 𝑣))
1312biimprcd 153 . . . . . . . . 9 (Fun 𝑣 → (𝑧 = 𝑣 → Fun 𝑧))
14 sseq2 2994 . . . . . . . . . . . . . . 15 (𝑔 = 𝑥 → (𝑣𝑔𝑣𝑥))
15 sseq1 2993 . . . . . . . . . . . . . . 15 (𝑔 = 𝑥 → (𝑔𝑣𝑥𝑣))
1614, 15orbi12d 717 . . . . . . . . . . . . . 14 (𝑔 = 𝑥 → ((𝑣𝑔𝑔𝑣) ↔ (𝑣𝑥𝑥𝑣)))
1716rspcv 2669 . . . . . . . . . . . . 13 (𝑥𝐴 → (∀𝑔𝐴 (𝑣𝑔𝑔𝑣) → (𝑣𝑥𝑥𝑣)))
18 cnvss 4535 . . . . . . . . . . . . . . . 16 (𝑣𝑥𝑣𝑥)
19 cnvss 4535 . . . . . . . . . . . . . . . 16 (𝑥𝑣𝑥𝑣)
2018, 19orim12i 686 . . . . . . . . . . . . . . 15 ((𝑣𝑥𝑥𝑣) → (𝑣𝑥𝑥𝑣))
21 sseq12 2995 . . . . . . . . . . . . . . . . 17 ((𝑧 = 𝑣𝑤 = 𝑥) → (𝑧𝑤𝑣𝑥))
2221ancoms 259 . . . . . . . . . . . . . . . 16 ((𝑤 = 𝑥𝑧 = 𝑣) → (𝑧𝑤𝑣𝑥))
23 sseq12 2995 . . . . . . . . . . . . . . . 16 ((𝑤 = 𝑥𝑧 = 𝑣) → (𝑤𝑧𝑥𝑣))
2422, 23orbi12d 717 . . . . . . . . . . . . . . 15 ((𝑤 = 𝑥𝑧 = 𝑣) → ((𝑧𝑤𝑤𝑧) ↔ (𝑣𝑥𝑥𝑣)))
2520, 24syl5ibrcom 150 . . . . . . . . . . . . . 14 ((𝑣𝑥𝑥𝑣) → ((𝑤 = 𝑥𝑧 = 𝑣) → (𝑧𝑤𝑤𝑧)))
2625expd 249 . . . . . . . . . . . . 13 ((𝑣𝑥𝑥𝑣) → (𝑤 = 𝑥 → (𝑧 = 𝑣 → (𝑧𝑤𝑤𝑧))))
2717, 26syl6com 35 . . . . . . . . . . . 12 (∀𝑔𝐴 (𝑣𝑔𝑔𝑣) → (𝑥𝐴 → (𝑤 = 𝑥 → (𝑧 = 𝑣 → (𝑧𝑤𝑤𝑧)))))
2827rexlimdv 2449 . . . . . . . . . . 11 (∀𝑔𝐴 (𝑣𝑔𝑔𝑣) → (∃𝑥𝐴 𝑤 = 𝑥 → (𝑧 = 𝑣 → (𝑧𝑤𝑤𝑧))))
2928com23 76 . . . . . . . . . 10 (∀𝑔𝐴 (𝑣𝑔𝑔𝑣) → (𝑧 = 𝑣 → (∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧))))
3029alrimdv 1772 . . . . . . . . 9 (∀𝑔𝐴 (𝑣𝑔𝑔𝑣) → (𝑧 = 𝑣 → ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧))))
3113, 30anim12ii 329 . . . . . . . 8 ((Fun 𝑣 ∧ ∀𝑔𝐴 (𝑣𝑔𝑔𝑣)) → (𝑧 = 𝑣 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))))
3211, 31syl6com 35 . . . . . . 7 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → (𝑣𝐴 → (𝑧 = 𝑣 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧))))))
3332rexlimdv 2449 . . . . . 6 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → (∃𝑣𝐴 𝑧 = 𝑣 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))))
343, 33syl5bi 145 . . . . 5 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → (∃𝑥𝐴 𝑧 = 𝑥 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))))
3534alrimiv 1770 . . . 4 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → ∀𝑧(∃𝑥𝐴 𝑧 = 𝑥 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))))
36 df-ral 2328 . . . . 5 (∀𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧)) ↔ ∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} → (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧))))
37 vex 2577 . . . . . . . 8 𝑧 ∈ V
38 eqeq1 2062 . . . . . . . . 9 (𝑦 = 𝑧 → (𝑦 = 𝑥𝑧 = 𝑥))
3938rexbidv 2344 . . . . . . . 8 (𝑦 = 𝑧 → (∃𝑥𝐴 𝑦 = 𝑥 ↔ ∃𝑥𝐴 𝑧 = 𝑥))
4037, 39elab 2709 . . . . . . 7 (𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} ↔ ∃𝑥𝐴 𝑧 = 𝑥)
41 eqeq1 2062 . . . . . . . . . 10 (𝑦 = 𝑤 → (𝑦 = 𝑥𝑤 = 𝑥))
4241rexbidv 2344 . . . . . . . . 9 (𝑦 = 𝑤 → (∃𝑥𝐴 𝑦 = 𝑥 ↔ ∃𝑥𝐴 𝑤 = 𝑥))
4342ralab 2723 . . . . . . . 8 (∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧) ↔ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))
4443anbi2i 438 . . . . . . 7 ((Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧)) ↔ (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧))))
4540, 44imbi12i 232 . . . . . 6 ((𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} → (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧))) ↔ (∃𝑥𝐴 𝑧 = 𝑥 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))))
4645albii 1375 . . . . 5 (∀𝑧(𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} → (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧))) ↔ ∀𝑧(∃𝑥𝐴 𝑧 = 𝑥 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))))
4736, 46bitr2i 178 . . . 4 (∀𝑧(∃𝑥𝐴 𝑧 = 𝑥 → (Fun 𝑧 ∧ ∀𝑤(∃𝑥𝐴 𝑤 = 𝑥 → (𝑧𝑤𝑤𝑧)))) ↔ ∀𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧)))
4835, 47sylib 131 . . 3 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → ∀𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧)))
49 fununi 4994 . . 3 (∀𝑧 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (Fun 𝑧 ∧ ∀𝑤 ∈ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥} (𝑧𝑤𝑤𝑧)) → Fun {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥})
5048, 49syl 14 . 2 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → Fun {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥})
51 cnvuni 4548 . . . 4 𝐴 = 𝑥𝐴 𝑥
52 vex 2577 . . . . . 6 𝑥 ∈ V
5352cnvex 4883 . . . . 5 𝑥 ∈ V
5453dfiun2 3718 . . . 4 𝑥𝐴 𝑥 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥}
5551, 54eqtri 2076 . . 3 𝐴 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥}
5655funeqi 4949 . 2 (Fun 𝐴 ↔ Fun {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝑥})
5750, 56sylibr 141 1 (∀𝑓𝐴 (Fun 𝑓 ∧ ∀𝑔𝐴 (𝑓𝑔𝑔𝑓)) → Fun 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101  wb 102  wo 639  wal 1257   = wceq 1259  wcel 1409  {cab 2042  wral 2323  wrex 2324  wss 2944   cuni 3607   ciun 3684  ccnv 4371  Fun wfun 4923
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3902  ax-pow 3954  ax-pr 3971  ax-un 4197
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-v 2576  df-un 2949  df-in 2951  df-ss 2958  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-iun 3686  df-br 3792  df-opab 3846  df-id 4057  df-xp 4378  df-rel 4379  df-cnv 4380  df-co 4381  df-dm 4382  df-rn 4383  df-fun 4931
This theorem is referenced by:  fun11uni  4996
  Copyright terms: Public domain W3C validator