Theorem pats 39792

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 3454	. 2 ⊢ (𝐾 ∈ 𝐷 → 𝐾 ∈ V)
2		patoms.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
3		fveq2 6831	. . . . . 6 ⊢ (𝑝 = 𝐾 → (Base‘𝑝) = (Base‘𝐾))
4		patoms.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
5	3, 4	eqtr4di 2794	. . . . 5 ⊢ (𝑝 = 𝐾 → (Base‘𝑝) = 𝐵)
6		fveq2 6831	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → ( ⋖ ‘𝑝) = ( ⋖ ‘𝐾))
7		patoms.c	. . . . . . . 8 ⊢ 𝐶 = ( ⋖ ‘𝐾)
8	6, 7	eqtr4di 2794	. . . . . . 7 ⊢ (𝑝 = 𝐾 → ( ⋖ ‘𝑝) = 𝐶)
9	8	breqd 5086	. . . . . 6 ⊢ (𝑝 = 𝐾 → ((0.‘𝑝)( ⋖ ‘𝑝)𝑥 ↔ (0.‘𝑝)𝐶𝑥))
10		fveq2 6831	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → (0.‘𝑝) = (0.‘𝐾))
11		patoms.z	. . . . . . . 8 ⊢ 0 = (0.‘𝐾)
12	10, 11	eqtr4di 2794	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (0.‘𝑝) = 0 )
13	12	breq1d 5085	. . . . . 6 ⊢ (𝑝 = 𝐾 → ((0.‘𝑝)𝐶𝑥 ↔ 0 𝐶𝑥))
14	9, 13	bitrd 281	. . . . 5 ⊢ (𝑝 = 𝐾 → ((0.‘𝑝)( ⋖ ‘𝑝)𝑥 ↔ 0 𝐶𝑥))
15	5, 14	rabeqbidv 3411	. . . 4 ⊢ (𝑝 = 𝐾 → {𝑥 ∈ (Base‘𝑝) ∣ (0.‘𝑝)( ⋖ ‘𝑝)𝑥} = {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥})
16		df-ats 39774	. . . 4 ⊢ Atoms = (𝑝 ∈ V ↦ {𝑥 ∈ (Base‘𝑝) ∣ (0.‘𝑝)( ⋖ ‘𝑝)𝑥})
17	4	fvexi 6845	. . . . 5 ⊢ 𝐵 ∈ V
18	17	rabex 5270	. . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥} ∈ V
19	15, 16, 18	fvmpt 6939	. . 3 ⊢ (𝐾 ∈ V → (Atoms‘𝐾) = {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥})
20	2, 19	eqtrid 2788	. 2 ⊢ (𝐾 ∈ V → 𝐴 = {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥})
21	1, 20	syl 17	1 ⊢ (𝐾 ∈ 𝐷 → 𝐴 = {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥})

Syntax hints:   → wi 4   = wceq 1548   ∈ wcel 2121  {crab 3393  Vcvv 3433   class class class wbr 5075  ‘cfv 6489  Basecbs 17174  0.cp0 18382   ⋖ ccvr 39769  Atomscatm 39770

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pr 5365

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-br 5076  df-opab 5138  df-mpt 5157  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-iota 6445  df-fun 6491  df-fv 6497  df-ats 39774

This theorem is referenced by:  isat  39793