Theorem cvrfval 40083

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 3479	. 2 ⊢ (𝐾 ∈ 𝐴 → 𝐾 ∈ V)
2		cvrfval.c	. . 3 ⊢ 𝐶 = ( ⋖ ‘𝐾)
3		fveq2 6888	. . . . . . . . 9 ⊢ (𝑝 = 𝐾 → (Base‘𝑝) = (Base‘𝐾))
4		cvrfval.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝐾)
5	3, 4	eqtr4di 2819	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → (Base‘𝑝) = 𝐵)
6	5	eleq2d 2852	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (𝑥 ∈ (Base‘𝑝) ↔ 𝑥 ∈ 𝐵))
7	5	eleq2d 2852	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (𝑦 ∈ (Base‘𝑝) ↔ 𝑦 ∈ 𝐵))
8	6, 7	anbi12d 644	. . . . . 6 ⊢ (𝑝 = 𝐾 → ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
9		fveq2 6888	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → (lt‘𝑝) = (lt‘𝐾))
10		cvrfval.s	. . . . . . . 8 ⊢ < = (lt‘𝐾)
11	9, 10	eqtr4di 2819	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (lt‘𝑝) = < )
12	11	breqd 5125	. . . . . 6 ⊢ (𝑝 = 𝐾 → (𝑥(lt‘𝑝)𝑦 ↔ 𝑥 < 𝑦))
13	11	breqd 5125	. . . . . . . . 9 ⊢ (𝑝 = 𝐾 → (𝑥(lt‘𝑝)𝑧 ↔ 𝑥 < 𝑧))
14	11	breqd 5125	. . . . . . . . 9 ⊢ (𝑝 = 𝐾 → (𝑧(lt‘𝑝)𝑦 ↔ 𝑧 < 𝑦))
15	13, 14	anbi12d 644	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → ((𝑥(lt‘𝑝)𝑧 ∧ 𝑧(lt‘𝑝)𝑦) ↔ (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)))
16	5, 15	rexeqbidv 3342	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧 ∧ 𝑧(lt‘𝑝)𝑦) ↔ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)))
17	16	notbid 321	. . . . . 6 ⊢ (𝑝 = 𝐾 → (¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧 ∧ 𝑧(lt‘𝑝)𝑦) ↔ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)))
18	8, 12, 17	3anbi123d 1464	. . . . 5 ⊢ (𝑝 = 𝐾 → (((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ∧ 𝑥(lt‘𝑝)𝑦 ∧ ¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧 ∧ 𝑧(lt‘𝑝)𝑦)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))))
19	18	opabbidv 5182	. . . 4 ⊢ (𝑝 = 𝐾 → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ∧ 𝑥(lt‘𝑝)𝑦 ∧ ¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧 ∧ 𝑧(lt‘𝑝)𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))})
20		df-covers 40081	. . . 4 ⊢ ⋖ = (𝑝 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝)) ∧ 𝑥(lt‘𝑝)𝑦 ∧ ¬ ∃𝑧 ∈ (Base‘𝑝)(𝑥(lt‘𝑝)𝑧 ∧ 𝑧(lt‘𝑝)𝑦))})
21		3anass 1111	. . . . . 6 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))))
22	21	opabbii 5183	. . . . 5 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)))}
23	4	fvexi 6902	. . . . . . 7 ⊢ 𝐵 ∈ V
24	23, 23	xpex 7761	. . . . . 6 ⊢ (𝐵 × 𝐵) ∈ V
25		opabssxp 5758	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)))} ⊆ (𝐵 × 𝐵)
26	24, 25	ssexi 5298	. . . . 5 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)))} ∈ V
27	22, 26	eqeltri 2862	. . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))} ∈ V
28	19, 20, 27	fvmpt 6996	. . 3 ⊢ (𝐾 ∈ V → ( ⋖ ‘𝐾) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))})
29	2, 28	eqtrid 2813	. 2 ⊢ (𝐾 ∈ V → 𝐶 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))})
30	1, 29	syl 18	1 ⊢ (𝐾 ∈ 𝐴 → 𝐶 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 < 𝑦 ∧ ¬ ∃𝑧 ∈ 𝐵 (𝑥 < 𝑧 ∧ 𝑧 < 𝑦))})

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∃wrex 3092  Vcvv 3458   class class class wbr 5114  {copab 5178   × cxp 5664  ‘cfv 6543  Basecbs 17294  ltcplt 18389   ⋖ ccvr 40077

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-covers 40081

This theorem is used by:  cvrval  40084