Theorem cvrfval 33573

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.

Step	Hyp	Ref	Expression
1		elex 3185	. 2 ⊢ (𝐾 ∈ 𝐴 → 𝐾 ∈ V)
2		cvrfval.c	. . 3 ⊢ 𝐶 = ( ⋖ ‘𝐾)
3		fveq2 6103	. . . . . . . . 9 ⊢ (𝑝 = 𝐾 → (Base‘𝑝) = (Base‘𝐾))
4		cvrfval.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝐾)
5	3, 4	syl6eqr 2662	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → (Base‘𝑝) = 𝐵)
6	5	eleq2d 2673	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (𝑥 ∈ (Base‘𝑝) ↔ 𝑥 ∈ 𝐵))
7	5	eleq2d 2673	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (𝑦 ∈ (Base‘𝑝) ↔ 𝑦 ∈ 𝐵))
8	6, 7	anbi12d 743	. . . . . 6 ⊢ (𝑝 = 𝐾 → ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
9		fveq2 6103	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → (lt‘𝑝) = (lt‘𝐾))
10		cvrfval.s	. . . . . . . 8 ⊢ < = (lt‘𝐾)
11	9, 10	syl6eqr 2662	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (lt‘𝑝) = < )
12	11	breqd 4594	. . . . . 6 ⊢ (𝑝 = 𝐾 → (𝑥(lt‘𝑝)𝑦 ↔ 𝑥 < 𝑦))
13	11	breqd 4594	. . . . . . . . 9 ⊢ (𝑝 = 𝐾 → (𝑥(lt‘𝑝)𝑧 ↔ 𝑥 < 𝑧))
14	11	breqd 4594	. . . . . . . . 9 ⊢ (𝑝 = 𝐾 → (𝑧(lt‘𝑝)𝑦 ↔ 𝑧 < 𝑦))
15	13, 14	anbi12d 743	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → ((𝑥(lt‘𝑝)𝑧 ∧ 𝑧(lt‘𝑝)𝑦) ↔ (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)))
16	5, 15	rexeqbidv 3130	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧 ∧ 𝑧(lt‘𝑝)𝑦) ↔ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)))
17	16	notbid 307	. . . . . 6 ⊢ (𝑝 = 𝐾 → (¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧 ∧ 𝑧(lt‘𝑝)𝑦) ↔ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)))
18	8, 12, 17	3anbi123d 1391	. . . . 5 ⊢ (𝑝 = 𝐾 → (((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ∧ 𝑥(lt‘𝑝)𝑦 ∧ ¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧 ∧ 𝑧(lt‘𝑝)𝑦)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))))
19	18	opabbidv 4648	. . . 4 ⊢ (𝑝 = 𝐾 → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ∧ 𝑥(lt‘𝑝)𝑦 ∧ ¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧 ∧ 𝑧(lt‘𝑝)𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))})
20		df-covers 33571	. . . 4 ⊢ ⋖ = (𝑝 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ∧ 𝑥(lt‘𝑝)𝑦 ∧ ¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧 ∧ 𝑧(lt‘𝑝)𝑦))})
21		3anass 1035	. . . . . 6 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))))
22	21	opabbii 4649	. . . . 5 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)))}
23		fvex 6113	. . . . . . . 8 ⊢ (Base‘𝐾) ∈ V
24	4, 23	eqeltri 2684	. . . . . . 7 ⊢ 𝐵 ∈ V
25	24, 24	xpex 6860	. . . . . 6 ⊢ (𝐵 × 𝐵) ∈ V
26		opabssxp 5116	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)))} ⊆ (𝐵 × 𝐵)
27	25, 26	ssexi 4731	. . . . 5 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)))} ∈ V
28	22, 27	eqeltri 2684	. . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))} ∈ V
29	19, 20, 28	fvmpt 6191	. . 3 ⊢ (𝐾 ∈ V → ( ⋖ ‘𝐾) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))})
30	2, 29	syl5eq 2656	. 2 ⊢ (𝐾 ∈ V → 𝐶 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))})
31	1, 30	syl 17	1 ⊢ (𝐾 ∈ 𝐴 → 𝐶 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))})

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977  ∃wrex 2897  Vcvv 3173   class class class wbr 4583  {copab 4642   × cxp 5036  ‘cfv 5804  Basecbs 15695  ltcplt 16764   ⋖ ccvr 33567

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-iota 5768  df-fun 5806  df-fv 5812  df-covers 33571

This theorem is referenced by:  cvrval  33574