Theorem pats 39665

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 3463	. 2 ⊢ (𝐾 ∈ 𝐷 → 𝐾 ∈ V)
2		patoms.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
3		fveq2 6842	. . . . . 6 ⊢ (𝑝 = 𝐾 → (Base‘𝑝) = (Base‘𝐾))
4		patoms.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
5	3, 4	eqtr4di 2790	. . . . 5 ⊢ (𝑝 = 𝐾 → (Base‘𝑝) = 𝐵)
6		fveq2 6842	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → ( ⋖ ‘𝑝) = ( ⋖ ‘𝐾))
7		patoms.c	. . . . . . . 8 ⊢ 𝐶 = ( ⋖ ‘𝐾)
8	6, 7	eqtr4di 2790	. . . . . . 7 ⊢ (𝑝 = 𝐾 → ( ⋖ ‘𝑝) = 𝐶)
9	8	breqd 5111	. . . . . 6 ⊢ (𝑝 = 𝐾 → ((0.‘𝑝)( ⋖ ‘𝑝)𝑥 ↔ (0.‘𝑝)𝐶𝑥))
10		fveq2 6842	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → (0.‘𝑝) = (0.‘𝐾))
11		patoms.z	. . . . . . . 8 ⊢ 0 = (0.‘𝐾)
12	10, 11	eqtr4di 2790	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (0.‘𝑝) = 0 )
13	12	breq1d 5110	. . . . . 6 ⊢ (𝑝 = 𝐾 → ((0.‘𝑝)𝐶𝑥 ↔ 0 𝐶𝑥))
14	9, 13	bitrd 279	. . . . 5 ⊢ (𝑝 = 𝐾 → ((0.‘𝑝)( ⋖ ‘𝑝)𝑥 ↔ 0 𝐶𝑥))
15	5, 14	rabeqbidv 3419	. . . 4 ⊢ (𝑝 = 𝐾 → {𝑥 ∈ (Base‘𝑝) ∣ (0.‘𝑝)( ⋖ ‘𝑝)𝑥} = {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥})
16		df-ats 39647	. . . 4 ⊢ Atoms = (𝑝 ∈ V ↦ {𝑥 ∈ (Base‘𝑝) ∣ (0.‘𝑝)( ⋖ ‘𝑝)𝑥})
17	4	fvexi 6856	. . . . 5 ⊢ 𝐵 ∈ V
18	17	rabex 5286	. . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥} ∈ V
19	15, 16, 18	fvmpt 6949	. . 3 ⊢ (𝐾 ∈ V → (Atoms‘𝐾) = {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥})
20	2, 19	eqtrid 2784	. 2 ⊢ (𝐾 ∈ V → 𝐴 = {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥})
21	1, 20	syl 17	1 ⊢ (𝐾 ∈ 𝐷 → 𝐴 = {𝑥 ∈ 𝐵 ∣ 0 𝐶𝑥})

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  {crab 3401  Vcvv 3442   class class class wbr 5100  ‘cfv 6500  Basecbs 17148  0.cp0 18356   ⋖ ccvr 39642  Atomscatm 39643

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-iota 6456  df-fun 6502  df-fv 6508  df-ats 39647

This theorem is referenced by:  isat  39666