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 44907
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 44907 verifies https://us.metamath.org/other/completeusersproof/iunconaltvd.html 44907. (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 261 . 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 44906 1 (𝜑 → (𝐽t 𝑘𝐴 𝐵) ∈ Conn)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wcel 2108  wne 2946  cdif 3973  cun 3974  cin 3975  wss 3976  c0 4352   ciun 5015  cfv 6573  (class class class)co 7448  t crest 17480  TopOnctopon 22937  Conncconn 23440
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-1st 8030  df-2nd 8031  df-en 9004  df-fin 9007  df-fi 9480  df-rest 17482  df-topgen 17503  df-top 22921  df-topon 22938  df-bases 22974  df-cld 23048  df-conn 23441
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator