Theorem istrnN 37287

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 37286	. . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝑇‘𝐷) = {𝑓 ∈ (𝐿‘𝐷) ∣ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷}))})
10	9	eleq2d 2898	. 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐹 ∈ (𝑇‘𝐷) ↔ 𝐹 ∈ {𝑓 ∈ (𝐿‘𝐷) ∣ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷}))}))
11		fveq1 6663	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑞) = (𝐹‘𝑞))
12	11	oveq2d 7166	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑞 + (𝑓‘𝑞)) = (𝑞 + (𝐹‘𝑞)))
13	12	ineq1d 4187	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})))
14		fveq1 6663	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑟) = (𝐹‘𝑟))
15	14	oveq2d 7166	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑟 + (𝑓‘𝑟)) = (𝑟 + (𝐹‘𝑟)))
16	15	ineq1d 4187	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷})))
17	13, 16	eqeq12d 2837	. . . 4 ⊢ (𝑓 = 𝐹 → (((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷})) ↔ ((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷}))))
18	17	2ralbidv 3199	. . 3 ⊢ (𝑓 = 𝐹 → (∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷})) ↔ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷}))))
19	18	elrab 3679	. 2 ⊢ (𝐹 ∈ {𝑓 ∈ (𝐿‘𝐷) ∣ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝑓‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝑓‘𝑟)) ∩ ( ⊥ ‘{𝐷}))} ↔ (𝐹 ∈ (𝐿‘𝐷) ∧ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷}))))
20	10, 19	syl6bb 289	1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝐷 ∈ 𝐴) → (𝐹 ∈ (𝑇‘𝐷) ↔ (𝐹 ∈ (𝐿‘𝐷) ∧ ∀𝑞 ∈ (𝑊‘𝐷)∀𝑟 ∈ (𝑊‘𝐷)((𝑞 + (𝐹‘𝑞)) ∩ ( ⊥ ‘{𝐷})) = ((𝑟 + (𝐹‘𝑟)) ∩ ( ⊥ ‘{𝐷})))))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1533   ∈ wcel 2110  ∀wral 3138  {crab 3142   ∩ cin 3934  {csn 4560  ‘cfv 6349  (class class class)co 7150  Atomscatm 36393  PSubSpcpsubsp 36626  +_𝑃cpadd 36925  ⊥_𝑃cpolN 37032  WAtomscwpointsN 37116  PAutcpautN 37117  DilcdilN 37232  TrnctrnN 37233

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5182  ax-sep 5195  ax-nul 5202  ax-pr 5321

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-ov 7153  df-trnN 37237

This theorem is referenced by: (None)