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

Theorem unconn 21434
 Description: The union of two connected overlapping subspaces is connected. (Contributed by FL, 29-May-2014.) (Proof shortened by Mario Carneiro, 11-Jun-2014.)
Assertion
Ref Expression
unconn ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐴𝐵) ≠ ∅) → (((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn) → (𝐽t (𝐴𝐵)) ∈ Conn))

Proof of Theorem unconn
Dummy variables 𝑥 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 n0 4074 . . 3 ((𝐴𝐵) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝐴𝐵))
2 uniiun 4725 . . . . . . . . 9 {𝐴, 𝐵} = 𝑘 ∈ {𝐴, 𝐵}𝑘
3 simpl1 1228 . . . . . . . . . . . 12 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → 𝐽 ∈ (TopOn‘𝑋))
4 toponmax 20932 . . . . . . . . . . . 12 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
53, 4syl 17 . . . . . . . . . . 11 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → 𝑋𝐽)
6 simpl2l 1283 . . . . . . . . . . 11 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → 𝐴𝑋)
75, 6ssexd 4957 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → 𝐴 ∈ V)
8 simpl2r 1285 . . . . . . . . . . 11 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → 𝐵𝑋)
95, 8ssexd 4957 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → 𝐵 ∈ V)
10 uniprg 4602 . . . . . . . . . 10 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {𝐴, 𝐵} = (𝐴𝐵))
117, 9, 10syl2anc 696 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → {𝐴, 𝐵} = (𝐴𝐵))
122, 11syl5eqr 2808 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → 𝑘 ∈ {𝐴, 𝐵}𝑘 = (𝐴𝐵))
1312oveq2d 6829 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → (𝐽t 𝑘 ∈ {𝐴, 𝐵}𝑘) = (𝐽t (𝐴𝐵)))
14 vex 3343 . . . . . . . . . 10 𝑘 ∈ V
1514elpr 4343 . . . . . . . . 9 (𝑘 ∈ {𝐴, 𝐵} ↔ (𝑘 = 𝐴𝑘 = 𝐵))
16 simpl2 1230 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → (𝐴𝑋𝐵𝑋))
17 sseq1 3767 . . . . . . . . . . . 12 (𝑘 = 𝐴 → (𝑘𝑋𝐴𝑋))
1817biimprd 238 . . . . . . . . . . 11 (𝑘 = 𝐴 → (𝐴𝑋𝑘𝑋))
19 sseq1 3767 . . . . . . . . . . . 12 (𝑘 = 𝐵 → (𝑘𝑋𝐵𝑋))
2019biimprd 238 . . . . . . . . . . 11 (𝑘 = 𝐵 → (𝐵𝑋𝑘𝑋))
2118, 20jaoa 533 . . . . . . . . . 10 ((𝑘 = 𝐴𝑘 = 𝐵) → ((𝐴𝑋𝐵𝑋) → 𝑘𝑋))
2216, 21mpan9 487 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) ∧ (𝑘 = 𝐴𝑘 = 𝐵)) → 𝑘𝑋)
2315, 22sylan2b 493 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) ∧ 𝑘 ∈ {𝐴, 𝐵}) → 𝑘𝑋)
24 simpl3 1232 . . . . . . . . . . 11 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → 𝑥 ∈ (𝐴𝐵))
25 elin 3939 . . . . . . . . . . 11 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
2624, 25sylib 208 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → (𝑥𝐴𝑥𝐵))
27 eleq2 2828 . . . . . . . . . . . 12 (𝑘 = 𝐴 → (𝑥𝑘𝑥𝐴))
2827biimprd 238 . . . . . . . . . . 11 (𝑘 = 𝐴 → (𝑥𝐴𝑥𝑘))
29 eleq2 2828 . . . . . . . . . . . 12 (𝑘 = 𝐵 → (𝑥𝑘𝑥𝐵))
3029biimprd 238 . . . . . . . . . . 11 (𝑘 = 𝐵 → (𝑥𝐵𝑥𝑘))
3128, 30jaoa 533 . . . . . . . . . 10 ((𝑘 = 𝐴𝑘 = 𝐵) → ((𝑥𝐴𝑥𝐵) → 𝑥𝑘))
3226, 31mpan9 487 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) ∧ (𝑘 = 𝐴𝑘 = 𝐵)) → 𝑥𝑘)
3315, 32sylan2b 493 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) ∧ 𝑘 ∈ {𝐴, 𝐵}) → 𝑥𝑘)
34 simpr 479 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn))
35 oveq2 6821 . . . . . . . . . . . . 13 (𝑘 = 𝐴 → (𝐽t 𝑘) = (𝐽t 𝐴))
3635eleq1d 2824 . . . . . . . . . . . 12 (𝑘 = 𝐴 → ((𝐽t 𝑘) ∈ Conn ↔ (𝐽t 𝐴) ∈ Conn))
3736biimprd 238 . . . . . . . . . . 11 (𝑘 = 𝐴 → ((𝐽t 𝐴) ∈ Conn → (𝐽t 𝑘) ∈ Conn))
38 oveq2 6821 . . . . . . . . . . . . 13 (𝑘 = 𝐵 → (𝐽t 𝑘) = (𝐽t 𝐵))
3938eleq1d 2824 . . . . . . . . . . . 12 (𝑘 = 𝐵 → ((𝐽t 𝑘) ∈ Conn ↔ (𝐽t 𝐵) ∈ Conn))
4039biimprd 238 . . . . . . . . . . 11 (𝑘 = 𝐵 → ((𝐽t 𝐵) ∈ Conn → (𝐽t 𝑘) ∈ Conn))
4137, 40jaoa 533 . . . . . . . . . 10 ((𝑘 = 𝐴𝑘 = 𝐵) → (((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn) → (𝐽t 𝑘) ∈ Conn))
4234, 41mpan9 487 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) ∧ (𝑘 = 𝐴𝑘 = 𝐵)) → (𝐽t 𝑘) ∈ Conn)
4315, 42sylan2b 493 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) ∧ 𝑘 ∈ {𝐴, 𝐵}) → (𝐽t 𝑘) ∈ Conn)
443, 23, 33, 43iunconn 21433 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → (𝐽t 𝑘 ∈ {𝐴, 𝐵}𝑘) ∈ Conn)
4513, 44eqeltrrd 2840 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) ∧ ((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn)) → (𝐽t (𝐴𝐵)) ∈ Conn)
4645ex 449 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ 𝑥 ∈ (𝐴𝐵)) → (((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn) → (𝐽t (𝐴𝐵)) ∈ Conn))
47463expia 1115 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋)) → (𝑥 ∈ (𝐴𝐵) → (((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn) → (𝐽t (𝐴𝐵)) ∈ Conn)))
4847exlimdv 2010 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋)) → (∃𝑥 𝑥 ∈ (𝐴𝐵) → (((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn) → (𝐽t (𝐴𝐵)) ∈ Conn)))
491, 48syl5bi 232 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋)) → ((𝐴𝐵) ≠ ∅ → (((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn) → (𝐽t (𝐴𝐵)) ∈ Conn)))
50493impia 1110 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐴𝑋𝐵𝑋) ∧ (𝐴𝐵) ≠ ∅) → (((𝐽t 𝐴) ∈ Conn ∧ (𝐽t 𝐵) ∈ Conn) → (𝐽t (𝐴𝐵)) ∈ Conn))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∨ wo 382   ∧ wa 383   ∧ w3a 1072   = wceq 1632  ∃wex 1853   ∈ wcel 2139   ≠ wne 2932  Vcvv 3340   ∪ cun 3713   ∩ cin 3714   ⊆ wss 3715  ∅c0 4058  {cpr 4323  ∪ cuni 4588  ∪ ciun 4672  ‘cfv 6049  (class class class)co 6813   ↾t crest 16283  TopOnctopon 20917  Conncconn 21416 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7114 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-ral 3055  df-rex 3056  df-reu 3057  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-int 4628  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-pred 5841  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-ov 6816  df-oprab 6817  df-mpt2 6818  df-om 7231  df-1st 7333  df-2nd 7334  df-wrecs 7576  df-recs 7637  df-rdg 7675  df-oadd 7733  df-er 7911  df-en 8122  df-fin 8125  df-fi 8482  df-rest 16285  df-topgen 16306  df-top 20901  df-topon 20918  df-bases 20952  df-cld 21025  df-conn 21417 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator