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 36985
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 23740 . . . . . . 7 Rel Ref
21brrelex2i 5716 . . . . . 6 (𝐵Ref𝐴𝐴 ∈ V)
32adantl 487 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐴 ∈ V)
41brrelex1i 5715 . . . . . 6 (𝐵Ref𝐴𝐵 ∈ V)
54adantl 487 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐵 ∈ V)
6 unexg 7749 . . . . 5 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐵) ∈ V)
73, 5, 6syl2anc 596 . . . 4 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝐴𝐵) ∈ V)
8 ssun2 4128 . . . . . 6 𝐵 ⊆ (𝐴𝐵)
98a1i 11 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐵 ⊆ (𝐴𝐵))
10 ssun1 4127 . . . . . . 7 𝐴 ⊆ (𝐴𝐵)
1110a1i 11 . . . . . 6 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐴 ⊆ (𝐴𝐵))
12 eqimss2 3993 . . . . . . . . 9 (𝑋 = 𝑌𝑌𝑋)
1312adantr 486 . . . . . . . 8 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝑌𝑋)
14 ssequn2 4138 . . . . . . . 8 (𝑌𝑋 ↔ (𝑋𝑌) = 𝑋)
1513, 14sylib 221 . . . . . . 7 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝑋𝑌) = 𝑋)
1615eqcomd 2768 . . . . . 6 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝑋 = (𝑋𝑌))
17 refssfne.1 . . . . . . 7 𝑋 = 𝐴
18 refssfne.2 . . . . . . . . 9 𝑌 = 𝐵
1917, 18uneq12i 4116 . . . . . . . 8 (𝑋𝑌) = ( 𝐴 𝐵)
20 uniun 4893 . . . . . . . 8 (𝐴𝐵) = ( 𝐴 𝐵)
2119, 20eqtr4i 2788 . . . . . . 7 (𝑋𝑌) = (𝐴𝐵)
2217, 21fness 36976 . . . . . 6 (((𝐴𝐵) ∈ V ∧ 𝐴 ⊆ (𝐴𝐵) ∧ 𝑋 = (𝑋𝑌)) → 𝐴Fne(𝐴𝐵))
237, 11, 16, 22syl3anc 1398 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐴Fne(𝐴𝐵))
24 elun 4103 . . . . . . . 8 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
25 ssid 3956 . . . . . . . . . . 11 𝑥𝑥
26 sseq2 3960 . . . . . . . . . . . 12 (𝑦 = 𝑥 → (𝑥𝑦𝑥𝑥))
2726rspcev 3579 . . . . . . . . . . 11 ((𝑥𝐴𝑥𝑥) → ∃𝑦𝐴 𝑥𝑦)
2825, 27mpan2 704 . . . . . . . . . 10 (𝑥𝐴 → ∃𝑦𝐴 𝑥𝑦)
2928a1i 11 . . . . . . . . 9 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝑥𝐴 → ∃𝑦𝐴 𝑥𝑦))
30 refssex 23743 . . . . . . . . . . 11 ((𝐵Ref𝐴𝑥𝐵) → ∃𝑦𝐴 𝑥𝑦)
3130ex 418 . . . . . . . . . 10 (𝐵Ref𝐴 → (𝑥𝐵 → ∃𝑦𝐴 𝑥𝑦))
3231adantl 487 . . . . . . . . 9 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝑥𝐵 → ∃𝑦𝐴 𝑥𝑦))
3329, 32jaod 873 . . . . . . . 8 ((𝑋 = 𝑌𝐵Ref𝐴) → ((𝑥𝐴𝑥𝐵) → ∃𝑦𝐴 𝑥𝑦))
3424, 33biimtrid 245 . . . . . . 7 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝑥 ∈ (𝐴𝐵) → ∃𝑦𝐴 𝑥𝑦))
3534ralrimiv 3155 . . . . . 6 ((𝑋 = 𝑌𝐵Ref𝐴) → ∀𝑥 ∈ (𝐴𝐵)∃𝑦𝐴 𝑥𝑦)
3621, 17isref 23741 . . . . . . 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 3960 . . . . . 6 (𝑐 = (𝐴𝐵) → (𝐵𝑐𝐵 ⊆ (𝐴𝐵)))
41 breq2 5111 . . . . . . 7 (𝑐 = (𝐴𝐵) → (𝐴Fne𝑐𝐴Fne(𝐴𝐵)))
42 breq1 5110 . . . . . . 7 (𝑐 = (𝐴𝐵) → (𝑐Ref𝐴 ↔ (𝐴𝐵)Ref𝐴))
4341, 42anbi12d 644 . . . . . 6 (𝑐 = (𝐴𝐵) → ((𝐴Fne𝑐𝑐Ref𝐴) ↔ (𝐴Fne(𝐴𝐵) ∧ (𝐴𝐵)Ref𝐴)))
4440, 43anbi12d 644 . . . . 5 (𝑐 = (𝐴𝐵) → ((𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴)) ↔ (𝐵 ⊆ (𝐴𝐵) ∧ (𝐴Fne(𝐴𝐵) ∧ (𝐴𝐵)Ref𝐴))))
4544spcegv 3554 . . . 4 ((𝐴𝐵) ∈ V → ((𝐵 ⊆ (𝐴𝐵) ∧ (𝐴Fne(𝐴𝐵) ∧ (𝐴𝐵)Ref𝐴)) → ∃𝑐(𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))))
467, 39, 45sylc 66 . . 3 ((𝑋 = 𝑌𝐵Ref𝐴) → ∃𝑐(𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴)))
4746ex 418 . 2 (𝑋 = 𝑌 → (𝐵Ref𝐴 → ∃𝑐(𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))))
48 vex 3457 . . . . . . . 8 𝑐 ∈ V
4948ssex 5289 . . . . . . 7 (𝐵𝑐𝐵 ∈ V)
5049ad2antrl 741 . . . . . 6 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝐵 ∈ V)
51 simprl 783 . . . . . 6 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝐵𝑐)
52 simpl 488 . . . . . . 7 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝑋 = 𝑌)
53 eqid 2762 . . . . . . . . . 10 𝑐 = 𝑐
5453, 17refbas 23742 . . . . . . . . 9 (𝑐Ref𝐴𝑋 = 𝑐)
5554adantl 487 . . . . . . . 8 ((𝐴Fne𝑐𝑐Ref𝐴) → 𝑋 = 𝑐)
5655ad2antll 742 . . . . . . 7 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝑋 = 𝑐)
5752, 56eqtr3d 2799 . . . . . 6 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝑌 = 𝑐)
5818, 53ssref 23744 . . . . . 6 ((𝐵 ∈ V ∧ 𝐵𝑐𝑌 = 𝑐) → 𝐵Ref𝑐)
5950, 51, 57, 58syl3anc 1398 . . . . 5 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝐵Ref𝑐)
60 simprrr 794 . . . . 5 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝑐Ref𝐴)
61 reftr 23746 . . . . 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 3078  wrex 3088  Vcvv 3453  cun 3900  wss 3902   cuni 4870   class class class wbr 5107  Refcref 23734  Fnecfne 36963
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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-topgen 17534  df-ref 23737  df-fne 36964
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator