Users' Mathboxes Mathbox for Jeff Hankins < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  refssfne Structured version   Visualization version   GIF version

Theorem refssfne 37116
Description: A cover is a refinement iff it is a subcover of something which is both finer and a refinement. (Contributed by Jeff Hankins, 18-Jan-2010.) (Revised by Thierry Arnoux, 3-Feb-2020.)
Hypotheses
Ref Expression
refssfne.1 𝑋 = ∪ 𝐴
refssfne.2 𝑌 = ∪ 𝐵
Assertion
Ref Expression
refssfne (𝑋 = 𝑌 → (𝐵Ref𝐴 ↔ ∃𝑐(𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))))
Distinct variable groups:   𝐴,𝑐   𝐵,𝑐   𝑋,𝑐   𝑌,𝑐

Proof of Theorem refssfne
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 refrel 23807 . . . . . . 7 Rel Ref
21brrelex2i 5708 . . . . . 6 (𝐵Ref𝐴 → 𝐴 ∈ V)
32adantl 487 . . . . 5 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝐴 ∈ V)
41brrelex1i 5707 . . . . . 6 (𝐵Ref𝐴 → 𝐵 ∈ V)
54adantl 487 . . . . 5 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝐵 ∈ V)
6 unexg 7749 . . . . 5 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ∪ 𝐵) ∈ V)
73, 5, 6syl2anc 596 . . . 4 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝐴 ∪ 𝐵) ∈ V)
8 ssun2 4125 . . . . . 6 𝐵 ⊆ (𝐴 ∪ 𝐵)
98a1i 11 . . . . 5 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝐵 ⊆ (𝐴 ∪ 𝐵))
10 ssun1 4124 . . . . . . 7 𝐴 ⊆ (𝐴 ∪ 𝐵)
1110a1i 11 . . . . . 6 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝐴 ⊆ (𝐴 ∪ 𝐵))
12 eqimss2 3990 . . . . . . . . 9 (𝑋 = 𝑌 → 𝑌 ⊆ 𝑋)
1312adantr 486 . . . . . . . 8 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝑌 ⊆ 𝑋)
14 ssequn2 4135 . . . . . . . 8 (𝑌 ⊆ 𝑋 ↔ (𝑋 ∪ 𝑌) = 𝑋)
1513, 14sylib 221 . . . . . . 7 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝑋 ∪ 𝑌) = 𝑋)
1615eqcomd 2767 . . . . . 6 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝑋 = (𝑋 ∪ 𝑌))
17 refssfne.1 . . . . . . 7 𝑋 = ∪ 𝐴
18 refssfne.2 . . . . . . . . 9 𝑌 = ∪ 𝐵
1917, 18uneq12i 4113 . . . . . . . 8 (𝑋 ∪ 𝑌) = (∪ 𝐴 ∪ ∪ 𝐵)
20 uniun 4890 . . . . . . . 8 ∪ (𝐴 ∪ 𝐵) = (∪ 𝐴 ∪ ∪ 𝐵)
2119, 20eqtr4i 2787 . . . . . . 7 (𝑋 ∪ 𝑌) = ∪ (𝐴 ∪ 𝐵)
2217, 21fness 37107 . . . . . 6 (((𝐴 ∪ 𝐵) ∈ V ∧ 𝐴 ⊆ (𝐴 ∪ 𝐵) ∧ 𝑋 = (𝑋 ∪ 𝑌)) → 𝐴Fne(𝐴 ∪ 𝐵))
237, 11, 16, 22syl3anc 1398 . . . . 5 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝐴Fne(𝐴 ∪ 𝐵))
24 elun 4100 . . . . . . . 8 (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵))
25 ssid 3953 . . . . . . . . . . 11 𝑥 ⊆ 𝑥
26 sseq2 3957 . . . . . . . . . . . 12 (𝑦 = 𝑥 → (𝑥 ⊆ 𝑦 ↔ 𝑥 ⊆ 𝑥))
2726rspcev 3577 . . . . . . . . . . 11 ((𝑥 ∈ 𝐴 ∧ 𝑥 ⊆ 𝑥) → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦)
2825, 27mpan2 704 . . . . . . . . . 10 (𝑥 ∈ 𝐴 → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦)
2928a1i 11 . . . . . . . . 9 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝑥 ∈ 𝐴 → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦))
30 refssex 23810 . . . . . . . . . . 11 ((𝐵Ref𝐴 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦)
3130ex 418 . . . . . . . . . 10 (𝐵Ref𝐴 → (𝑥 ∈ 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦))
3231adantl 487 . . . . . . . . 9 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝑥 ∈ 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦))
3329, 32jaod 873 . . . . . . . 8 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦))
3424, 33biimtrid 245 . . . . . . 7 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝑥 ∈ (𝐴 ∪ 𝐵) → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦))
3534ralrimiv 3154 . . . . . 6 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → ∀𝑥 ∈ (𝐴 ∪ 𝐵)∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦)
3621, 17isref 23808 . . . . . . 7 ((𝐴 ∪ 𝐵) ∈ V → ((𝐴 ∪ 𝐵)Ref𝐴 ↔ (𝑋 = (𝑋 ∪ 𝑌) ∧ ∀𝑥 ∈ (𝐴 ∪ 𝐵)∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦)))
377, 36syl 18 . . . . . 6 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → ((𝐴 ∪ 𝐵)Ref𝐴 ↔ (𝑋 = (𝑋 ∪ 𝑌) ∧ ∀𝑥 ∈ (𝐴 ∪ 𝐵)∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦)))
3816, 35, 37mpbir2and 726 . . . . 5 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝐴 ∪ 𝐵)Ref𝐴)
399, 23, 38jca32 525 . . . 4 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝐵 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴Fne(𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵)Ref𝐴)))
40 sseq2 3957 . . . . . 6 (𝑐 = (𝐴 ∪ 𝐵) → (𝐵 ⊆ 𝑐 ↔ 𝐵 ⊆ (𝐴 ∪ 𝐵)))
41 breq2 5107 . . . . . . 7 (𝑐 = (𝐴 ∪ 𝐵) → (𝐴Fne𝑐 ↔ 𝐴Fne(𝐴 ∪ 𝐵)))
42 breq1 5106 . . . . . . 7 (𝑐 = (𝐴 ∪ 𝐵) → (𝑐Ref𝐴 ↔ (𝐴 ∪ 𝐵)Ref𝐴))
4341, 42anbi12d 644 . . . . . 6 (𝑐 = (𝐴 ∪ 𝐵) → ((𝐴Fne𝑐 ∧ 𝑐Ref𝐴) ↔ (𝐴Fne(𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵)Ref𝐴)))
4440, 43anbi12d 644 . . . . 5 (𝑐 = (𝐴 ∪ 𝐵) → ((𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴)) ↔ (𝐵 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴Fne(𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵)Ref𝐴))))
4544spcegv 3552 . . . 4 ((𝐴 ∪ 𝐵) ∈ V → ((𝐵 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴Fne(𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵)Ref𝐴)) → ∃𝑐(𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))))
467, 39, 45sylc 66 . . 3 ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → ∃𝑐(𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴)))
4746ex 418 . 2 (𝑋 = 𝑌 → (𝐵Ref𝐴 → ∃𝑐(𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))))
48 vex 3455 . . . . . . . 8 𝑐 ∈ V
4948ssex 5282 . . . . . . 7 (𝐵 ⊆ 𝑐 → 𝐵 ∈ V)
5049ad2antrl 741 . . . . . 6 ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝐵 ∈ V)
51 simprl 783 . . . . . 6 ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝐵 ⊆ 𝑐)
52 simpl 488 . . . . . . 7 ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝑋 = 𝑌)
53 eqid 2761 . . . . . . . . . 10 ∪ 𝑐 = ∪ 𝑐
5453, 17refbas 23809 . . . . . . . . 9 (𝑐Ref𝐴 → 𝑋 = ∪ 𝑐)
5554adantl 487 . . . . . . . 8 ((𝐴Fne𝑐 ∧ 𝑐Ref𝐴) → 𝑋 = ∪ 𝑐)
5655ad2antll 742 . . . . . . 7 ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝑋 = ∪ 𝑐)
5752, 56eqtr3d 2798 . . . . . 6 ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝑌 = ∪ 𝑐)
5818, 53ssref 23811 . . . . . 6 ((𝐵 ∈ V ∧ 𝐵 ⊆ 𝑐 ∧ 𝑌 = ∪ 𝑐) → 𝐵Ref𝑐)
5950, 51, 57, 58syl3anc 1398 . . . . 5 ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝐵Ref𝑐)
60 simprrr 794 . . . . 5 ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝑐Ref𝐴)
61 reftr 23813 . . . . 5 ((𝐵Ref𝑐 ∧ 𝑐Ref𝐴) → 𝐵Ref𝐴)
6259, 60, 61syl2anc 596 . . . 4 ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝐵Ref𝐴)
6362ex 418 . . 3 (𝑋 = 𝑌 → ((𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴)) → 𝐵Ref𝐴))
6463exlimdv 1966 . 2 (𝑋 = 𝑌 → (∃𝑐(𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴)) → 𝐵Ref𝐴))
6547, 64impbid 215 1 (𝑋 = 𝑌 → (𝐵Ref𝐴 ↔ ∃𝑐(𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ∪ cun 3897   ⊆ wss 3899  ∪ cuni 4867   class class class wbr 5103  Refcref 23801  Fnecfne 37094
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fv 6539  df-topgen 17594  df-ref 23804  df-fne 37095
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator