Theorem p1val 18507

Description: Value of poset zero. (Contributed by NM, 22-Oct-2011.)

Hypotheses

Ref	Expression
p1val.b	⊢ 𝐵 = (Base‘𝐾)
p1val.u	⊢ 𝑈 = (lub‘𝐾)
p1val.t	⊢ 1 = (1.‘𝐾)

Assertion

Ref	Expression
p1val	⊢ (𝐾 ∈ 𝑉 → 1 = (𝑈‘𝐵))

Proof of Theorem p1val

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3479	. 2 ⊢ (𝐾 ∈ 𝑉 → 𝐾 ∈ V)
2		p1val.t	. . 3 ⊢ 1 = (1.‘𝐾)
3		fveq2 6888	. . . . . 6 ⊢ (𝑘 = 𝐾 → (lub‘𝑘) = (lub‘𝐾))
4		p1val.u	. . . . . 6 ⊢ 𝑈 = (lub‘𝐾)
5	3, 4	eqtr4di 2819	. . . . 5 ⊢ (𝑘 = 𝐾 → (lub‘𝑘) = 𝑈)
6		fveq2 6888	. . . . . 6 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
7		p1val.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
8	6, 7	eqtr4di 2819	. . . . 5 ⊢ (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
9	5, 8	fveq12d 6895	. . . 4 ⊢ (𝑘 = 𝐾 → ((lub‘𝑘)‘(Base‘𝑘)) = (𝑈‘𝐵))
10		df-p1 18505	. . . 4 ⊢ 1. = (𝑘 ∈ V ↦ ((lub‘𝑘)‘(Base‘𝑘)))
11		fvex 6901	. . . 4 ⊢ (𝑈‘𝐵) ∈ V
12	9, 10, 11	fvmpt 6996	. . 3 ⊢ (𝐾 ∈ V → (1.‘𝐾) = (𝑈‘𝐵))
13	2, 12	eqtrid 2813	. 2 ⊢ (𝐾 ∈ V → 1 = (𝑈‘𝐵))
14	1, 13	syl 18	1 ⊢ (𝐾 ∈ 𝑉 → 1 = (𝑈‘𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  Vcvv 3458  ‘cfv 6543  Basecbs 17294  lubclub 18390  1.cp1 18503

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-pr 5409

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-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-p1 18505

This theorem is used by:  ple1  18509  clatp1cl  33328  xrsp1  33364  op1cl  40000