Theorem istrnN 40781

Description: The predicate "is a translation". (Contributed by NM, 4-Feb-2012.) (New usage is discouraged.)

Hypotheses

Ref	Expression
trnset.a	⊢ 𝐴 = (Atoms‘𝐾)
trnset.s	⊢ 𝑆 = (PSubSp‘𝐾)
trnset.p	⊢ + = (+𝑃‘𝐾)
trnset.o	⊢ ⊥ = (⊥𝑃‘𝐾)
trnset.w	⊢ 𝑊 = (WAtoms‘𝐾)
trnset.m	⊢ 𝑀 = (PAut‘𝐾)
trnset.l	⊢ 𝐿 = (Dil‘𝐾)
trnset.t	⊢ 𝑇 = (Trn‘𝐾)

Assertion

Ref	Expression
istrnN	⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐹 ∈ (𝑇‘𝐷) ↔ (𝐹 ∈ (𝐿‘𝐷) ∧ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷})))))

Distinct variable groups:   𝑟,𝑞,𝐾   𝑊,𝑞,𝑟   𝐷,𝑞,𝑟   𝐹,𝑞,𝑟

Allowed substitution hints:   𝐴(𝑟,𝑞)   𝐵(𝑟,𝑞)   + (𝑟,𝑞)   𝑆(𝑟,𝑞)   𝑇(𝑟,𝑞)   𝐿(𝑟,𝑞)   𝑀(𝑟,𝑞)   ⊥ (𝑟,𝑞)

Proof of Theorem istrnN

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		trnset.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
2		trnset.s	. . . 4 ⊢ 𝑆 = (PSubSp‘𝐾)
3		trnset.p	. . . 4 ⊢ + = (+𝑃‘𝐾)
4		trnset.o	. . . 4 ⊢ ⊥ = (⊥𝑃‘𝐾)
5		trnset.w	. . . 4 ⊢ 𝑊 = (WAtoms‘𝐾)
6		trnset.m	. . . 4 ⊢ 𝑀 = (PAut‘𝐾)
7		trnset.l	. . . 4 ⊢ 𝐿 = (Dil‘𝐾)
8		trnset.t	. . . 4 ⊢ 𝑇 = (Trn‘𝐾)
9	1, 2, 3, 4, 5, 6, 7, 8	trnsetN 40780	. . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝑇‘𝐷) = {𝑓 ∈ (𝐿‘𝐷) ∣ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷}))})
10	9	eleq2d 2848	. 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐹 ∈ (𝑇‘𝐷) ↔ 𝐹 ∈ {𝑓 ∈ (𝐿‘𝐷) ∣ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷}))}))
11		fveq1 6866	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑞) = (𝐹‘𝑞))
12	11	oveq2d 7412	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑞 + (𝑓‘𝑞)) = (𝑞 + (𝐹‘𝑞)))
13	12	ineq1d 4171	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})))
14		fveq1 6866	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑟) = (𝐹‘𝑟))
15	14	oveq2d 7412	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑟 + (𝑓‘𝑟)) = (𝑟 + (𝐹‘𝑟)))
16	15	ineq1d 4171	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷})))
17	13, 16	eqeq12d 2778	. . . 4 ⊢ (𝑓 = 𝐹 → (((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷})) ↔ ((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷}))))
18	17	2ralbidv 3226	. . 3 ⊢ (𝑓 = 𝐹 → (∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷})) ↔ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷}))))
19	18	elrab 3650	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ (𝐿‘𝐷) ∣ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷}))} ↔ (𝐹 ∈ (𝐿‘𝐷) ∧ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷}))))
20	10, 19	bitrdi 289	1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐹 ∈ (𝑇‘𝐷) ↔ (𝐹 ∈ (𝐿‘𝐷) ∧ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷})))))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1560   ∈ wcel 2142  ∀wral 3076  {crab 3414   ∩ cin 3903  {csn 4582  ‘cfv 6521  (class class class)co 7396  Atomscatm 39887  PSubSpcpsubsp 40120  +_𝑃cpadd 40419  ⊥_𝑃cpolN 40526  WAtomscwpointsN 40610  PAutcpautN 40611  DilcdilN 40726  TrnctrnN 40727

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pr 5390

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-ov 7399  df-trnN 40731

This theorem is referenced by: (None)