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 36540
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 23473 . . . . . . 7 Rel Ref
21brrelex2i 5688 . . . . . 6 (𝐵Ref𝐴𝐴 ∈ V)
32adantl 481 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐴 ∈ V)
41brrelex1i 5687 . . . . . 6 (𝐵Ref𝐴𝐵 ∈ V)
54adantl 481 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐵 ∈ V)
6 unexg 7697 . . . . 5 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐵) ∈ V)
73, 5, 6syl2anc 585 . . . 4 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝐴𝐵) ∈ V)
8 ssun2 4119 . . . . . 6 𝐵 ⊆ (𝐴𝐵)
98a1i 11 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐵 ⊆ (𝐴𝐵))
10 ssun1 4118 . . . . . . 7 𝐴 ⊆ (𝐴𝐵)
1110a1i 11 . . . . . 6 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐴 ⊆ (𝐴𝐵))
12 eqimss2 3981 . . . . . . . . 9 (𝑋 = 𝑌𝑌𝑋)
1312adantr 480 . . . . . . . 8 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝑌𝑋)
14 ssequn2 4129 . . . . . . . 8 (𝑌𝑋 ↔ (𝑋𝑌) = 𝑋)
1513, 14sylib 218 . . . . . . 7 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝑋𝑌) = 𝑋)
1615eqcomd 2742 . . . . . 6 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝑋 = (𝑋𝑌))
17 refssfne.1 . . . . . . 7 𝑋 = 𝐴
18 refssfne.2 . . . . . . . . 9 𝑌 = 𝐵
1917, 18uneq12i 4106 . . . . . . . 8 (𝑋𝑌) = ( 𝐴 𝐵)
20 uniun 4873 . . . . . . . 8 (𝐴𝐵) = ( 𝐴 𝐵)
2119, 20eqtr4i 2762 . . . . . . 7 (𝑋𝑌) = (𝐴𝐵)
2217, 21fness 36531 . . . . . 6 (((𝐴𝐵) ∈ V ∧ 𝐴 ⊆ (𝐴𝐵) ∧ 𝑋 = (𝑋𝑌)) → 𝐴Fne(𝐴𝐵))
237, 11, 16, 22syl3anc 1374 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → 𝐴Fne(𝐴𝐵))
24 elun 4093 . . . . . . . 8 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
25 ssid 3944 . . . . . . . . . . 11 𝑥𝑥
26 sseq2 3948 . . . . . . . . . . . 12 (𝑦 = 𝑥 → (𝑥𝑦𝑥𝑥))
2726rspcev 3564 . . . . . . . . . . 11 ((𝑥𝐴𝑥𝑥) → ∃𝑦𝐴 𝑥𝑦)
2825, 27mpan2 692 . . . . . . . . . 10 (𝑥𝐴 → ∃𝑦𝐴 𝑥𝑦)
2928a1i 11 . . . . . . . . 9 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝑥𝐴 → ∃𝑦𝐴 𝑥𝑦))
30 refssex 23476 . . . . . . . . . . 11 ((𝐵Ref𝐴𝑥𝐵) → ∃𝑦𝐴 𝑥𝑦)
3130ex 412 . . . . . . . . . 10 (𝐵Ref𝐴 → (𝑥𝐵 → ∃𝑦𝐴 𝑥𝑦))
3231adantl 481 . . . . . . . . 9 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝑥𝐵 → ∃𝑦𝐴 𝑥𝑦))
3329, 32jaod 860 . . . . . . . 8 ((𝑋 = 𝑌𝐵Ref𝐴) → ((𝑥𝐴𝑥𝐵) → ∃𝑦𝐴 𝑥𝑦))
3424, 33biimtrid 242 . . . . . . 7 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝑥 ∈ (𝐴𝐵) → ∃𝑦𝐴 𝑥𝑦))
3534ralrimiv 3128 . . . . . 6 ((𝑋 = 𝑌𝐵Ref𝐴) → ∀𝑥 ∈ (𝐴𝐵)∃𝑦𝐴 𝑥𝑦)
3621, 17isref 23474 . . . . . . 7 ((𝐴𝐵) ∈ V → ((𝐴𝐵)Ref𝐴 ↔ (𝑋 = (𝑋𝑌) ∧ ∀𝑥 ∈ (𝐴𝐵)∃𝑦𝐴 𝑥𝑦)))
377, 36syl 17 . . . . . 6 ((𝑋 = 𝑌𝐵Ref𝐴) → ((𝐴𝐵)Ref𝐴 ↔ (𝑋 = (𝑋𝑌) ∧ ∀𝑥 ∈ (𝐴𝐵)∃𝑦𝐴 𝑥𝑦)))
3816, 35, 37mpbir2and 714 . . . . 5 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝐴𝐵)Ref𝐴)
399, 23, 38jca32 515 . . . 4 ((𝑋 = 𝑌𝐵Ref𝐴) → (𝐵 ⊆ (𝐴𝐵) ∧ (𝐴Fne(𝐴𝐵) ∧ (𝐴𝐵)Ref𝐴)))
40 sseq2 3948 . . . . . 6 (𝑐 = (𝐴𝐵) → (𝐵𝑐𝐵 ⊆ (𝐴𝐵)))
41 breq2 5089 . . . . . . 7 (𝑐 = (𝐴𝐵) → (𝐴Fne𝑐𝐴Fne(𝐴𝐵)))
42 breq1 5088 . . . . . . 7 (𝑐 = (𝐴𝐵) → (𝑐Ref𝐴 ↔ (𝐴𝐵)Ref𝐴))
4341, 42anbi12d 633 . . . . . 6 (𝑐 = (𝐴𝐵) → ((𝐴Fne𝑐𝑐Ref𝐴) ↔ (𝐴Fne(𝐴𝐵) ∧ (𝐴𝐵)Ref𝐴)))
4440, 43anbi12d 633 . . . . 5 (𝑐 = (𝐴𝐵) → ((𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴)) ↔ (𝐵 ⊆ (𝐴𝐵) ∧ (𝐴Fne(𝐴𝐵) ∧ (𝐴𝐵)Ref𝐴))))
4544spcegv 3539 . . . 4 ((𝐴𝐵) ∈ V → ((𝐵 ⊆ (𝐴𝐵) ∧ (𝐴Fne(𝐴𝐵) ∧ (𝐴𝐵)Ref𝐴)) → ∃𝑐(𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))))
467, 39, 45sylc 65 . . 3 ((𝑋 = 𝑌𝐵Ref𝐴) → ∃𝑐(𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴)))
4746ex 412 . 2 (𝑋 = 𝑌 → (𝐵Ref𝐴 → ∃𝑐(𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))))
48 vex 3433 . . . . . . . 8 𝑐 ∈ V
4948ssex 5262 . . . . . . 7 (𝐵𝑐𝐵 ∈ V)
5049ad2antrl 729 . . . . . 6 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝐵 ∈ V)
51 simprl 771 . . . . . 6 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝐵𝑐)
52 simpl 482 . . . . . . 7 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝑋 = 𝑌)
53 eqid 2736 . . . . . . . . . 10 𝑐 = 𝑐
5453, 17refbas 23475 . . . . . . . . 9 (𝑐Ref𝐴𝑋 = 𝑐)
5554adantl 481 . . . . . . . 8 ((𝐴Fne𝑐𝑐Ref𝐴) → 𝑋 = 𝑐)
5655ad2antll 730 . . . . . . 7 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝑋 = 𝑐)
5752, 56eqtr3d 2773 . . . . . 6 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝑌 = 𝑐)
5818, 53ssref 23477 . . . . . 6 ((𝐵 ∈ V ∧ 𝐵𝑐𝑌 = 𝑐) → 𝐵Ref𝑐)
5950, 51, 57, 58syl3anc 1374 . . . . 5 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝐵Ref𝑐)
60 simprrr 782 . . . . 5 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝑐Ref𝐴)
61 reftr 23479 . . . . 5 ((𝐵Ref𝑐𝑐Ref𝐴) → 𝐵Ref𝐴)
6259, 60, 61syl2anc 585 . . . 4 ((𝑋 = 𝑌 ∧ (𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))) → 𝐵Ref𝐴)
6362ex 412 . . 3 (𝑋 = 𝑌 → ((𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴)) → 𝐵Ref𝐴))
6463exlimdv 1935 . 2 (𝑋 = 𝑌 → (∃𝑐(𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴)) → 𝐵Ref𝐴))
6547, 64impbid 212 1 (𝑋 = 𝑌 → (𝐵Ref𝐴 ↔ ∃𝑐(𝐵𝑐 ∧ (𝐴Fne𝑐𝑐Ref𝐴))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 848   = wceq 1542  wex 1781  wcel 2114  wral 3051  wrex 3061  Vcvv 3429  cun 3887  wss 3889   cuni 4850   class class class wbr 5085  Refcref 23467  Fnecfne 36518
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-iota 6454  df-fun 6500  df-fv 6506  df-topgen 17406  df-ref 23470  df-fne 36519
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator