Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cvrfval Structured version   Visualization version   GIF version

Theorem cvrfval 39638
Description: Value of covers relation "is covered by". (Contributed by NM, 18-Sep-2011.)
Hypotheses
Ref Expression
cvrfval.b 𝐵 = (Base‘𝐾)
cvrfval.s < = (lt‘𝐾)
cvrfval.c 𝐶 = ( ⋖ ‘𝐾)
Assertion
Ref Expression
cvrfval (𝐾𝐴𝐶 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))})
Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝐾,𝑦,𝑧
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧)   𝐶(𝑥,𝑦,𝑧)   < (𝑥,𝑦,𝑧)

Proof of Theorem cvrfval
Dummy variable 𝑝 is distinct from all other variables.
StepHypRef Expression
1 elex 3463 . 2 (𝐾𝐴𝐾 ∈ V)
2 cvrfval.c . . 3 𝐶 = ( ⋖ ‘𝐾)
3 fveq2 6842 . . . . . . . . 9 (𝑝 = 𝐾 → (Base‘𝑝) = (Base‘𝐾))
4 cvrfval.b . . . . . . . . 9 𝐵 = (Base‘𝐾)
53, 4eqtr4di 2790 . . . . . . . 8 (𝑝 = 𝐾 → (Base‘𝑝) = 𝐵)
65eleq2d 2823 . . . . . . 7 (𝑝 = 𝐾 → (𝑥 ∈ (Base‘𝑝) ↔ 𝑥𝐵))
75eleq2d 2823 . . . . . . 7 (𝑝 = 𝐾 → (𝑦 ∈ (Base‘𝑝) ↔ 𝑦𝐵))
86, 7anbi12d 633 . . . . . 6 (𝑝 = 𝐾 → ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ↔ (𝑥𝐵𝑦𝐵)))
9 fveq2 6842 . . . . . . . 8 (𝑝 = 𝐾 → (lt‘𝑝) = (lt‘𝐾))
10 cvrfval.s . . . . . . . 8 < = (lt‘𝐾)
119, 10eqtr4di 2790 . . . . . . 7 (𝑝 = 𝐾 → (lt‘𝑝) = < )
1211breqd 5111 . . . . . 6 (𝑝 = 𝐾 → (𝑥(lt‘𝑝)𝑦𝑥 < 𝑦))
1311breqd 5111 . . . . . . . . 9 (𝑝 = 𝐾 → (𝑥(lt‘𝑝)𝑧𝑥 < 𝑧))
1411breqd 5111 . . . . . . . . 9 (𝑝 = 𝐾 → (𝑧(lt‘𝑝)𝑦𝑧 < 𝑦))
1513, 14anbi12d 633 . . . . . . . 8 (𝑝 = 𝐾 → ((𝑥(lt‘𝑝)𝑧𝑧(lt‘𝑝)𝑦) ↔ (𝑥 < 𝑧𝑧 < 𝑦)))
165, 15rexeqbidv 3319 . . . . . . 7 (𝑝 = 𝐾 → (∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧𝑧(lt‘𝑝)𝑦) ↔ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦)))
1716notbid 318 . . . . . 6 (𝑝 = 𝐾 → (¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧𝑧(lt‘𝑝)𝑦) ↔ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦)))
188, 12, 173anbi123d 1439 . . . . 5 (𝑝 = 𝐾 → (((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ∧ 𝑥(lt‘𝑝)𝑦 ∧ ¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧𝑧(lt‘𝑝)𝑦)) ↔ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))))
1918opabbidv 5166 . . . 4 (𝑝 = 𝐾 → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ∧ 𝑥(lt‘𝑝)𝑦 ∧ ¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧𝑧(lt‘𝑝)𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))})
20 df-covers 39636 . . . 4 ⋖ = (𝑝 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ∧ 𝑥(lt‘𝑝)𝑦 ∧ ¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧𝑧(lt‘𝑝)𝑦))})
21 3anass 1095 . . . . . 6 (((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦)) ↔ ((𝑥𝐵𝑦𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))))
2221opabbii 5167 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦)))}
234fvexi 6856 . . . . . . 7 𝐵 ∈ V
2423, 23xpex 7708 . . . . . 6 (𝐵 × 𝐵) ∈ V
25 opabssxp 5724 . . . . . 6 {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦)))} ⊆ (𝐵 × 𝐵)
2624, 25ssexi 5269 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦)))} ∈ V
2722, 26eqeltri 2833 . . . 4 {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))} ∈ V
2819, 20, 27fvmpt 6949 . . 3 (𝐾 ∈ V → ( ⋖ ‘𝐾) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))})
292, 28eqtrid 2784 . 2 (𝐾 ∈ V → 𝐶 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))})
301, 29syl 17 1 (𝐾𝐴𝐶 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  wrex 3062  Vcvv 3442   class class class wbr 5100  {copab 5162   × cxp 5630  cfv 6500  Basecbs 17148  ltcplt 18243  ccvr 39632
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 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-iota 6456  df-fun 6502  df-fv 6508  df-covers 39636
This theorem is referenced by:  cvrval  39639
  Copyright terms: Public domain W3C validator