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 39856
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 3474 . 2 (𝐾𝐴𝐾 ∈ V)
2 cvrfval.c . . 3 𝐶 = ( ⋖ ‘𝐾)
3 fveq2 6863 . . . . . . . . 9 (𝑝 = 𝐾 → (Base‘𝑝) = (Base‘𝐾))
4 cvrfval.b . . . . . . . . 9 𝐵 = (Base‘𝐾)
53, 4eqtr4di 2814 . . . . . . . 8 (𝑝 = 𝐾 → (Base‘𝑝) = 𝐵)
65eleq2d 2847 . . . . . . 7 (𝑝 = 𝐾 → (𝑥 ∈ (Base‘𝑝) ↔ 𝑥𝐵))
75eleq2d 2847 . . . . . . 7 (𝑝 = 𝐾 → (𝑦 ∈ (Base‘𝑝) ↔ 𝑦𝐵))
86, 7anbi12d 641 . . . . . 6 (𝑝 = 𝐾 → ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ↔ (𝑥𝐵𝑦𝐵)))
9 fveq2 6863 . . . . . . . 8 (𝑝 = 𝐾 → (lt‘𝑝) = (lt‘𝐾))
10 cvrfval.s . . . . . . . 8 < = (lt‘𝐾)
119, 10eqtr4di 2814 . . . . . . 7 (𝑝 = 𝐾 → (lt‘𝑝) = < )
1211breqd 5110 . . . . . 6 (𝑝 = 𝐾 → (𝑥(lt‘𝑝)𝑦𝑥 < 𝑦))
1311breqd 5110 . . . . . . . . 9 (𝑝 = 𝐾 → (𝑥(lt‘𝑝)𝑧𝑥 < 𝑧))
1411breqd 5110 . . . . . . . . 9 (𝑝 = 𝐾 → (𝑧(lt‘𝑝)𝑦𝑧 < 𝑦))
1513, 14anbi12d 641 . . . . . . . 8 (𝑝 = 𝐾 → ((𝑥(lt‘𝑝)𝑧𝑧(lt‘𝑝)𝑦) ↔ (𝑥 < 𝑧𝑧 < 𝑦)))
165, 15rexeqbidv 3336 . . . . . . 7 (𝑝 = 𝐾 → (∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧𝑧(lt‘𝑝)𝑦) ↔ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦)))
1716notbid 320 . . . . . 6 (𝑝 = 𝐾 → (¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧𝑧(lt‘𝑝)𝑦) ↔ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦)))
188, 12, 173anbi123d 1456 . . . . 5 (𝑝 = 𝐾 → (((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ∧ 𝑥(lt‘𝑝)𝑦 ∧ ¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧𝑧(lt‘𝑝)𝑦)) ↔ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))))
1918opabbidv 5165 . . . 4 (𝑝 = 𝐾 → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ∧ 𝑥(lt‘𝑝)𝑦 ∧ ¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧𝑧(lt‘𝑝)𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))})
20 df-covers 39854 . . . 4 ⋖ = (𝑝 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ∧ 𝑥(lt‘𝑝)𝑦 ∧ ¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧𝑧(lt‘𝑝)𝑦))})
21 3anass 1105 . . . . . 6 (((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦)) ↔ ((𝑥𝐵𝑦𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))))
2221opabbii 5166 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦)))}
234fvexi 6877 . . . . . . 7 𝐵 ∈ V
2423, 23xpex 7732 . . . . . 6 (𝐵 × 𝐵) ∈ V
25 opabssxp 5737 . . . . . 6 {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦)))} ⊆ (𝐵 × 𝐵)
2624, 25ssexi 5277 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦)))} ∈ V
2722, 26eqeltri 2857 . . . 4 {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))} ∈ V
2819, 20, 27fvmpt 6971 . . 3 (𝐾 ∈ V → ( ⋖ ‘𝐾) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))})
292, 28eqtrid 2808 . 2 (𝐾 ∈ V → 𝐶 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))})
301, 29syl 17 1 (𝐾𝐴𝐶 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧𝐵 (𝑥 < 𝑧𝑧 < 𝑦))})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399  w3a 1097   = wceq 1559  wcel 2141  wrex 3085  Vcvv 3453   class class class wbr 5099  {copab 5161   × cxp 5643  cfv 6517  Basecbs 17228  ltcplt 18323  ccvr 39850
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-iota 6473  df-fun 6519  df-fv 6525  df-covers 39854
This theorem is referenced by:  cvrval  39857
  Copyright terms: Public domain W3C validator