Theorem pats 39484

Description: The set of atoms in a poset. (Contributed by NM, 18-Sep-2011.)

Hypotheses

Ref	Expression
patoms.b	⊢ 𝐵 = (Base‘𝐾)
patoms.z	⊢ 0 = (0.‘𝐾)
patoms.c	⊢ 𝐶 = ( ⋖ ‘𝐾)
patoms.a	⊢ 𝐴 = (Atoms‘𝐾)

Assertion

Ref	Expression
pats	⊢ (𝐾 ∈ 𝐷 → 𝐴 = {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥})

Distinct variable groups:   𝑥,𝐵   𝑥,𝐾

Allowed substitution hints:   𝐴(𝑥)   𝐶(𝑥)   𝐷(𝑥)   0 (𝑥)

Proof of Theorem pats

Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3459	. 2 ⊢ (𝐾 ∈ 𝐷 → 𝐾 ∈ V)
2		patoms.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
3		fveq2 6832	. . . . . 6 ⊢ (𝑝 = 𝐾 → (Base‘𝑝) = (Base‘𝐾))
4		patoms.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
5	3, 4	eqtr4di 2787	. . . . 5 ⊢ (𝑝 = 𝐾 → (Base‘𝑝) = 𝐵)
6		fveq2 6832	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → ( ⋖ ‘𝑝) = ( ⋖ ‘𝐾))
7		patoms.c	. . . . . . . 8 ⊢ 𝐶 = ( ⋖ ‘𝐾)
8	6, 7	eqtr4di 2787	. . . . . . 7 ⊢ (𝑝 = 𝐾 → ( ⋖ ‘𝑝) = 𝐶)
9	8	breqd 5107	. . . . . 6 ⊢ (𝑝 = 𝐾 → ((0.‘𝑝)( ⋖ ‘𝑝)𝑥 ↔ (0.‘𝑝)𝐶𝑥))
10		fveq2 6832	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → (0.‘𝑝) = (0.‘𝐾))
11		patoms.z	. . . . . . . 8 ⊢ 0 = (0.‘𝐾)
12	10, 11	eqtr4di 2787	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (0.‘𝑝) = 0 )
13	12	breq1d 5106	. . . . . 6 ⊢ (𝑝 = 𝐾 → ((0.‘𝑝)𝐶𝑥 ↔ 0 𝐶𝑥))
14	9, 13	bitrd 279	. . . . 5 ⊢ (𝑝 = 𝐾 → ((0.‘𝑝)( ⋖ ‘𝑝)𝑥 ↔ 0 𝐶𝑥))
15	5, 14	rabeqbidv 3415	. . . 4 ⊢ (𝑝 = 𝐾 → {𝑥 ∈ (Base‘𝑝) ∣ (0.‘𝑝)( ⋖ ‘𝑝)𝑥} = {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥})
16		df-ats 39466	. . . 4 ⊢ Atoms = (𝑝 ∈ V ↦ {𝑥 ∈ (Base‘𝑝) ∣ (0.‘𝑝)( ⋖ ‘𝑝)𝑥})
17	4	fvexi 6846	. . . . 5 ⊢ 𝐵 ∈ V
18	17	rabex 5282	. . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥} ∈ V
19	15, 16, 18	fvmpt 6939	. . 3 ⊢ (𝐾 ∈ V → (Atoms‘𝐾) = {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥})
20	2, 19	eqtrid 2781	. 2 ⊢ (𝐾 ∈ V → 𝐴 = {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥})
21	1, 20	syl 17	1 ⊢ (𝐾 ∈ 𝐷 → 𝐴 = {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥})

Syntax hints:   → wi 4   = wceq 1541   ∈ wcel 2113  {crab 3397  Vcvv 3438   class class class wbr 5096  ‘cfv 6490  Basecbs 17134  0.cp0 18342   ⋖ ccvr 39461  Atomscatm 39462

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-iota 6446  df-fun 6492  df-fv 6498  df-ats 39466

This theorem is referenced by:  isat  39485