Users' Mathboxes Mathbox for Alan Sare < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iunconnALT Structured version   Visualization version   GIF version

Theorem iunconnALT 43454
Description: The indexed union of connected overlapping subspaces sharing a common point is connected. This proof was automatically derived by completeusersproof from its Virtual Deduction proof counterpart https://us.metamath.org/other/completeusersproof/iunconaltvd.html. As it is verified by the Metamath program, iunconnALT 43454 verifies https://us.metamath.org/other/completeusersproof/iunconaltvd.html 43454. (Contributed by Alan Sare, 22-Apr-2018.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
iunconnALT.1 (πœ‘ β†’ 𝐽 ∈ (TopOnβ€˜π‘‹))
iunconnALT.2 ((πœ‘ ∧ π‘˜ ∈ 𝐴) β†’ 𝐡 βŠ† 𝑋)
iunconnALT.3 ((πœ‘ ∧ π‘˜ ∈ 𝐴) β†’ 𝑃 ∈ 𝐡)
iunconnALT.4 ((πœ‘ ∧ π‘˜ ∈ 𝐴) β†’ (𝐽 β†Ύt 𝐡) ∈ Conn)
Assertion
Ref Expression
iunconnALT (πœ‘ β†’ (𝐽 β†Ύt βˆͺ π‘˜ ∈ 𝐴 𝐡) ∈ Conn)
Distinct variable groups:   πœ‘,π‘˜   𝐴,π‘˜   π‘˜,𝐽   𝑃,π‘˜   π‘˜,𝑋
Allowed substitution hint:   𝐡(π‘˜)

Proof of Theorem iunconnALT
Dummy variables 𝑒 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 biid 260 . 2 (((((((πœ‘ ∧ 𝑒 ∈ 𝐽) ∧ 𝑣 ∈ 𝐽) ∧ (𝑒 ∩ βˆͺ π‘˜ ∈ 𝐴 𝐡) β‰  βˆ…) ∧ (𝑣 ∩ βˆͺ π‘˜ ∈ 𝐴 𝐡) β‰  βˆ…) ∧ (𝑒 ∩ 𝑣) βŠ† (𝑋 βˆ– βˆͺ π‘˜ ∈ 𝐴 𝐡)) ∧ βˆͺ π‘˜ ∈ 𝐴 𝐡 βŠ† (𝑒 βˆͺ 𝑣)) ↔ ((((((πœ‘ ∧ 𝑒 ∈ 𝐽) ∧ 𝑣 ∈ 𝐽) ∧ (𝑒 ∩ βˆͺ π‘˜ ∈ 𝐴 𝐡) β‰  βˆ…) ∧ (𝑣 ∩ βˆͺ π‘˜ ∈ 𝐴 𝐡) β‰  βˆ…) ∧ (𝑒 ∩ 𝑣) βŠ† (𝑋 βˆ– βˆͺ π‘˜ ∈ 𝐴 𝐡)) ∧ βˆͺ π‘˜ ∈ 𝐴 𝐡 βŠ† (𝑒 βˆͺ 𝑣)))
2 iunconnALT.1 . 2 (πœ‘ β†’ 𝐽 ∈ (TopOnβ€˜π‘‹))
3 iunconnALT.2 . 2 ((πœ‘ ∧ π‘˜ ∈ 𝐴) β†’ 𝐡 βŠ† 𝑋)
4 iunconnALT.3 . 2 ((πœ‘ ∧ π‘˜ ∈ 𝐴) β†’ 𝑃 ∈ 𝐡)
5 iunconnALT.4 . 2 ((πœ‘ ∧ π‘˜ ∈ 𝐴) β†’ (𝐽 β†Ύt 𝐡) ∈ Conn)
61, 2, 3, 4, 5iunconnlem2 43453 1 (πœ‘ β†’ (𝐽 β†Ύt βˆͺ π‘˜ ∈ 𝐴 𝐡) ∈ Conn)
Colors of variables: wff setvar class
Syntax hints:   β†’ wi 4   ∧ wa 396   ∈ wcel 2106   β‰  wne 2939   βˆ– cdif 3938   βˆͺ cun 3939   ∩ cin 3940   βŠ† wss 3941  βˆ…c0 4315  βˆͺ ciun 4987  β€˜cfv 6529  (class class class)co 7390   β†Ύt crest 17345  TopOnctopon 22336  Conncconn 22839
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-rep 5275  ax-sep 5289  ax-nul 5296  ax-pow 5353  ax-pr 5417  ax-un 7705
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3376  df-rab 3430  df-v 3472  df-sbc 3771  df-csb 3887  df-dif 3944  df-un 3946  df-in 3948  df-ss 3958  df-pss 3960  df-nul 4316  df-if 4520  df-pw 4595  df-sn 4620  df-pr 4622  df-op 4626  df-uni 4899  df-int 4941  df-iun 4989  df-br 5139  df-opab 5201  df-mpt 5222  df-tr 5256  df-id 5564  df-eprel 5570  df-po 5578  df-so 5579  df-fr 5621  df-we 5623  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-iota 6481  df-fun 6531  df-fn 6532  df-f 6533  df-f1 6534  df-fo 6535  df-f1o 6536  df-fv 6537  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7836  df-1st 7954  df-2nd 7955  df-en 8920  df-fin 8923  df-fi 9385  df-rest 17347  df-topgen 17368  df-top 22320  df-topon 22337  df-bases 22373  df-cld 22447  df-conn 22840
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator