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 36593
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 23498 . . . . . . 7 Rel Ref
21brrelex2i 5682 . . . . . 6 (𝐵Ref𝐴𝐴 ∈ V)
32adantl 482 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐴 ∈ V)
41brrelex1i 5681 . . . . . 6 (𝐵Ref𝐴𝐵 ∈ V)
54adantl 482 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐵 ∈ V)
6 unexg 7693 . . . . 5 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐵) ∈ V)
73, 5, 6syl2anc 590 . . . 4 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝐴𝐵) ∈ V)
8 ssun2 4115 . . . . . 6 𝐵 ⊆ (𝐴𝐵)
98a1i 11 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐵 ⊆ (𝐴𝐵))
10 ssun1 4114 . . . . . . 7 𝐴 ⊆ (𝐴𝐵)
1110a1i 11 . . . . . 6 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐴 ⊆ (𝐴𝐵))
12 eqimss2 3981 . . . . . . . . 9 (𝑋 = 𝑌𝑌𝑋)
1312adantr 481 . . . . . . . 8 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝑌𝑋)
14 ssequn2 4125 . . . . . . . 8 (𝑌𝑋 ↔ (𝑋𝑌) = 𝑋)
1513, 14sylib 219 . . . . . . 7 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝑋𝑌) = 𝑋)
1615eqcomd 2746 . . . . . 6 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝑋 = (𝑋𝑌))
17 refssfne.1 . . . . . . 7 𝑋 = 𝐴
18 refssfne.2 . . . . . . . . 9 𝑌 = 𝐵
1917, 18uneq12i 4103 . . . . . . . 8 (𝑋𝑌) = ( 𝐴 𝐵)
20 uniun 4868 . . . . . . . 8 (𝐴𝐵) = ( 𝐴 𝐵)
2119, 20eqtr4i 2766 . . . . . . 7 (𝑋𝑌) = (𝐴𝐵)
2217, 21fness 36584 . . . . . 6 (((𝐴𝐵) ∈ V ∧ 𝐴 ⊆ (𝐴𝐵) ∧ 𝑋 = (𝑋𝑌)) → 𝐴Fne(𝐴𝐵))
237, 11, 16, 22syl3anc 1379 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐴Fne(𝐴𝐵))
24 elun 4090 . . . . . . . 8 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
25 ssid 3944 . . . . . . . . . . 11 𝑥𝑥
26 sseq2 3948 . . . . . . . . . . . 12 (𝑦 = 𝑥 → (𝑥𝑦𝑥𝑥))
2726rspcev 3567 . . . . . . . . . . 11 ((𝑥𝐴𝑥𝑥) → ∃𝑦𝐴 𝑥𝑦)
2825, 27mpan2 697 . . . . . . . . . 10 (𝑥𝐴 → ∃𝑦𝐴 𝑥𝑦)
2928a1i 11 . . . . . . . . 9 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝑥𝐴 → ∃𝑦𝐴 𝑥𝑦))
30 refssex 23501 . . . . . . . . . . 11 ((𝐵Ref𝐴𝑥𝐵) → ∃𝑦𝐴 𝑥𝑦)
3130ex 413 . . . . . . . . . 10 (𝐵Ref𝐴 → (𝑥𝐵 → ∃𝑦𝐴 𝑥𝑦))
3231adantl 482 . . . . . . . . 9 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝑥𝐵 → ∃𝑦𝐴 𝑥𝑦))
3329, 32jaod 865 . . . . . . . 8 ((𝑋 = 𝑌𝐵Ref𝐴) → ((𝑥𝐴𝑥𝐵) → ∃𝑦𝐴 𝑥𝑦))
3424, 33biimtrid 243 . . . . . . 7 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝑥 ∈ (𝐴𝐵) → ∃𝑦𝐴 𝑥𝑦))
3534ralrimiv 3131 . . . . . 6 ((𝑋 = 𝑌𝐵Ref𝐴) → ∀𝑥 ∈ (𝐴𝐵)∃𝑦𝐴 𝑥𝑦)
3621, 17isref 23499 . . . . . . 7 ((𝐴𝐵) ∈ V → ((𝐴𝐵)Ref𝐴 ↔ (𝑋 = (𝑋𝑌) ∧ ∀𝑥 ∈ (𝐴𝐵)∃𝑦𝐴 𝑥𝑦)))
377, 36syl 17 . . . . . 6 ((𝑋 = 𝑌𝐵Ref𝐴) → ((𝐴𝐵)Ref𝐴 ↔ (𝑋 = (𝑋𝑌) ∧ ∀𝑥 ∈ (𝐴𝐵)∃𝑦𝐴 𝑥𝑦)))
3816, 35, 37mpbir2and 719 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝐴𝐵)Ref𝐴)
399, 23, 38jca32 520 . . . 4 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝐵 ⊆ (𝐴𝐵) ∧ (𝐴Fne(𝐴𝐵) ∧ (𝐴𝐵)Ref𝐴)))
40 sseq2 3948 . . . . . 6 (𝑐 = (𝐴𝐵) → (𝐵𝑐𝐵 ⊆ (𝐴𝐵)))
41 breq2 5083 . . . . . . 7 (𝑐 = (𝐴𝐵) → (𝐴Fne𝑐𝐴Fne(𝐴𝐵)))
42 breq1 5082 . . . . . . 7 (𝑐 = (𝐴𝐵) → (𝑐Ref𝐴 ↔ (𝐴𝐵)Ref𝐴))
4341, 42anbi12d 638 . . . . . 6 (𝑐 = (𝐴𝐵) → ((𝐴Fne𝑐𝑐Ref𝐴) ↔ (𝐴Fne(𝐴𝐵) ∧ (𝐴𝐵)Ref𝐴)))
4440, 43anbi12d 638 . . . . 5 (𝑐 = (𝐴𝐵) → ((𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴)) ↔ (𝐵 ⊆ (𝐴𝐵) ∧ (𝐴Fne(𝐴𝐵) ∧ (𝐴𝐵)Ref𝐴))))
4544spcegv 3542 . . . 4 ((𝐴𝐵) ∈ V → ((𝐵 ⊆ (𝐴𝐵) ∧ (𝐴Fne(𝐴𝐵) ∧ (𝐴𝐵)Ref𝐴)) → ∃𝑐(𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))))
467, 39, 45sylc 65 . . 3 ((𝑋 = 𝑌𝐵Ref𝐴) → ∃𝑐(𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴)))
4746ex 413 . 2 (𝑋 = 𝑌 → (𝐵Ref𝐴 → ∃𝑐(𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))))
48 vex 3436 . . . . . . . 8 𝑐 ∈ V
4948ssex 5256 . . . . . . 7 (𝐵𝑐𝐵 ∈ V)
5049ad2antrl 734 . . . . . 6 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝐵 ∈ V)
51 simprl 776 . . . . . 6 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝐵𝑐)
52 simpl 483 . . . . . . 7 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝑋 = 𝑌)
53 eqid 2740 . . . . . . . . . 10 𝑐 = 𝑐
5453, 17refbas 23500 . . . . . . . . 9 (𝑐Ref𝐴𝑋 = 𝑐)
5554adantl 482 . . . . . . . 8 ((𝐴Fne𝑐𝑐Ref𝐴) → 𝑋 = 𝑐)
5655ad2antll 735 . . . . . . 7 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝑋 = 𝑐)
5752, 56eqtr3d 2777 . . . . . 6 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝑌 = 𝑐)
5818, 53ssref 23502 . . . . . 6 ((𝐵 ∈ V ∧ 𝐵𝑐𝑌 = 𝑐) → 𝐵Ref𝑐)
5950, 51, 57, 58syl3anc 1379 . . . . 5 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝐵Ref𝑐)
60 simprrr 787 . . . . 5 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝑐Ref𝐴)
61 reftr 23504 . . . . 5 ((𝐵Ref𝑐𝑐Ref𝐴) → 𝐵Ref𝐴)
6259, 60, 61syl2anc 590 . . . 4 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝐵Ref𝐴)
6362ex 413 . . 3 (𝑋 = 𝑌 → ((𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴)) → 𝐵Ref𝐴))
6463exlimdv 1940 . 2 (𝑋 = 𝑌 → (∃𝑐(𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴)) → 𝐵Ref𝐴))
6547, 64impbid 213 1 (𝑋 = 𝑌 → (𝐵Ref𝐴 ↔ ∃𝑐(𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  wo 853   = wceq 1547  wex 1786  wcel 2119  wral 3054  wrex 3064  Vcvv 3432  cun 3888  wss 3890   cuni 4845   class class class wbr 5079  Refcref 23492  Fnecfne 36571
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-iota 6448  df-fun 6494  df-fv 6500  df-topgen 17404  df-ref 23495  df-fne 36572
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator